./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1952eae46575e60399f761afaedbe356b8f81a96 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1952eae46575e60399f761afaedbe356b8f81a96 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:57:03,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:57:03,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:57:03,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:57:03,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:57:03,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:57:03,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:57:03,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:57:03,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:57:03,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:57:03,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:57:03,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:57:03,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:57:03,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:57:03,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:57:03,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:57:03,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:57:03,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:57:03,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:57:03,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:57:03,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:57:03,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:57:03,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:57:03,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:57:03,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:57:03,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:57:03,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:57:03,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:57:03,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:57:03,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:57:03,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:57:03,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:57:03,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:57:03,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:57:03,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:57:03,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:57:03,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:57:03,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:57:03,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:57:03,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:57:03,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:57:03,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:57:03,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:57:03,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:57:03,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:57:03,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:57:03,849 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:57:03,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:57:03,850 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:57:03,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:57:03,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:57:03,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:57:03,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:57:03,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:57:03,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:57:03,851 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:57:03,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:57:03,852 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:57:03,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:57:03,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:57:03,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:57:03,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:57:03,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:57:03,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:57:03,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:57:03,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:57:03,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:57:03,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:57:03,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:57:03,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:57:03,855 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-15 20:57:03,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:57:03,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:57:03,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:57:03,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:57:03,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:57:03,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-15 20:57:04,012 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/2c279d528/1631321e24b74f1287e2ae0136e30055/FLAGa4bb05981 [2019-11-15 20:57:04,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:57:04,583 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-15 20:57:04,602 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/2c279d528/1631321e24b74f1287e2ae0136e30055/FLAGa4bb05981 [2019-11-15 20:57:04,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/2c279d528/1631321e24b74f1287e2ae0136e30055 [2019-11-15 20:57:04,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:57:04,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:57:04,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:57:04,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:57:04,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:57:04,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:57:04" (1/1) ... [2019-11-15 20:57:04,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5bc5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:04, skipping insertion in model container [2019-11-15 20:57:04,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:57:04" (1/1) ... [2019-11-15 20:57:04,776 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:57:04,852 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:57:05,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:57:05,461 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:57:05,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:57:05,600 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:57:05,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05 WrapperNode [2019-11-15 20:57:05,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:57:05,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:57:05,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:57:05,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:57:05,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:57:05,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:57:05,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:57:05,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:57:05,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... [2019-11-15 20:57:05,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:57:05,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:57:05,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:57:05,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:57:05,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:57:05,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:57:05,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:57:05,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:57:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:57:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:57:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:57:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:57:05,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:57:06,226 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:57:07,488 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 20:57:07,489 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 20:57:07,490 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:57:07,490 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:57:07,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:57:07 BoogieIcfgContainer [2019-11-15 20:57:07,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:57:07,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:57:07,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:57:07,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:57:07,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:57:04" (1/3) ... [2019-11-15 20:57:07,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:57:07, skipping insertion in model container [2019-11-15 20:57:07,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:05" (2/3) ... [2019-11-15 20:57:07,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@acc9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:57:07, skipping insertion in model container [2019-11-15 20:57:07,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:57:07" (3/3) ... [2019-11-15 20:57:07,499 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-11-15 20:57:07,509 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:57:07,522 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:57:07,537 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:57:07,565 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:57:07,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:57:07,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:57:07,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:57:07,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:57:07,566 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:57:07,566 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:57:07,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:57:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 20:57:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:57:07,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:07,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:07,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:07,617 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-15 20:57:07,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:07,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471024397] [2019-11-15 20:57:07,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:07,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:07,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:08,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471024397] [2019-11-15 20:57:08,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:08,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:08,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703617192] [2019-11-15 20:57:08,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:08,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:08,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:08,082 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 20:57:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:08,740 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-15 20:57:08,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:08,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:57:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:08,768 INFO L225 Difference]: With dead ends: 313 [2019-11-15 20:57:08,769 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:57:08,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:57:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 20:57:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-15 20:57:08,836 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-15 20:57:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:08,837 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-15 20:57:08,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-15 20:57:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 20:57:08,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:08,841 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:08,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:08,842 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-11-15 20:57:08,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:08,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211233615] [2019-11-15 20:57:08,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:08,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:08,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:09,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211233615] [2019-11-15 20:57:09,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:09,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:09,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85098072] [2019-11-15 20:57:09,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:09,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:09,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:09,019 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-15 20:57:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:09,554 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-15 20:57:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:09,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 20:57:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:09,557 INFO L225 Difference]: With dead ends: 280 [2019-11-15 20:57:09,558 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:57:09,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:57:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 20:57:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-15 20:57:09,574 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-15 20:57:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:09,574 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-15 20:57:09,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-15 20:57:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:57:09,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:09,578 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:09,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-11-15 20:57:09,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:09,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479237656] [2019-11-15 20:57:09,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:09,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:09,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:09,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479237656] [2019-11-15 20:57:09,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:09,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:09,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527682373] [2019-11-15 20:57:09,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:09,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:09,739 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-15 20:57:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:10,184 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-15 20:57:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:10,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:57:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:10,188 INFO L225 Difference]: With dead ends: 279 [2019-11-15 20:57:10,188 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 20:57:10,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 20:57:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-15 20:57:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-15 20:57:10,218 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-15 20:57:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:10,219 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-15 20:57:10,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-15 20:57:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:57:10,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:10,228 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:10,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-11-15 20:57:10,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:10,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134100736] [2019-11-15 20:57:10,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:10,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:10,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:10,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134100736] [2019-11-15 20:57:10,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:10,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:10,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360052341] [2019-11-15 20:57:10,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:10,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:10,450 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-15 20:57:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:10,818 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-15 20:57:10,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:10,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:57:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:10,821 INFO L225 Difference]: With dead ends: 277 [2019-11-15 20:57:10,821 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 20:57:10,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 20:57:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-15 20:57:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-15 20:57:10,845 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-15 20:57:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:10,847 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-15 20:57:10,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-15 20:57:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:57:10,854 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:10,855 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:10,855 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-11-15 20:57:10,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:10,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901630558] [2019-11-15 20:57:10,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:10,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:10,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:10,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901630558] [2019-11-15 20:57:10,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:10,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:10,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135275928] [2019-11-15 20:57:10,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:10,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:10,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:10,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:10,969 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-15 20:57:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:11,317 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-15 20:57:11,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:11,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:57:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:11,320 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:57:11,320 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:57:11,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:57:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:57:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-15 20:57:11,347 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-15 20:57:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:11,348 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-15 20:57:11,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-15 20:57:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:57:11,349 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:11,350 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:11,350 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:11,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-11-15 20:57:11,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:11,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274871820] [2019-11-15 20:57:11,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:11,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:11,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274871820] [2019-11-15 20:57:11,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:11,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:11,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490071202] [2019-11-15 20:57:11,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:11,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:11,418 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-15 20:57:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:11,771 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-15 20:57:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:11,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:57:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:11,773 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:57:11,774 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:57:11,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:57:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:57:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-15 20:57:11,783 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-15 20:57:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:11,783 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-15 20:57:11,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-15 20:57:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:57:11,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:11,785 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:11,785 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-11-15 20:57:11,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:11,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731995519] [2019-11-15 20:57:11,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:11,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:11,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:11,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731995519] [2019-11-15 20:57:11,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:11,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:11,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701429146] [2019-11-15 20:57:11,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:11,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:11,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:11,871 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-15 20:57:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:12,231 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-15 20:57:12,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:12,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:57:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:12,233 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:57:12,233 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:57:12,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:57:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:57:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-15 20:57:12,240 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-15 20:57:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:12,241 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-15 20:57:12,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-15 20:57:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:57:12,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:12,242 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:12,242 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-11-15 20:57:12,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:12,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527175491] [2019-11-15 20:57:12,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:12,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:12,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:12,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527175491] [2019-11-15 20:57:12,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:12,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:12,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534188794] [2019-11-15 20:57:12,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:12,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:12,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:12,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:12,317 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-15 20:57:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:12,692 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-15 20:57:12,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:12,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 20:57:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:12,694 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:57:12,694 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:57:12,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:57:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:57:12,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-15 20:57:12,703 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-15 20:57:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:12,704 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-15 20:57:12,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-15 20:57:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:57:12,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:12,707 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:12,707 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:12,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:12,708 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-11-15 20:57:12,708 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:12,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222825310] [2019-11-15 20:57:12,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:12,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:12,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:12,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222825310] [2019-11-15 20:57:12,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:12,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:12,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336457351] [2019-11-15 20:57:12,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:12,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:12,794 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-15 20:57:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:13,100 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-15 20:57:13,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:13,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 20:57:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:13,103 INFO L225 Difference]: With dead ends: 266 [2019-11-15 20:57:13,103 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 20:57:13,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 20:57:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-15 20:57:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:57:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-15 20:57:13,114 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-15 20:57:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:13,117 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-15 20:57:13,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-15 20:57:13,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:57:13,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:13,118 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:13,119 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:13,119 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-11-15 20:57:13,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:13,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070253957] [2019-11-15 20:57:13,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:13,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:13,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:13,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070253957] [2019-11-15 20:57:13,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:13,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:13,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423879589] [2019-11-15 20:57:13,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:13,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:13,210 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-15 20:57:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:13,623 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-11-15 20:57:13,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:13,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 20:57:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:13,626 INFO L225 Difference]: With dead ends: 307 [2019-11-15 20:57:13,626 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 20:57:13,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 20:57:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-15 20:57:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-15 20:57:13,634 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-15 20:57:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:13,635 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-15 20:57:13,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-15 20:57:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 20:57:13,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:13,637 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:13,637 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-11-15 20:57:13,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:13,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812423547] [2019-11-15 20:57:13,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:13,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:13,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:13,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812423547] [2019-11-15 20:57:13,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:13,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:13,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506361930] [2019-11-15 20:57:13,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:13,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:13,718 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-15 20:57:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:14,142 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-11-15 20:57:14,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:14,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 20:57:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:14,144 INFO L225 Difference]: With dead ends: 329 [2019-11-15 20:57:14,144 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 20:57:14,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:14,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 20:57:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-11-15 20:57:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-15 20:57:14,151 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-15 20:57:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:14,152 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-15 20:57:14,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-15 20:57:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:57:14,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:14,153 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:14,154 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-11-15 20:57:14,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:14,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134780186] [2019-11-15 20:57:14,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:14,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:14,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:14,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134780186] [2019-11-15 20:57:14,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:14,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:14,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715916378] [2019-11-15 20:57:14,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:14,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:14,214 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-15 20:57:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:14,615 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-11-15 20:57:14,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:14,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:57:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:14,618 INFO L225 Difference]: With dead ends: 328 [2019-11-15 20:57:14,618 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 20:57:14,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 20:57:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-15 20:57:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-15 20:57:14,627 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-15 20:57:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:14,628 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-15 20:57:14,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-15 20:57:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:57:14,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:14,630 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:14,630 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-11-15 20:57:14,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:14,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22794782] [2019-11-15 20:57:14,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:14,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:14,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22794782] [2019-11-15 20:57:14,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:14,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:14,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638113650] [2019-11-15 20:57:14,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:14,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:14,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:14,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:14,706 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-15 20:57:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:15,090 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-11-15 20:57:15,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:15,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:57:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:15,092 INFO L225 Difference]: With dead ends: 326 [2019-11-15 20:57:15,092 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 20:57:15,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 20:57:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-11-15 20:57:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-15 20:57:15,101 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-15 20:57:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:15,102 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-15 20:57:15,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-15 20:57:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:57:15,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:15,104 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:15,104 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:15,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-11-15 20:57:15,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:15,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851410869] [2019-11-15 20:57:15,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:15,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:15,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:15,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851410869] [2019-11-15 20:57:15,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:15,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:15,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270307862] [2019-11-15 20:57:15,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:15,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:15,174 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-15 20:57:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:15,624 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-11-15 20:57:15,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:15,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:57:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:15,627 INFO L225 Difference]: With dead ends: 325 [2019-11-15 20:57:15,627 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 20:57:15,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 20:57:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 20:57:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-15 20:57:15,635 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-15 20:57:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:15,636 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-15 20:57:15,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-15 20:57:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:57:15,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:15,637 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:15,638 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-11-15 20:57:15,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:15,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003545687] [2019-11-15 20:57:15,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:15,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:15,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:15,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003545687] [2019-11-15 20:57:15,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:15,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:15,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768448684] [2019-11-15 20:57:15,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:15,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:15,693 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-15 20:57:16,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:16,106 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-11-15 20:57:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:16,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:57:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:16,109 INFO L225 Difference]: With dead ends: 325 [2019-11-15 20:57:16,109 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 20:57:16,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 20:57:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 20:57:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-15 20:57:16,123 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-15 20:57:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:16,123 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-15 20:57:16,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-15 20:57:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 20:57:16,124 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:16,125 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:16,125 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-11-15 20:57:16,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:16,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712956582] [2019-11-15 20:57:16,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:16,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:16,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712956582] [2019-11-15 20:57:16,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:16,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:16,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267266315] [2019-11-15 20:57:16,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:16,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:16,190 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-15 20:57:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:16,645 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-11-15 20:57:16,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:16,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 20:57:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:16,648 INFO L225 Difference]: With dead ends: 325 [2019-11-15 20:57:16,648 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 20:57:16,648 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 20:57:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 20:57:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-15 20:57:16,660 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-15 20:57:16,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:16,660 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-15 20:57:16,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-15 20:57:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:57:16,662 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:16,662 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:16,662 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:16,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:16,663 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-11-15 20:57:16,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:16,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070891032] [2019-11-15 20:57:16,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:16,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:16,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:16,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070891032] [2019-11-15 20:57:16,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:16,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:16,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553572964] [2019-11-15 20:57:16,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:16,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:16,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:16,719 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-15 20:57:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:17,109 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-11-15 20:57:17,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:17,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 20:57:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:17,112 INFO L225 Difference]: With dead ends: 325 [2019-11-15 20:57:17,112 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 20:57:17,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 20:57:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 20:57:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-15 20:57:17,123 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-15 20:57:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:17,123 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-15 20:57:17,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-15 20:57:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:57:17,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:17,125 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:17,125 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-11-15 20:57:17,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:17,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811344885] [2019-11-15 20:57:17,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:17,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:17,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:17,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811344885] [2019-11-15 20:57:17,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:17,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:17,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317976515] [2019-11-15 20:57:17,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:17,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:17,186 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-15 20:57:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:17,526 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-11-15 20:57:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:17,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 20:57:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:17,528 INFO L225 Difference]: With dead ends: 315 [2019-11-15 20:57:17,528 INFO L226 Difference]: Without dead ends: 171 [2019-11-15 20:57:17,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-15 20:57:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-11-15 20:57:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:57:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-15 20:57:17,537 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-15 20:57:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:17,537 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-15 20:57:17,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-15 20:57:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:57:17,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:17,539 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:17,539 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-11-15 20:57:17,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:17,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225026155] [2019-11-15 20:57:17,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:17,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:17,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225026155] [2019-11-15 20:57:17,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:17,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:17,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101827160] [2019-11-15 20:57:17,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:17,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:17,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:17,665 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-15 20:57:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:18,215 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-15 20:57:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:18,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 20:57:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:18,218 INFO L225 Difference]: With dead ends: 403 [2019-11-15 20:57:18,218 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 20:57:18,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 20:57:18,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-15 20:57:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 20:57:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-15 20:57:18,229 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-15 20:57:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:18,230 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-15 20:57:18,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-15 20:57:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:57:18,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:18,232 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:18,232 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-11-15 20:57:18,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:18,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505072052] [2019-11-15 20:57:18,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:18,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:18,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:18,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505072052] [2019-11-15 20:57:18,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:18,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:18,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203269497] [2019-11-15 20:57:18,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:18,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:18,348 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-15 20:57:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:18,794 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-11-15 20:57:18,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:18,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 20:57:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:18,797 INFO L225 Difference]: With dead ends: 443 [2019-11-15 20:57:18,797 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 20:57:18,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 20:57:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-15 20:57:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:57:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-15 20:57:18,807 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-15 20:57:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:18,808 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-15 20:57:18,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-15 20:57:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:57:18,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:18,810 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:18,810 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-11-15 20:57:18,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:18,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241904894] [2019-11-15 20:57:18,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:18,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:18,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:18,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241904894] [2019-11-15 20:57:18,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:18,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:18,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382662482] [2019-11-15 20:57:18,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:18,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:18,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:18,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:18,907 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-15 20:57:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:19,501 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-15 20:57:19,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:19,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:57:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:19,504 INFO L225 Difference]: With dead ends: 494 [2019-11-15 20:57:19,504 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 20:57:19,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 20:57:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-15 20:57:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:57:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-15 20:57:19,513 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-15 20:57:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:19,514 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-15 20:57:19,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-15 20:57:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:57:19,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:19,516 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:19,516 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-11-15 20:57:19,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:19,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197227010] [2019-11-15 20:57:19,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:19,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:19,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:19,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197227010] [2019-11-15 20:57:19,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:19,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:19,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139085353] [2019-11-15 20:57:19,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:19,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:19,598 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-15 20:57:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:19,978 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-11-15 20:57:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:19,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:57:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:19,981 INFO L225 Difference]: With dead ends: 467 [2019-11-15 20:57:19,981 INFO L226 Difference]: Without dead ends: 256 [2019-11-15 20:57:19,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-15 20:57:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-11-15 20:57:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:57:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-15 20:57:19,990 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-15 20:57:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:19,990 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-15 20:57:19,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-15 20:57:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:57:19,992 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:19,993 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:19,993 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-11-15 20:57:19,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:19,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725979957] [2019-11-15 20:57:19,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:19,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:19,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:20,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725979957] [2019-11-15 20:57:20,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:20,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:20,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613848941] [2019-11-15 20:57:20,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:20,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:20,061 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-15 20:57:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:20,623 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-15 20:57:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:20,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:57:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:20,626 INFO L225 Difference]: With dead ends: 493 [2019-11-15 20:57:20,626 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 20:57:20,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 20:57:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-15 20:57:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:57:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-15 20:57:20,635 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-15 20:57:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:20,635 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-15 20:57:20,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-15 20:57:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:57:20,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:20,637 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:20,638 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-11-15 20:57:20,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:20,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266243805] [2019-11-15 20:57:20,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:20,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:20,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:20,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266243805] [2019-11-15 20:57:20,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:20,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:20,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046513721] [2019-11-15 20:57:20,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:20,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:20,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:20,739 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-15 20:57:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:21,270 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-15 20:57:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:21,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:57:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:21,273 INFO L225 Difference]: With dead ends: 491 [2019-11-15 20:57:21,273 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 20:57:21,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:21,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 20:57:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-15 20:57:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:57:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-15 20:57:21,282 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-15 20:57:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:21,283 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-15 20:57:21,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-15 20:57:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:57:21,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:21,284 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:21,285 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:21,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-11-15 20:57:21,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:21,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693003793] [2019-11-15 20:57:21,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:21,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:21,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:21,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693003793] [2019-11-15 20:57:21,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:21,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:21,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6388683] [2019-11-15 20:57:21,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:21,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:21,363 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-15 20:57:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:21,913 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-15 20:57:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:21,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:57:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:21,916 INFO L225 Difference]: With dead ends: 490 [2019-11-15 20:57:21,916 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 20:57:21,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 20:57:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-15 20:57:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:57:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-15 20:57:21,925 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-15 20:57:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:21,925 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-15 20:57:21,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-15 20:57:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:57:21,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:21,927 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:21,928 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:21,928 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-11-15 20:57:21,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:21,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969188468] [2019-11-15 20:57:21,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:21,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:21,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 20:57:22,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969188468] [2019-11-15 20:57:22,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:22,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:57:22,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569795706] [2019-11-15 20:57:22,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:57:22,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:57:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:22,028 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-15 20:57:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:22,517 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-15 20:57:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:57:22,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 20:57:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:22,519 INFO L225 Difference]: With dead ends: 462 [2019-11-15 20:57:22,519 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 20:57:22,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:57:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 20:57:22,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-15 20:57:22,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-15 20:57:22,529 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-15 20:57:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:22,529 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-15 20:57:22,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:57:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-15 20:57:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:57:22,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:22,531 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:22,531 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-11-15 20:57:22,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:22,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104676495] [2019-11-15 20:57:22,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:22,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:22,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:22,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104676495] [2019-11-15 20:57:22,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:22,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:22,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003569379] [2019-11-15 20:57:22,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:22,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:22,605 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-15 20:57:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:23,054 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-11-15 20:57:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:23,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:57:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:23,057 INFO L225 Difference]: With dead ends: 504 [2019-11-15 20:57:23,057 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 20:57:23,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 20:57:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-11-15 20:57:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-15 20:57:23,066 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-15 20:57:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:23,066 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-15 20:57:23,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-15 20:57:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:57:23,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:23,069 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:23,069 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:23,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:23,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-11-15 20:57:23,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:23,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963371938] [2019-11-15 20:57:23,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:23,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:23,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:23,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963371938] [2019-11-15 20:57:23,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:23,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:23,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655331838] [2019-11-15 20:57:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:23,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:23,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:23,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:23,142 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-15 20:57:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:23,474 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-11-15 20:57:23,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:23,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:57:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:23,476 INFO L225 Difference]: With dead ends: 503 [2019-11-15 20:57:23,476 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 20:57:23,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 20:57:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 20:57:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-15 20:57:23,485 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-15 20:57:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:23,485 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-15 20:57:23,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:23,486 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-15 20:57:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:57:23,487 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:23,487 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:23,487 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-11-15 20:57:23,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:23,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559068474] [2019-11-15 20:57:23,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:23,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:23,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:23,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559068474] [2019-11-15 20:57:23,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:23,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:23,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522321205] [2019-11-15 20:57:23,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:23,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:23,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:23,562 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-15 20:57:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:24,096 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-15 20:57:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:24,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:57:24,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:24,099 INFO L225 Difference]: With dead ends: 530 [2019-11-15 20:57:24,099 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 20:57:24,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 20:57:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 20:57:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-15 20:57:24,109 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-15 20:57:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:24,109 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-15 20:57:24,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-15 20:57:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:57:24,111 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:24,111 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:24,111 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-11-15 20:57:24,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:24,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844444938] [2019-11-15 20:57:24,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:24,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:24,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:24,195 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844444938] [2019-11-15 20:57:24,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:24,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:24,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169253044] [2019-11-15 20:57:24,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:24,198 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:24,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:24,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:24,198 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-15 20:57:24,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:24,582 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-11-15 20:57:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:24,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:57:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:24,584 INFO L225 Difference]: With dead ends: 503 [2019-11-15 20:57:24,584 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 20:57:24,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 20:57:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 20:57:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-15 20:57:24,593 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-15 20:57:24,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:24,593 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-15 20:57:24,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-15 20:57:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:57:24,594 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:24,594 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:24,595 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-11-15 20:57:24,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:24,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124259564] [2019-11-15 20:57:24,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:24,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:24,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:24,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124259564] [2019-11-15 20:57:24,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:24,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:24,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315028726] [2019-11-15 20:57:24,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:24,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:24,686 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-15 20:57:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:25,077 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-15 20:57:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:25,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 20:57:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:25,079 INFO L225 Difference]: With dead ends: 530 [2019-11-15 20:57:25,079 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 20:57:25,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 20:57:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 20:57:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-15 20:57:25,089 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-15 20:57:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:25,090 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-15 20:57:25,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-15 20:57:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:57:25,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:25,091 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:25,091 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-11-15 20:57:25,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:25,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497055] [2019-11-15 20:57:25,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:25,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:25,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:25,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497055] [2019-11-15 20:57:25,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:25,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:25,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828150802] [2019-11-15 20:57:25,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:25,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:25,174 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-15 20:57:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:25,480 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-11-15 20:57:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:25,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 20:57:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:25,482 INFO L225 Difference]: With dead ends: 503 [2019-11-15 20:57:25,482 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 20:57:25,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 20:57:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 20:57:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-15 20:57:25,490 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-15 20:57:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:25,491 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-15 20:57:25,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-15 20:57:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:57:25,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:25,492 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:25,492 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:25,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:25,492 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-11-15 20:57:25,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:25,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267996957] [2019-11-15 20:57:25,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:25,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:25,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:25,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267996957] [2019-11-15 20:57:25,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:25,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:25,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947073382] [2019-11-15 20:57:25,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:25,568 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:25,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:25,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:25,569 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-15 20:57:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:26,062 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-15 20:57:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:26,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:57:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:26,064 INFO L225 Difference]: With dead ends: 530 [2019-11-15 20:57:26,064 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 20:57:26,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 20:57:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 20:57:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-15 20:57:26,076 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-15 20:57:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:26,077 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-15 20:57:26,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-15 20:57:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:57:26,078 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:26,079 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:26,079 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-11-15 20:57:26,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:26,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204978572] [2019-11-15 20:57:26,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:26,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:26,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:26,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204978572] [2019-11-15 20:57:26,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:26,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:26,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120484530] [2019-11-15 20:57:26,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:26,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:26,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:26,204 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-15 20:57:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:26,611 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-11-15 20:57:26,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:26,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:57:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:26,614 INFO L225 Difference]: With dead ends: 503 [2019-11-15 20:57:26,614 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 20:57:26,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 20:57:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 20:57:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-15 20:57:26,623 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-15 20:57:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:26,624 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-15 20:57:26,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-15 20:57:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 20:57:26,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:26,626 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:26,626 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-11-15 20:57:26,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:26,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533177842] [2019-11-15 20:57:26,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:26,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:26,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:26,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533177842] [2019-11-15 20:57:26,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:26,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:26,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134287227] [2019-11-15 20:57:26,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:26,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:26,706 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-15 20:57:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:27,117 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-15 20:57:27,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:27,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 20:57:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:27,119 INFO L225 Difference]: With dead ends: 520 [2019-11-15 20:57:27,119 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 20:57:27,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 20:57:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-15 20:57:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-15 20:57:27,128 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-15 20:57:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:27,129 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-15 20:57:27,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-15 20:57:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 20:57:27,130 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:27,130 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:27,130 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-11-15 20:57:27,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:27,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517765345] [2019-11-15 20:57:27,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:27,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:27,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:27,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517765345] [2019-11-15 20:57:27,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:27,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:27,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141879866] [2019-11-15 20:57:27,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:27,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:27,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:27,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:27,215 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-15 20:57:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:27,513 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-11-15 20:57:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:27,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 20:57:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:27,515 INFO L225 Difference]: With dead ends: 493 [2019-11-15 20:57:27,515 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 20:57:27,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 20:57:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-11-15 20:57:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-15 20:57:27,526 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-15 20:57:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:27,527 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-15 20:57:27,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-15 20:57:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:57:27,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:27,529 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:27,529 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:27,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-11-15 20:57:27,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:27,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489222307] [2019-11-15 20:57:27,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:27,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:27,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:57:27,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489222307] [2019-11-15 20:57:27,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:27,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:57:27,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236442206] [2019-11-15 20:57:27,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:27,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:27,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:27,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:27,609 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-15 20:57:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:27,993 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-15 20:57:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:27,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 20:57:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:27,995 INFO L225 Difference]: With dead ends: 520 [2019-11-15 20:57:27,996 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 20:57:27,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:57:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 20:57:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-15 20:57:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:57:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-15 20:57:28,006 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-15 20:57:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:28,006 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-15 20:57:28,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-15 20:57:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:57:28,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:28,008 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:28,008 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-11-15 20:57:28,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:28,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162031878] [2019-11-15 20:57:28,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:28,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:28,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 20:57:28,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162031878] [2019-11-15 20:57:28,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:28,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:57:28,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785211596] [2019-11-15 20:57:28,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:57:28,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:57:28,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:57:28,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:57:28,084 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-15 20:57:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:28,127 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-15 20:57:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:57:28,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 20:57:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:28,131 INFO L225 Difference]: With dead ends: 710 [2019-11-15 20:57:28,131 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 20:57:28,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:57:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 20:57:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-15 20:57:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-15 20:57:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-15 20:57:28,147 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-15 20:57:28,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:28,147 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-15 20:57:28,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:57:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-15 20:57:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:57:28,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:28,150 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:28,150 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-15 20:57:28,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:57:28,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138472551] [2019-11-15 20:57:28,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:28,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:57:28,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:57:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:57:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:57:28,477 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:57:28,477 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:57:28,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:57:28 BoogieIcfgContainer [2019-11-15 20:57:28,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:57:28,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:57:28,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:57:28,662 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:57:28,663 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:57:07" (3/4) ... [2019-11-15 20:57:28,667 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:57:28,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:57:28,670 INFO L168 Benchmark]: Toolchain (without parser) took 23909.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 422.1 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -85.9 MB). Peak memory consumption was 336.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:28,670 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:57:28,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:28,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:28,672 INFO L168 Benchmark]: Boogie Preprocessor took 90.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:28,673 INFO L168 Benchmark]: RCFGBuilder took 1677.85 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: 91.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:28,673 INFO L168 Benchmark]: TraceAbstraction took 21168.87 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 249.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:28,674 INFO L168 Benchmark]: Witness Printer took 5.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:57:28,677 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 841.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.69 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 90.46 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 1677.85 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: 91.5 MB). Peak memory consumption was 91.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21168.87 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 249.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.80 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 21.0s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7109 SDtfs, 2139 SDslu, 10027 SDs, 0 SdLazy, 6809 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 84 SyntacticMatches, 33 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 38 MinimizatonAttempts, 941 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 741519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 20:57:31,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:57:31,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:57:31,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:57:31,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:57:31,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:57:31,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:57:31,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:57:31,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:57:31,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:57:31,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:57:31,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:57:31,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:57:31,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:57:31,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:57:31,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:57:31,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:57:31,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:57:31,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:57:31,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:57:31,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:57:31,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:57:31,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:57:31,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:57:31,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:57:31,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:57:31,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:57:31,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:57:31,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:57:31,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:57:31,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:57:31,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:57:31,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:57:31,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:57:31,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:57:31,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:57:31,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:57:31,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:57:31,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:57:31,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:57:31,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:57:31,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:57:31,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:57:31,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:57:31,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:57:31,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:57:31,474 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:57:31,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:57:31,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:57:31,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:57:31,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:57:31,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:57:31,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:57:31,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:57:31,476 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:57:31,477 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:57:31,477 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:57:31,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:57:31,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:57:31,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:57:31,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:57:31,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:57:31,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:57:31,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:57:31,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:57:31,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:57:31,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:57:31,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:57:31,481 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:57:31,481 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:57:31,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:57:31,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:57:31,482 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1952eae46575e60399f761afaedbe356b8f81a96 [2019-11-15 20:57:31,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:57:31,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:57:31,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:57:31,535 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:57:31,535 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:57:31,536 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-15 20:57:31,590 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/2c588b45e/1f83cad01d3e4365859c93f5c9f5a2e4/FLAG40b3fc11e [2019-11-15 20:57:32,209 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:57:32,209 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-11-15 20:57:32,238 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/2c588b45e/1f83cad01d3e4365859c93f5c9f5a2e4/FLAG40b3fc11e [2019-11-15 20:57:32,431 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/data/2c588b45e/1f83cad01d3e4365859c93f5c9f5a2e4 [2019-11-15 20:57:32,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:57:32,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:57:32,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:57:32,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:57:32,442 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:57:32,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:57:32" (1/1) ... [2019-11-15 20:57:32,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2f6680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:32, skipping insertion in model container [2019-11-15 20:57:32,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:57:32" (1/1) ... [2019-11-15 20:57:32,454 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:57:32,528 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:57:33,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:57:33,133 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:57:33,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:57:33,386 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:57:33,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33 WrapperNode [2019-11-15 20:57:33,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:57:33,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:57:33,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:57:33,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:57:33,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:57:33,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:57:33,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:57:33,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:57:33,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... [2019-11-15 20:57:33,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:57:33,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:57:33,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:57:33,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:57:33,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:57:33,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:57:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:57:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:57:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:57:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:57:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:57:33,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:57:33,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:57:34,123 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:57:37,116 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 20:57:37,116 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 20:57:37,117 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:57:37,117 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:57:37,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:57:37 BoogieIcfgContainer [2019-11-15 20:57:37,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:57:37,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:57:37,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:57:37,122 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:57:37,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:57:32" (1/3) ... [2019-11-15 20:57:37,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399eab6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:57:37, skipping insertion in model container [2019-11-15 20:57:37,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:57:33" (2/3) ... [2019-11-15 20:57:37,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399eab6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:57:37, skipping insertion in model container [2019-11-15 20:57:37,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:57:37" (3/3) ... [2019-11-15 20:57:37,126 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-11-15 20:57:37,133 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:57:37,139 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:57:37,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:57:37,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:57:37,170 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:57:37,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:57:37,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:57:37,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:57:37,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:57:37,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:57:37,170 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:57:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 20:57:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:57:37,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:37,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:37,199 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-11-15 20:57:37,214 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:57:37,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [424564146] [2019-11-15 20:57:37,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:57:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:37,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:57:37,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:57:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:37,508 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:57:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:37,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [424564146] [2019-11-15 20:57:37,553 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:37,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:57:37,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898585920] [2019-11-15 20:57:37,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:37,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:57:37,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:37,579 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 20:57:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:37,754 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-11-15 20:57:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:37,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:57:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:37,784 INFO L225 Difference]: With dead ends: 537 [2019-11-15 20:57:37,784 INFO L226 Difference]: Without dead ends: 363 [2019-11-15 20:57:37,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-15 20:57:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-11-15 20:57:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-15 20:57:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-11-15 20:57:37,893 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-11-15 20:57:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:37,894 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-11-15 20:57:37,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-11-15 20:57:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 20:57:37,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:37,909 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:38,110 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:57:38,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1786835122, now seen corresponding path program 1 times [2019-11-15 20:57:38,112 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:57:38,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1788198134] [2019-11-15 20:57:38,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:57:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:57:38,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:57:38,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:57:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:38,449 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:57:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:57:38,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1788198134] [2019-11-15 20:57:38,490 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:57:38,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:57:38,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049604239] [2019-11-15 20:57:38,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:57:38,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:57:38,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:57:38,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:38,495 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-11-15 20:57:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:57:38,739 INFO L93 Difference]: Finished difference Result 833 states and 1271 transitions. [2019-11-15 20:57:38,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:57:38,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 20:57:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:57:38,744 INFO L225 Difference]: With dead ends: 833 [2019-11-15 20:57:38,745 INFO L226 Difference]: Without dead ends: 597 [2019-11-15 20:57:38,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:57:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-15 20:57:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-11-15 20:57:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-15 20:57:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2019-11-15 20:57:38,812 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 103 [2019-11-15 20:57:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:57:38,814 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2019-11-15 20:57:38,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:57:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2019-11-15 20:57:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:57:38,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:57:38,824 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:57:39,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:57:39,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:57:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:57:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-11-15 20:57:39,030 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:57:39,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [734940933] [2019-11-15 20:57:39,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:57:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:57:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:57:41,974 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 20:57:41,974 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:57:42,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:57:42,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:57:42 BoogieIcfgContainer [2019-11-15 20:57:42,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:57:42,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:57:42,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:57:42,425 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:57:42,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:57:37" (3/4) ... [2019-11-15 20:57:42,429 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:57:42,596 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a48e2e1b-8ef3-43e4-b28c-d18495b73a5f/bin/uautomizer/witness.graphml [2019-11-15 20:57:42,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:57:42,598 INFO L168 Benchmark]: Toolchain (without parser) took 10160.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -202.5 MB). Peak memory consumption was 36.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:42,599 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:57:42,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 949.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:42,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:42,600 INFO L168 Benchmark]: Boogie Preprocessor took 161.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:42,601 INFO L168 Benchmark]: RCFGBuilder took 3444.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: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:42,601 INFO L168 Benchmark]: TraceAbstraction took 5304.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -132.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:57:42,602 INFO L168 Benchmark]: Witness Printer took 171.65 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:57:42,607 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.36 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 949.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.56 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 161.97 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 3444.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: 90.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5304.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -132.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 171.65 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.2s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 657 SDslu, 785 SDs, 0 SdLazy, 50 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...