./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c69768cb083538b139479bdbb35676eb3378c1b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c69768cb083538b139479bdbb35676eb3378c1b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-10-22 11:22:45,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:45,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:45,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:45,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:45,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:45,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:45,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:45,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:45,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:45,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:45,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:45,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:45,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:45,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:45,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:45,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:45,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:45,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:45,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:45,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:45,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:45,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:45,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:45,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:45,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:45,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:45,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:45,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:45,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:45,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:45,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:45,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:45,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:45,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:45,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:45,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:45,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:45,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:45,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:45,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:45,760 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:45,770 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:45,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:45,771 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:45,771 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:45,772 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:45,772 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:45,772 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:45,772 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:45,772 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:45,772 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:45,772 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:45,773 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:45,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:45,773 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:45,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:45,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:45,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:45,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:45,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:45,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:45,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:45,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:45,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:45,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:45,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:45,776 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:45,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:45,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:45,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:45,777 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan 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 -> Taipan 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 -> 9c69768cb083538b139479bdbb35676eb3378c1b [2019-10-22 11:22:45,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:45,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:45,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:45,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:45,817 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:45,817 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 11:22:45,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/c6bc26026/e2e6b43dcb7a44e4810df7555a6424d3/FLAG7b2c5da59 [2019-10-22 11:22:46,341 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:46,343 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 11:22:46,360 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/c6bc26026/e2e6b43dcb7a44e4810df7555a6424d3/FLAG7b2c5da59 [2019-10-22 11:22:46,843 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/c6bc26026/e2e6b43dcb7a44e4810df7555a6424d3 [2019-10-22 11:22:46,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:46,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:46,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:46,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:46,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:46,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:46" (1/1) ... [2019-10-22 11:22:46,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62066543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:46, skipping insertion in model container [2019-10-22 11:22:46,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:46" (1/1) ... [2019-10-22 11:22:46,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:46,913 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:47,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:47,445 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:47,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:47,588 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:47,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47 WrapperNode [2019-10-22 11:22:47,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:47,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:47,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:47,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:47,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:47,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:47,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:47,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:47,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... [2019-10-22 11:22:47,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:47,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:47,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:47,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:47,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/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-10-22 11:22:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:22:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:47,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:22:47,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:22:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:22:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:47,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:47,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:48,131 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:22:48,982 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 11:22:48,982 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 11:22:48,984 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:48,984 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:22:48,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:48 BoogieIcfgContainer [2019-10-22 11:22:48,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:48,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:48,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:48,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:48,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:46" (1/3) ... [2019-10-22 11:22:48,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a82150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:48, skipping insertion in model container [2019-10-22 11:22:48,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:47" (2/3) ... [2019-10-22 11:22:48,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a82150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:48, skipping insertion in model container [2019-10-22 11:22:48,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:48" (3/3) ... [2019-10-22 11:22:48,992 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-10-22 11:22:49,000 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:49,007 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:22:49,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:22:49,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:49,038 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:49,038 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:49,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:49,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:49,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:49,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:49,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-10-22 11:22:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:22:49,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,062 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,063 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-10-22 11:22:49,077 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233407052] [2019-10-22 11:22:49,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:49,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233407052] [2019-10-22 11:22:49,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:49,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:49,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871103711] [2019-10-22 11:22:49,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:49,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:49,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:49,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:49,391 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-10-22 11:22:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:49,817 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-10-22 11:22:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:49,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 11:22:49,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:49,830 INFO L225 Difference]: With dead ends: 317 [2019-10-22 11:22:49,830 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 11:22:49,843 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-10-22 11:22:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 11:22:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-10-22 11:22:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-10-22 11:22:49,895 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-10-22 11:22:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:49,895 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-10-22 11:22:49,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-10-22 11:22:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 11:22:49,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:49,899 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:49,899 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:49,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-10-22 11:22:49,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:49,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069014904] [2019-10-22 11:22:49,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:49,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069014904] [2019-10-22 11:22:50,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:50,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443273899] [2019-10-22 11:22:50,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:50,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:50,054 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-10-22 11:22:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,413 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-10-22 11:22:50,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:50,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-22 11:22:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,415 INFO L225 Difference]: With dead ends: 284 [2019-10-22 11:22:50,415 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 11:22:50,416 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-10-22 11:22:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 11:22:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-10-22 11:22:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-10-22 11:22:50,432 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-10-22 11:22:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,432 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-10-22 11:22:50,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-10-22 11:22:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:22:50,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,434 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,434 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-10-22 11:22:50,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509134622] [2019-10-22 11:22:50,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:50,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509134622] [2019-10-22 11:22:50,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:50,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:50,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510395108] [2019-10-22 11:22:50,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:50,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:50,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:50,582 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-10-22 11:22:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:50,892 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-10-22 11:22:50,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:50,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:22:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:50,894 INFO L225 Difference]: With dead ends: 282 [2019-10-22 11:22:50,894 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 11:22:50,895 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-10-22 11:22:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 11:22:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-10-22 11:22:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-10-22 11:22:50,911 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-10-22 11:22:50,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:50,911 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-10-22 11:22:50,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-10-22 11:22:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:22:50,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:50,913 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:50,913 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-10-22 11:22:50,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:50,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128010651] [2019-10-22 11:22:50,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:50,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128010651] [2019-10-22 11:22:51,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:51,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457096474] [2019-10-22 11:22:51,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:51,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:51,007 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-10-22 11:22:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,267 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-10-22 11:22:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:51,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:22:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,269 INFO L225 Difference]: With dead ends: 281 [2019-10-22 11:22:51,269 INFO L226 Difference]: Without dead ends: 157 [2019-10-22 11:22:51,270 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-10-22 11:22:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-22 11:22:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-10-22 11:22:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-10-22 11:22:51,285 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-10-22 11:22:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,286 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-10-22 11:22:51,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-10-22 11:22:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 11:22:51,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,288 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,288 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-10-22 11:22:51,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588365483] [2019-10-22 11:22:51,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588365483] [2019-10-22 11:22:51,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:51,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098093936] [2019-10-22 11:22:51,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:51,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:51,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:51,360 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-10-22 11:22:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,600 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-10-22 11:22:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:51,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 11:22:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,602 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:22:51,602 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 11:22:51,602 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-10-22 11:22:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 11:22:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 11:22:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-10-22 11:22:51,609 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-10-22 11:22:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,609 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-10-22 11:22:51,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-10-22 11:22:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 11:22:51,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,610 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,611 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-10-22 11:22:51,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728117049] [2019-10-22 11:22:51,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728117049] [2019-10-22 11:22:51,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:51,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606157091] [2019-10-22 11:22:51,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:51,656 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:51,657 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-10-22 11:22:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:51,890 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-10-22 11:22:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:51,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 11:22:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:51,891 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:22:51,892 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 11:22:51,892 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-10-22 11:22:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 11:22:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 11:22:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-10-22 11:22:51,897 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-10-22 11:22:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:51,898 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-10-22 11:22:51,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-10-22 11:22:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 11:22:51,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,899 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:51,900 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-10-22 11:22:51,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:51,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245740188] [2019-10-22 11:22:51,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:51,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:51,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245740188] [2019-10-22 11:22:51,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:51,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:51,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231278672] [2019-10-22 11:22:51,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:51,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:51,975 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-10-22 11:22:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,193 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-10-22 11:22:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 11:22:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,194 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:22:52,194 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 11:22:52,195 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-10-22 11:22:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 11:22:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 11:22:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-10-22 11:22:52,200 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-10-22 11:22:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,200 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-10-22 11:22:52,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-10-22 11:22:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 11:22:52,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,201 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,201 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-10-22 11:22:52,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523501251] [2019-10-22 11:22:52,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523501251] [2019-10-22 11:22:52,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:52,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298686140] [2019-10-22 11:22:52,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,250 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-10-22 11:22:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,504 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-10-22 11:22:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 11:22:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,505 INFO L225 Difference]: With dead ends: 280 [2019-10-22 11:22:52,505 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 11:22:52,506 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-10-22 11:22:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 11:22:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 11:22:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:22:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-10-22 11:22:52,513 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-10-22 11:22:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,514 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-10-22 11:22:52,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-10-22 11:22:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 11:22:52,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,515 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-10-22 11:22:52,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147438183] [2019-10-22 11:22:52,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147438183] [2019-10-22 11:22:52,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:52,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215765982] [2019-10-22 11:22:52,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,588 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-10-22 11:22:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,811 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-10-22 11:22:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:52,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 11:22:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,813 INFO L225 Difference]: With dead ends: 310 [2019-10-22 11:22:52,813 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:22:52,813 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-10-22 11:22:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:22:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-10-22 11:22:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-10-22 11:22:52,819 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-10-22 11:22:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,819 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-10-22 11:22:52,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-10-22 11:22:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:22:52,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,820 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:52,820 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:52,821 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-10-22 11:22:52,821 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:52,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744049648] [2019-10-22 11:22:52,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:52,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744049648] [2019-10-22 11:22:52,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:52,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285343346] [2019-10-22 11:22:52,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:52,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,880 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-10-22 11:22:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,067 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-10-22 11:22:53,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:22:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,069 INFO L225 Difference]: With dead ends: 314 [2019-10-22 11:22:53,069 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 11:22:53,069 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-10-22 11:22:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 11:22:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-10-22 11:22:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-10-22 11:22:53,074 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-10-22 11:22:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,074 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-10-22 11:22:53,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-10-22 11:22:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 11:22:53,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,075 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,075 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-10-22 11:22:53,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133693473] [2019-10-22 11:22:53,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133693473] [2019-10-22 11:22:53,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:53,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926332691] [2019-10-22 11:22:53,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:53,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:53,136 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-10-22 11:22:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,372 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-10-22 11:22:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-10-22 11:22:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,374 INFO L225 Difference]: With dead ends: 332 [2019-10-22 11:22:53,374 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 11:22:53,374 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-10-22 11:22:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 11:22:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-10-22 11:22:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-10-22 11:22:53,379 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-10-22 11:22:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,380 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-10-22 11:22:53,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-10-22 11:22:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 11:22:53,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,380 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,381 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-10-22 11:22:53,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181023787] [2019-10-22 11:22:53,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181023787] [2019-10-22 11:22:53,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:53,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622472534] [2019-10-22 11:22:53,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:53,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:53,428 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-10-22 11:22:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,693 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-10-22 11:22:53,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 11:22:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,694 INFO L225 Difference]: With dead ends: 330 [2019-10-22 11:22:53,694 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 11:22:53,695 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-10-22 11:22:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 11:22:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-10-22 11:22:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-10-22 11:22:53,701 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-10-22 11:22:53,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,701 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-10-22 11:22:53,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,701 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-10-22 11:22:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 11:22:53,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,702 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,702 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-10-22 11:22:53,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:53,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790370896] [2019-10-22 11:22:53,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:53,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790370896] [2019-10-22 11:22:53,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:53,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968550325] [2019-10-22 11:22:53,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:53,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:53,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:53,762 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-10-22 11:22:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:54,013 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-10-22 11:22:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:54,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 11:22:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:54,015 INFO L225 Difference]: With dead ends: 329 [2019-10-22 11:22:54,015 INFO L226 Difference]: Without dead ends: 183 [2019-10-22 11:22:54,015 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-10-22 11:22:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-22 11:22:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-10-22 11:22:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:54,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-10-22 11:22:54,024 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-10-22 11:22:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:54,025 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-10-22 11:22:54,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-10-22 11:22:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 11:22:54,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:54,027 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:54,027 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:54,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-10-22 11:22:54,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:54,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694101255] [2019-10-22 11:22:54,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:54,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694101255] [2019-10-22 11:22:54,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:54,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:54,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649636514] [2019-10-22 11:22:54,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:54,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:54,090 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-10-22 11:22:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:54,395 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-10-22 11:22:54,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:54,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 11:22:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:54,396 INFO L225 Difference]: With dead ends: 328 [2019-10-22 11:22:54,396 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 11:22:54,397 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-10-22 11:22:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 11:22:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 11:22:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:54,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-10-22 11:22:54,403 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-10-22 11:22:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:54,405 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-10-22 11:22:54,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-10-22 11:22:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 11:22:54,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:54,406 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:54,406 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-10-22 11:22:54,406 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:54,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845916981] [2019-10-22 11:22:54,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:54,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845916981] [2019-10-22 11:22:54,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:54,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:54,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416090114] [2019-10-22 11:22:54,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:54,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:54,455 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-10-22 11:22:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:54,715 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-10-22 11:22:54,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:54,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 11:22:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:54,717 INFO L225 Difference]: With dead ends: 328 [2019-10-22 11:22:54,717 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 11:22:54,717 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-10-22 11:22:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 11:22:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 11:22:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-10-22 11:22:54,721 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-10-22 11:22:54,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:54,722 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-10-22 11:22:54,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-10-22 11:22:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 11:22:54,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:54,723 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:54,723 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:54,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-10-22 11:22:54,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:54,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215919657] [2019-10-22 11:22:54,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:54,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:54,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215919657] [2019-10-22 11:22:54,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:54,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:54,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396938739] [2019-10-22 11:22:54,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:54,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:54,759 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-10-22 11:22:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:55,016 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-10-22 11:22:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:55,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 11:22:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:55,018 INFO L225 Difference]: With dead ends: 328 [2019-10-22 11:22:55,018 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 11:22:55,019 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-10-22 11:22:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 11:22:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 11:22:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-10-22 11:22:55,026 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-10-22 11:22:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:55,026 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-10-22 11:22:55,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-10-22 11:22:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 11:22:55,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:55,027 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:55,027 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-10-22 11:22:55,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:55,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992393920] [2019-10-22 11:22:55,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:55,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992393920] [2019-10-22 11:22:55,073 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:55,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:55,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019940139] [2019-10-22 11:22:55,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:55,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:55,074 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-10-22 11:22:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:55,347 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-10-22 11:22:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:55,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-22 11:22:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:55,348 INFO L225 Difference]: With dead ends: 328 [2019-10-22 11:22:55,349 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 11:22:55,349 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-10-22 11:22:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 11:22:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 11:22:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-10-22 11:22:55,353 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-10-22 11:22:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:55,354 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-10-22 11:22:55,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-10-22 11:22:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 11:22:55,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:55,355 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:55,356 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-10-22 11:22:55,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:55,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266953360] [2019-10-22 11:22:55,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:55,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266953360] [2019-10-22 11:22:55,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:55,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:55,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464245630] [2019-10-22 11:22:55,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:55,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:55,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:55,411 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-10-22 11:22:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:55,634 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-10-22 11:22:55,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:55,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-22 11:22:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:55,636 INFO L225 Difference]: With dead ends: 318 [2019-10-22 11:22:55,636 INFO L226 Difference]: Without dead ends: 172 [2019-10-22 11:22:55,636 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-10-22 11:22:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-22 11:22:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-10-22 11:22:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 11:22:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-10-22 11:22:55,641 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-10-22 11:22:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:55,641 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-10-22 11:22:55,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-10-22 11:22:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:22:55,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:55,642 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:55,642 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:55,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:55,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-10-22 11:22:55,642 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:55,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352921410] [2019-10-22 11:22:55,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,643 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:55,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:55,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352921410] [2019-10-22 11:22:55,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:55,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:55,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408889413] [2019-10-22 11:22:55,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:55,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:55,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:55,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:55,713 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-10-22 11:22:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:56,036 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-10-22 11:22:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:56,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 11:22:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:56,037 INFO L225 Difference]: With dead ends: 408 [2019-10-22 11:22:56,038 INFO L226 Difference]: Without dead ends: 262 [2019-10-22 11:22:56,038 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-10-22 11:22:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-22 11:22:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-10-22 11:22:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-22 11:22:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-10-22 11:22:56,043 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-10-22 11:22:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:56,043 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-10-22 11:22:56,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-10-22 11:22:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:22:56,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:56,044 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:56,045 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-10-22 11:22:56,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:56,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569134670] [2019-10-22 11:22:56,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:56,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569134670] [2019-10-22 11:22:56,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:56,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:56,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304265009] [2019-10-22 11:22:56,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:56,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:56,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:56,135 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-10-22 11:22:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:56,436 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-10-22 11:22:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:56,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 11:22:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:56,437 INFO L225 Difference]: With dead ends: 446 [2019-10-22 11:22:56,437 INFO L226 Difference]: Without dead ends: 257 [2019-10-22 11:22:56,438 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-10-22 11:22:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-22 11:22:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-10-22 11:22:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-10-22 11:22:56,443 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-10-22 11:22:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:56,443 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-10-22 11:22:56,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-10-22 11:22:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 11:22:56,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:56,444 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:56,444 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-10-22 11:22:56,445 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:56,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315588798] [2019-10-22 11:22:56,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:56,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315588798] [2019-10-22 11:22:56,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:56,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:56,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075285452] [2019-10-22 11:22:56,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:56,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:56,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:56,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:56,507 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-10-22 11:22:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:56,841 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-10-22 11:22:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:56,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 11:22:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:56,842 INFO L225 Difference]: With dead ends: 499 [2019-10-22 11:22:56,842 INFO L226 Difference]: Without dead ends: 286 [2019-10-22 11:22:56,843 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-10-22 11:22:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-22 11:22:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-10-22 11:22:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-10-22 11:22:56,848 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-10-22 11:22:56,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:56,849 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-10-22 11:22:56,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-10-22 11:22:56,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 11:22:56,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:56,849 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:56,850 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:56,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:56,850 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-10-22 11:22:56,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:56,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800277927] [2019-10-22 11:22:56,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:56,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:56,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800277927] [2019-10-22 11:22:56,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:56,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:56,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12985832] [2019-10-22 11:22:56,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:56,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:56,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:56,916 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-10-22 11:22:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:57,236 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-10-22 11:22:57,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:57,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 11:22:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:57,237 INFO L225 Difference]: With dead ends: 470 [2019-10-22 11:22:57,238 INFO L226 Difference]: Without dead ends: 257 [2019-10-22 11:22:57,238 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-10-22 11:22:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-22 11:22:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-10-22 11:22:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-10-22 11:22:57,243 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-10-22 11:22:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:57,243 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-10-22 11:22:57,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-10-22 11:22:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:22:57,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:57,244 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:57,245 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-10-22 11:22:57,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:57,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993395952] [2019-10-22 11:22:57,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:57,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:57,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:57,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993395952] [2019-10-22 11:22:57,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:57,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:57,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281139426] [2019-10-22 11:22:57,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:57,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:57,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:57,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:57,295 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-10-22 11:22:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:57,649 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-10-22 11:22:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:57,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:22:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:57,651 INFO L225 Difference]: With dead ends: 497 [2019-10-22 11:22:57,651 INFO L226 Difference]: Without dead ends: 284 [2019-10-22 11:22:57,651 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-10-22 11:22:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-22 11:22:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-10-22 11:22:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-10-22 11:22:57,656 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-10-22 11:22:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:57,656 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-10-22 11:22:57,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-10-22 11:22:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:22:57,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:57,657 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:57,657 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-10-22 11:22:57,657 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:57,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230231953] [2019-10-22 11:22:57,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:57,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:57,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:57,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230231953] [2019-10-22 11:22:57,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:57,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:57,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287738533] [2019-10-22 11:22:57,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:57,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:57,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:57,717 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-10-22 11:22:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:58,085 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-10-22 11:22:58,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:58,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:22:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:58,086 INFO L225 Difference]: With dead ends: 496 [2019-10-22 11:22:58,086 INFO L226 Difference]: Without dead ends: 283 [2019-10-22 11:22:58,087 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-10-22 11:22:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-22 11:22:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-10-22 11:22:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-10-22 11:22:58,094 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-10-22 11:22:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:58,094 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-10-22 11:22:58,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-10-22 11:22:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:22:58,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:58,095 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:58,096 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:58,096 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-10-22 11:22:58,096 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:58,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934804872] [2019-10-22 11:22:58,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:58,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:58,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:58,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934804872] [2019-10-22 11:22:58,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:58,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:58,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031847071] [2019-10-22 11:22:58,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:58,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:58,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:58,169 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-10-22 11:22:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:58,469 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-10-22 11:22:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:58,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:22:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:58,470 INFO L225 Difference]: With dead ends: 468 [2019-10-22 11:22:58,471 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 11:22:58,471 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-10-22 11:22:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 11:22:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-10-22 11:22:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-10-22 11:22:58,475 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-10-22 11:22:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:58,476 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-10-22 11:22:58,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-10-22 11:22:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:22:58,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:58,476 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:58,477 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-10-22 11:22:58,477 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:58,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614570629] [2019-10-22 11:22:58,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:58,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:58,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:58,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614570629] [2019-10-22 11:22:58,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:58,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:58,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706083104] [2019-10-22 11:22:58,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:58,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:58,523 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-10-22 11:22:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:58,799 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-10-22 11:22:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:58,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 11:22:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:58,800 INFO L225 Difference]: With dead ends: 467 [2019-10-22 11:22:58,800 INFO L226 Difference]: Without dead ends: 254 [2019-10-22 11:22:58,801 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-10-22 11:22:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-22 11:22:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-10-22 11:22:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-10-22 11:22:58,805 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-10-22 11:22:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:58,805 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-10-22 11:22:58,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-10-22 11:22:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:22:58,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:58,806 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:58,807 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-10-22 11:22:58,807 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:58,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649937010] [2019-10-22 11:22:58,807 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:58,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:58,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:58,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649937010] [2019-10-22 11:22:58,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:58,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:58,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970115470] [2019-10-22 11:22:58,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:58,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:58,874 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-10-22 11:22:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:59,159 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-10-22 11:22:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:59,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 11:22:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:59,160 INFO L225 Difference]: With dead ends: 495 [2019-10-22 11:22:59,160 INFO L226 Difference]: Without dead ends: 282 [2019-10-22 11:22:59,161 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-10-22 11:22:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-22 11:22:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-22 11:22:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 11:22:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-10-22 11:22:59,165 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-10-22 11:22:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:59,166 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-10-22 11:22:59,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-10-22 11:22:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:22:59,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:59,167 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:59,167 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:59,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-10-22 11:22:59,167 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:59,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926977246] [2019-10-22 11:22:59,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:59,168 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:59,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 11:22:59,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926977246] [2019-10-22 11:22:59,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:59,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:59,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089262274] [2019-10-22 11:22:59,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:59,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:59,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:59,232 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-10-22 11:22:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:59,621 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-10-22 11:22:59,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:59,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-22 11:22:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:59,622 INFO L225 Difference]: With dead ends: 466 [2019-10-22 11:22:59,622 INFO L226 Difference]: Without dead ends: 253 [2019-10-22 11:22:59,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-22 11:22:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-10-22 11:22:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:22:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-10-22 11:22:59,627 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-10-22 11:22:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:59,628 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-10-22 11:22:59,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-10-22 11:22:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:22:59,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:59,628 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:59,629 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-10-22 11:22:59,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:59,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849858908] [2019-10-22 11:22:59,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:59,630 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:59,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:22:59,683 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849858908] [2019-10-22 11:22:59,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:59,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:59,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408795596] [2019-10-22 11:22:59,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:59,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:59,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:59,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:59,685 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-10-22 11:23:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:00,031 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-10-22 11:23:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:00,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 11:23:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:00,033 INFO L225 Difference]: With dead ends: 535 [2019-10-22 11:23:00,033 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 11:23:00,033 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-10-22 11:23:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 11:23:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-10-22 11:23:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-10-22 11:23:00,040 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-10-22 11:23:00,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:00,040 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-10-22 11:23:00,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-10-22 11:23:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:23:00,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:00,041 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:00,041 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-10-22 11:23:00,042 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:00,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234972656] [2019-10-22 11:23:00,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:00,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:00,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:00,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234972656] [2019-10-22 11:23:00,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:00,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:00,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651473132] [2019-10-22 11:23:00,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:00,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:00,088 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-10-22 11:23:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:00,354 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-10-22 11:23:00,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:00,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 11:23:00,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:00,355 INFO L225 Difference]: With dead ends: 506 [2019-10-22 11:23:00,355 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 11:23:00,356 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-10-22 11:23:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 11:23:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-10-22 11:23:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-10-22 11:23:00,361 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-10-22 11:23:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:00,361 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-10-22 11:23:00,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-10-22 11:23:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 11:23:00,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:00,362 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:00,362 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:00,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-10-22 11:23:00,363 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:00,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951482091] [2019-10-22 11:23:00,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:00,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:00,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:00,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951482091] [2019-10-22 11:23:00,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:00,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:00,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775942313] [2019-10-22 11:23:00,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:00,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:00,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:00,451 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-10-22 11:23:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:00,760 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-10-22 11:23:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:00,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 11:23:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:00,761 INFO L225 Difference]: With dead ends: 535 [2019-10-22 11:23:00,761 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 11:23:00,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 11:23:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-10-22 11:23:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-10-22 11:23:00,768 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-10-22 11:23:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:00,768 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-10-22 11:23:00,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-10-22 11:23:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 11:23:00,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:00,769 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:00,770 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:00,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-10-22 11:23:00,770 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:00,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17976364] [2019-10-22 11:23:00,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:00,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:00,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:00,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17976364] [2019-10-22 11:23:00,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:00,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:00,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184565289] [2019-10-22 11:23:00,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:00,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:00,836 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-10-22 11:23:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:01,079 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-10-22 11:23:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:01,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 11:23:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:01,081 INFO L225 Difference]: With dead ends: 506 [2019-10-22 11:23:01,081 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 11:23:01,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:01,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 11:23:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-10-22 11:23:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-10-22 11:23:01,087 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-10-22 11:23:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:01,088 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-10-22 11:23:01,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-10-22 11:23:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 11:23:01,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:01,089 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:01,089 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-10-22 11:23:01,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:01,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882353393] [2019-10-22 11:23:01,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:01,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:01,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:01,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882353393] [2019-10-22 11:23:01,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:01,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:01,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813062176] [2019-10-22 11:23:01,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:01,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:01,135 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-10-22 11:23:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:01,479 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-10-22 11:23:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:01,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 11:23:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:01,481 INFO L225 Difference]: With dead ends: 535 [2019-10-22 11:23:01,481 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 11:23:01,482 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-10-22 11:23:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 11:23:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-10-22 11:23:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-10-22 11:23:01,488 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-10-22 11:23:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:01,489 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-10-22 11:23:01,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-10-22 11:23:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 11:23:01,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:01,490 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:01,490 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-10-22 11:23:01,491 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:01,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590478148] [2019-10-22 11:23:01,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:01,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:01,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:01,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590478148] [2019-10-22 11:23:01,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:01,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:01,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970700488] [2019-10-22 11:23:01,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:01,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:01,545 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-10-22 11:23:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:01,823 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-10-22 11:23:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:01,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 11:23:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:01,825 INFO L225 Difference]: With dead ends: 506 [2019-10-22 11:23:01,825 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 11:23:01,826 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-10-22 11:23:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 11:23:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-10-22 11:23:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-10-22 11:23:01,832 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-10-22 11:23:01,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:01,832 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-10-22 11:23:01,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-10-22 11:23:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 11:23:01,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:01,833 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:01,833 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-10-22 11:23:01,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:01,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937704166] [2019-10-22 11:23:01,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:01,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:01,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:01,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937704166] [2019-10-22 11:23:01,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:01,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:01,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122084836] [2019-10-22 11:23:01,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:01,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:01,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:01,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:01,892 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-10-22 11:23:02,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:02,199 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-10-22 11:23:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:02,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 11:23:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:02,201 INFO L225 Difference]: With dead ends: 525 [2019-10-22 11:23:02,201 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 11:23:02,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 11:23:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-10-22 11:23:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-10-22 11:23:02,207 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-10-22 11:23:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:02,207 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-10-22 11:23:02,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-10-22 11:23:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 11:23:02,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:02,208 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:02,208 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:02,209 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-10-22 11:23:02,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:02,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280517590] [2019-10-22 11:23:02,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:02,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:02,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:02,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280517590] [2019-10-22 11:23:02,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:02,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:02,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241876774] [2019-10-22 11:23:02,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:02,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:02,273 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-10-22 11:23:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:02,510 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-10-22 11:23:02,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:02,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 11:23:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:02,512 INFO L225 Difference]: With dead ends: 496 [2019-10-22 11:23:02,512 INFO L226 Difference]: Without dead ends: 263 [2019-10-22 11:23:02,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-22 11:23:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-10-22 11:23:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-10-22 11:23:02,518 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-10-22 11:23:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:02,519 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-10-22 11:23:02,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-10-22 11:23:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 11:23:02,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:02,520 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:02,521 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:02,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:02,522 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-10-22 11:23:02,522 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:02,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071831216] [2019-10-22 11:23:02,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:02,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:02,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:02,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071831216] [2019-10-22 11:23:02,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:02,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:02,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774004050] [2019-10-22 11:23:02,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:02,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:02,594 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-10-22 11:23:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:02,956 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-10-22 11:23:02,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:02,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 11:23:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:02,958 INFO L225 Difference]: With dead ends: 525 [2019-10-22 11:23:02,958 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 11:23:02,959 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-10-22 11:23:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 11:23:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-10-22 11:23:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 11:23:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-10-22 11:23:02,967 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-10-22 11:23:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:02,968 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-10-22 11:23:02,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-10-22 11:23:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 11:23:02,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:02,969 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:02,969 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-10-22 11:23:02,969 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:02,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154920645] [2019-10-22 11:23:02,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:02,970 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:02,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 11:23:03,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154920645] [2019-10-22 11:23:03,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:03,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:03,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808256182] [2019-10-22 11:23:03,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:03,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:03,064 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-10-22 11:23:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:03,098 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-10-22 11:23:03,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:03,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 11:23:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:03,100 INFO L225 Difference]: With dead ends: 716 [2019-10-22 11:23:03,100 INFO L226 Difference]: Without dead ends: 483 [2019-10-22 11:23:03,100 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-10-22 11:23:03,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-22 11:23:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-10-22 11:23:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-10-22 11:23:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-10-22 11:23:03,112 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-10-22 11:23:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:03,112 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-10-22 11:23:03,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-10-22 11:23:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 11:23:03,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:03,113 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:03,114 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-10-22 11:23:03,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:03,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267704288] [2019-10-22 11:23:03,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:03,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:03,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-22 11:23:03,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267704288] [2019-10-22 11:23:03,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:03,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:03,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827620887] [2019-10-22 11:23:03,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:03,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:03,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:03,175 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-10-22 11:23:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:03,222 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-10-22 11:23:03,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:03,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-22 11:23:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:03,225 INFO L225 Difference]: With dead ends: 947 [2019-10-22 11:23:03,225 INFO L226 Difference]: Without dead ends: 483 [2019-10-22 11:23:03,225 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-10-22 11:23:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-22 11:23:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-10-22 11:23:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-10-22 11:23:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-10-22 11:23:03,237 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-10-22 11:23:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:03,237 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-10-22 11:23:03,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-10-22 11:23:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 11:23:03,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:03,239 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:03,239 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:03,239 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-10-22 11:23:03,239 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:03,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725317692] [2019-10-22 11:23:03,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:03,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:03,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:03,486 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:23:03,486 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:03,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:03 BoogieIcfgContainer [2019-10-22 11:23:03,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:03,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:03,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:03,611 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:03,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:48" (3/4) ... [2019-10-22 11:23:03,614 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:23:03,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:03,617 INFO L168 Benchmark]: Toolchain (without parser) took 16770.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.0 MB). Free memory was 939.2 MB in the beginning and 1.2 GB in the end (delta: -277.1 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:03,618 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:03,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:03,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:03,619 INFO L168 Benchmark]: Boogie Preprocessor took 105.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:03,619 INFO L168 Benchmark]: RCFGBuilder took 1194.91 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: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:03,619 INFO L168 Benchmark]: TraceAbstraction took 14623.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:03,620 INFO L168 Benchmark]: Witness Printer took 5.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:03,621 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1194.91 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: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14623.74 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 230.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -210.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.26 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-10:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-10:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-10:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-10:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-10:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-10:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-10:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-10:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-10:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-10:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-10:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-10:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-10:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-10:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-10:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-10:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-10:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-10:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-10:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-10:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-10:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-10:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-10:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-10:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-10:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 10403 SDs, 0 SdLazy, 6834 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 86 SyntacticMatches, 33 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 773930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:05,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:05,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:05,568 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:05,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:05,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:05,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:05,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:05,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:05,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:05,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:05,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:05,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:05,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:05,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:05,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:05,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:05,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:05,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:05,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:05,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:05,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:05,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:05,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:05,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:05,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:05,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:05,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:05,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:05,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:05,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:05,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:05,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:05,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:05,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:05,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:05,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:05,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:05,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:05,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:05,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:05,595 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:23:05,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:05,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:05,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:05,617 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:05,618 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:05,618 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:05,618 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:05,618 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:05,618 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:05,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:05,619 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:05,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:05,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:05,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:05,620 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:23:05,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:05,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:05,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:05,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:05,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:05,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:05,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:05,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:05,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:05,622 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:23:05,622 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:23:05,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:05,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:05,623 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/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan 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 -> Taipan 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 -> 9c69768cb083538b139479bdbb35676eb3378c1b [2019-10-22 11:23:05,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:05,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:05,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:05,679 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:05,679 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:05,680 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 11:23:05,720 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/f93eba4e4/9d14603b502a499f91384ab00761caf4/FLAG2fc669dee [2019-10-22 11:23:06,192 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:06,192 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 11:23:06,208 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/f93eba4e4/9d14603b502a499f91384ab00761caf4/FLAG2fc669dee [2019-10-22 11:23:06,699 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/data/f93eba4e4/9d14603b502a499f91384ab00761caf4 [2019-10-22 11:23:06,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:06,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:06,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:06,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:06,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:06,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:06" (1/1) ... [2019-10-22 11:23:06,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d881ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:06, skipping insertion in model container [2019-10-22 11:23:06,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:06" (1/1) ... [2019-10-22 11:23:06,719 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:06,788 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:07,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:07,300 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:07,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:07,464 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:07,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07 WrapperNode [2019-10-22 11:23:07,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:07,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:07,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:07,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:07,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:07,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:07,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:07,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:07,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... [2019-10-22 11:23:07,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:07,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:07,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:07,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:07,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/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-10-22 11:23:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:23:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:07,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:07,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:07,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:23:08,014 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:23:10,835 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 11:23:10,835 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 11:23:10,837 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:10,837 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:23:10,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:10 BoogieIcfgContainer [2019-10-22 11:23:10,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:10,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:10,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:10,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:10,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:06" (1/3) ... [2019-10-22 11:23:10,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d14bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:10, skipping insertion in model container [2019-10-22 11:23:10,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:07" (2/3) ... [2019-10-22 11:23:10,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d14bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:10, skipping insertion in model container [2019-10-22 11:23:10,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:10" (3/3) ... [2019-10-22 11:23:10,846 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-10-22 11:23:10,855 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:10,862 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:10,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:10,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:10,889 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:10,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:10,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:10,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:10,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:10,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:10,890 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-10-22 11:23:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:23:10,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:10,917 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-10-22 11:23:10,930 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:10,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [83732858] [2019-10-22 11:23:10,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/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-10-22 11:23:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:23:11,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,160 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [83732858] [2019-10-22 11:23:11,188 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:23:11,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852076165] [2019-10-22 11:23:11,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:11,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:11,207 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-10-22 11:23:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:11,327 INFO L93 Difference]: Finished difference Result 549 states and 925 transitions. [2019-10-22 11:23:11,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:11,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 11:23:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:11,342 INFO L225 Difference]: With dead ends: 549 [2019-10-22 11:23:11,342 INFO L226 Difference]: Without dead ends: 373 [2019-10-22 11:23:11,348 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-10-22 11:23:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2019-10-22 11:23:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-22 11:23:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2019-10-22 11:23:11,412 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 45 [2019-10-22 11:23:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:11,413 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2019-10-22 11:23:11,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2019-10-22 11:23:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:23:11,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:11,415 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:11,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:11,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash -60762572, now seen corresponding path program 1 times [2019-10-22 11:23:11,617 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:11,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [180300192] [2019-10-22 11:23:11,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/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-10-22 11:23:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:23:11,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,851 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180300192] [2019-10-22 11:23:11,872 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:11,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:23:11,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894505418] [2019-10-22 11:23:11,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:11,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:11,876 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand 4 states. [2019-10-22 11:23:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:12,230 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2019-10-22 11:23:12,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:12,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:23:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:12,234 INFO L225 Difference]: With dead ends: 853 [2019-10-22 11:23:12,234 INFO L226 Difference]: Without dead ends: 611 [2019-10-22 11:23:12,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-22 11:23:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-10-22 11:23:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-10-22 11:23:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 922 transitions. [2019-10-22 11:23:12,270 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 922 transitions. Word has length 63 [2019-10-22 11:23:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:12,271 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 922 transitions. [2019-10-22 11:23:12,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 922 transitions. [2019-10-22 11:23:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 11:23:12,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:12,275 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:12,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:12,476 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2005677060, now seen corresponding path program 1 times [2019-10-22 11:23:12,477 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:12,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [991466682] [2019-10-22 11:23:12,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/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-10-22 11:23:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:12,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:23:12,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:12,802 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:23:12,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991466682] [2019-10-22 11:23:12,840 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:12,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:23:12,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064613526] [2019-10-22 11:23:12,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:12,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:12,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:12,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:12,844 INFO L87 Difference]: Start difference. First operand 609 states and 922 transitions. Second operand 4 states. [2019-10-22 11:23:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:13,441 INFO L93 Difference]: Finished difference Result 1091 states and 1654 transitions. [2019-10-22 11:23:13,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:13,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-22 11:23:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:13,445 INFO L225 Difference]: With dead ends: 1091 [2019-10-22 11:23:13,446 INFO L226 Difference]: Without dead ends: 611 [2019-10-22 11:23:13,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-22 11:23:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-22 11:23:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 11:23:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 918 transitions. [2019-10-22 11:23:13,479 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 918 transitions. Word has length 123 [2019-10-22 11:23:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:13,480 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 918 transitions. [2019-10-22 11:23:13,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 918 transitions. [2019-10-22 11:23:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 11:23:13,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:13,489 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:13,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:13,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-10-22 11:23:13,692 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:13,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1241493559] [2019-10-22 11:23:13,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/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-10-22 11:23:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:16,146 INFO L168 tionRefinementEngine]: Strategy WALRUS found a feasible trace [2019-10-22 11:23:16,147 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:16,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:16,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:16 BoogieIcfgContainer [2019-10-22 11:23:16,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:16,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:16,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:16,484 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:16,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:10" (3/4) ... [2019-10-22 11:23:16,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:23:16,584 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a763d80-d888-496b-8554-0dc31815b502/bin/utaipan/witness.graphml [2019-10-22 11:23:16,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:16,585 INFO L168 Benchmark]: Toolchain (without parser) took 9881.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -99.6 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,586 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:16,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,587 INFO L168 Benchmark]: Boogie Preprocessor took 101.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,587 INFO L168 Benchmark]: RCFGBuilder took 3171.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,587 INFO L168 Benchmark]: TraceAbstraction took 5644.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.8 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,587 INFO L168 Benchmark]: Witness Printer took 99.94 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:16,589 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 760.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3171.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5644.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.8 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Witness Printer took 99.94 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1706]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.5s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 951 SDtfs, 1145 SDslu, 976 SDs, 0 SdLazy, 86 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 120522 SizeOfPredicates, 2 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 224/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...