./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.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/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/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 82fa14b1025c7a060910c8935831f1b9dbe49041 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:43,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:43,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:43,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:43,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:43,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:43,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:43,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:43,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:43,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:43,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:43,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:43,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:43,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:43,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:43,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:43,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:43,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:43,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:43,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:43,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:43,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:43,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:43,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:43,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:43,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:43,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:43,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:43,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:43,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:43,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:43,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:43,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:43,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:43,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:43,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:43,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:43,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:43,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:43,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:43,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:43,788 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:43,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:43,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:43,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:43,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:43,802 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:43,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:43,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:43,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:43,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:43,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:43,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:43,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:43,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:43,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:43,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:43,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:43,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:43,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:43,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:43,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:43,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:43,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:43,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:43,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:43,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:43,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:43,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:43,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:43,808 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/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/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 -> 82fa14b1025c7a060910c8935831f1b9dbe49041 [2019-10-22 09:02:43,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:43,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:43,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:43,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:43,855 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:43,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-22 09:02:43,926 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/data/6e808de84/ad5d09e1262a4e0680e9574d9e7ca62a/FLAGc0aed9058 [2019-10-22 09:02:44,339 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:44,340 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-22 09:02:44,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/data/6e808de84/ad5d09e1262a4e0680e9574d9e7ca62a/FLAGc0aed9058 [2019-10-22 09:02:44,361 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/data/6e808de84/ad5d09e1262a4e0680e9574d9e7ca62a [2019-10-22 09:02:44,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:44,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:44,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:44,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:44,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:44,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc86574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44, skipping insertion in model container [2019-10-22 09:02:44,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:44,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:44,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:44,675 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:44,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:44,745 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:44,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44 WrapperNode [2019-10-22 09:02:44,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:44,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:44,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:44,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:44,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:44,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:44,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:44,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:44,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... [2019-10-22 09:02:44,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:44,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:44,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:44,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:44,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/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-10-22 09:02:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:45,144 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:45,743 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 09:02:45,743 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 09:02:45,744 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:45,745 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:45,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:45 BoogieIcfgContainer [2019-10-22 09:02:45,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:45,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:45,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:45,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:45,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:44" (1/3) ... [2019-10-22 09:02:45,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaec7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:45, skipping insertion in model container [2019-10-22 09:02:45,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:44" (2/3) ... [2019-10-22 09:02:45,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaec7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:45, skipping insertion in model container [2019-10-22 09:02:45,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:45" (3/3) ... [2019-10-22 09:02:45,753 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-10-22 09:02:45,761 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:45,767 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:45,775 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:45,800 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:45,802 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:45,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:45,803 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:45,803 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:45,803 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:45,803 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:45,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-10-22 09:02:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 09:02:45,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:45,835 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] [2019-10-22 09:02:45,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-10-22 09:02:45,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903366364] [2019-10-22 09:02:45,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:46,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903366364] [2019-10-22 09:02:46,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:46,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564399173] [2019-10-22 09:02:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,032 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-10-22 09:02:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,199 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-10-22 09:02:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 09:02:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,221 INFO L225 Difference]: With dead ends: 249 [2019-10-22 09:02:46,223 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 09:02:46,227 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 09:02:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-22 09:02:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 09:02:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-10-22 09:02:46,271 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-10-22 09:02:46,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,273 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-10-22 09:02:46,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-10-22 09:02:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 09:02:46,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,274 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] [2019-10-22 09:02:46,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-10-22 09:02:46,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808783527] [2019-10-22 09:02:46,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:46,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808783527] [2019-10-22 09:02:46,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:46,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400221886] [2019-10-22 09:02:46,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,371 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-10-22 09:02:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,531 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-10-22 09:02:46,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 09:02:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,533 INFO L225 Difference]: With dead ends: 235 [2019-10-22 09:02:46,533 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 09:02:46,534 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 09:02:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-10-22 09:02:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 09:02:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-10-22 09:02:46,544 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-10-22 09:02:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,545 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-10-22 09:02:46,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-10-22 09:02:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 09:02:46,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,546 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 09:02:46,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-10-22 09:02:46,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168636687] [2019-10-22 09:02:46,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:02:46,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168636687] [2019-10-22 09:02:46,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:46,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861332571] [2019-10-22 09:02:46,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,606 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-10-22 09:02:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,726 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-10-22 09:02:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 09:02:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,728 INFO L225 Difference]: With dead ends: 268 [2019-10-22 09:02:46,728 INFO L226 Difference]: Without dead ends: 149 [2019-10-22 09:02:46,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-22 09:02:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-10-22 09:02:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-22 09:02:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-10-22 09:02:46,741 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-10-22 09:02:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,741 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-10-22 09:02:46,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-10-22 09:02:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:02:46,743 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,743 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,743 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-10-22 09:02:46,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949111388] [2019-10-22 09:02:46,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:02:46,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949111388] [2019-10-22 09:02:46,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:46,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500900150] [2019-10-22 09:02:46,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,876 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-10-22 09:02:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,072 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-10-22 09:02:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:02:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,074 INFO L225 Difference]: With dead ends: 332 [2019-10-22 09:02:47,075 INFO L226 Difference]: Without dead ends: 195 [2019-10-22 09:02:47,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-22 09:02:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-10-22 09:02:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 09:02:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-10-22 09:02:47,095 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-10-22 09:02:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,096 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-10-22 09:02:47,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-10-22 09:02:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:02:47,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,097 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,098 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-10-22 09:02:47,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551919547] [2019-10-22 09:02:47,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 09:02:47,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551919547] [2019-10-22 09:02:47,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:47,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452840547] [2019-10-22 09:02:47,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,187 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-10-22 09:02:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,331 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-10-22 09:02:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 09:02:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,333 INFO L225 Difference]: With dead ends: 386 [2019-10-22 09:02:47,333 INFO L226 Difference]: Without dead ends: 209 [2019-10-22 09:02:47,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-22 09:02:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-10-22 09:02:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 09:02:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-10-22 09:02:47,358 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-10-22 09:02:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,358 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-10-22 09:02:47,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-10-22 09:02:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 09:02:47,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,366 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,366 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-10-22 09:02:47,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141253777] [2019-10-22 09:02:47,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 09:02:47,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141253777] [2019-10-22 09:02:47,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:47,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608728753] [2019-10-22 09:02:47,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,447 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-10-22 09:02:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,576 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-10-22 09:02:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 09:02:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,577 INFO L225 Difference]: With dead ends: 425 [2019-10-22 09:02:47,577 INFO L226 Difference]: Without dead ends: 229 [2019-10-22 09:02:47,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-22 09:02:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-10-22 09:02:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-22 09:02:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-10-22 09:02:47,593 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-10-22 09:02:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,593 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-10-22 09:02:47,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-10-22 09:02:47,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 09:02:47,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,599 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,599 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:47,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,600 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-10-22 09:02:47,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865601428] [2019-10-22 09:02:47,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:02:47,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865601428] [2019-10-22 09:02:47,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:47,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888679940] [2019-10-22 09:02:47,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,676 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-10-22 09:02:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,719 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-10-22 09:02:47,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-22 09:02:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,721 INFO L225 Difference]: With dead ends: 658 [2019-10-22 09:02:47,722 INFO L226 Difference]: Without dead ends: 441 [2019-10-22 09:02:47,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-22 09:02:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-10-22 09:02:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-22 09:02:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-10-22 09:02:47,737 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-10-22 09:02:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,737 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-10-22 09:02:47,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-10-22 09:02:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 09:02:47,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,739 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,739 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-10-22 09:02:47,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902729490] [2019-10-22 09:02:47,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 09:02:47,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902729490] [2019-10-22 09:02:47,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:47,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454295230] [2019-10-22 09:02:47,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,821 INFO L87 Difference]: Start difference. First operand 441 states and 607 transitions. Second operand 3 states. [2019-10-22 09:02:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:47,863 INFO L93 Difference]: Finished difference Result 658 states and 906 transitions. [2019-10-22 09:02:47,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:47,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 09:02:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:47,866 INFO L225 Difference]: With dead ends: 658 [2019-10-22 09:02:47,866 INFO L226 Difference]: Without dead ends: 656 [2019-10-22 09:02:47,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-10-22 09:02:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-10-22 09:02:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-10-22 09:02:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-10-22 09:02:47,883 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 105 [2019-10-22 09:02:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:47,883 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-10-22 09:02:47,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-10-22 09:02:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-22 09:02:47,885 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:47,886 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:47,886 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1076298523, now seen corresponding path program 1 times [2019-10-22 09:02:47,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:47,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369240567] [2019-10-22 09:02:47,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:47,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 09:02:47,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369240567] [2019-10-22 09:02:47,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:47,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:47,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676883827] [2019-10-22 09:02:47,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:47,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:47,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:47,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:47,932 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-10-22 09:02:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,064 INFO L93 Difference]: Finished difference Result 1383 states and 1932 transitions. [2019-10-22 09:02:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-22 09:02:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,067 INFO L225 Difference]: With dead ends: 1383 [2019-10-22 09:02:48,067 INFO L226 Difference]: Without dead ends: 736 [2019-10-22 09:02:48,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-10-22 09:02:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 725. [2019-10-22 09:02:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-22 09:02:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 988 transitions. [2019-10-22 09:02:48,086 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 988 transitions. Word has length 130 [2019-10-22 09:02:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,086 INFO L462 AbstractCegarLoop]: Abstraction has 725 states and 988 transitions. [2019-10-22 09:02:48,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 988 transitions. [2019-10-22 09:02:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-22 09:02:48,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,089 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,089 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1485143904, now seen corresponding path program 1 times [2019-10-22 09:02:48,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571483465] [2019-10-22 09:02:48,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-22 09:02:48,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571483465] [2019-10-22 09:02:48,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:48,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121727477] [2019-10-22 09:02:48,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,154 INFO L87 Difference]: Start difference. First operand 725 states and 988 transitions. Second operand 3 states. [2019-10-22 09:02:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,327 INFO L93 Difference]: Finished difference Result 1594 states and 2230 transitions. [2019-10-22 09:02:48,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-22 09:02:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,331 INFO L225 Difference]: With dead ends: 1594 [2019-10-22 09:02:48,332 INFO L226 Difference]: Without dead ends: 875 [2019-10-22 09:02:48,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-10-22 09:02:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 842. [2019-10-22 09:02:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-10-22 09:02:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1165 transitions. [2019-10-22 09:02:48,357 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1165 transitions. Word has length 151 [2019-10-22 09:02:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,357 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1165 transitions. [2019-10-22 09:02:48,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1165 transitions. [2019-10-22 09:02:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-22 09:02:48,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,361 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1560654223, now seen corresponding path program 1 times [2019-10-22 09:02:48,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059954447] [2019-10-22 09:02:48,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-22 09:02:48,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059954447] [2019-10-22 09:02:48,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:48,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12941759] [2019-10-22 09:02:48,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,434 INFO L87 Difference]: Start difference. First operand 842 states and 1165 transitions. Second operand 3 states. [2019-10-22 09:02:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,549 INFO L93 Difference]: Finished difference Result 1765 states and 2434 transitions. [2019-10-22 09:02:48,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-22 09:02:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,553 INFO L225 Difference]: With dead ends: 1765 [2019-10-22 09:02:48,553 INFO L226 Difference]: Without dead ends: 932 [2019-10-22 09:02:48,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2019-10-22 09:02:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 926. [2019-10-22 09:02:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-10-22 09:02:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1264 transitions. [2019-10-22 09:02:48,575 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1264 transitions. Word has length 187 [2019-10-22 09:02:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,576 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1264 transitions. [2019-10-22 09:02:48,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1264 transitions. [2019-10-22 09:02:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-22 09:02:48,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,579 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,579 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,580 INFO L82 PathProgramCache]: Analyzing trace with hash -999954445, now seen corresponding path program 1 times [2019-10-22 09:02:48,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142612390] [2019-10-22 09:02:48,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-22 09:02:48,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142612390] [2019-10-22 09:02:48,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:48,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073677027] [2019-10-22 09:02:48,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,639 INFO L87 Difference]: Start difference. First operand 926 states and 1264 transitions. Second operand 3 states. [2019-10-22 09:02:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,762 INFO L93 Difference]: Finished difference Result 1945 states and 2659 transitions. [2019-10-22 09:02:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-22 09:02:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,766 INFO L225 Difference]: With dead ends: 1945 [2019-10-22 09:02:48,766 INFO L226 Difference]: Without dead ends: 1028 [2019-10-22 09:02:48,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-10-22 09:02:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2019-10-22 09:02:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-22 09:02:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1372 transitions. [2019-10-22 09:02:48,789 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1372 transitions. Word has length 187 [2019-10-22 09:02:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,789 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1372 transitions. [2019-10-22 09:02:48,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1372 transitions. [2019-10-22 09:02:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-22 09:02:48,792 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,792 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,793 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1300602353, now seen corresponding path program 1 times [2019-10-22 09:02:48,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097088476] [2019-10-22 09:02:48,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-22 09:02:48,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097088476] [2019-10-22 09:02:48,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:48,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:48,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771567782] [2019-10-22 09:02:48,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:48,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,883 INFO L87 Difference]: Start difference. First operand 1019 states and 1372 transitions. Second operand 3 states. [2019-10-22 09:02:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:48,917 INFO L93 Difference]: Finished difference Result 3036 states and 4087 transitions. [2019-10-22 09:02:48,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:48,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-22 09:02:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:48,927 INFO L225 Difference]: With dead ends: 3036 [2019-10-22 09:02:48,928 INFO L226 Difference]: Without dead ends: 2026 [2019-10-22 09:02:48,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-10-22 09:02:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2019-10-22 09:02:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-10-22 09:02:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2724 transitions. [2019-10-22 09:02:48,983 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2724 transitions. Word has length 217 [2019-10-22 09:02:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:48,984 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 2724 transitions. [2019-10-22 09:02:48,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2724 transitions. [2019-10-22 09:02:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-22 09:02:48,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:48,989 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:48,990 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1861302131, now seen corresponding path program 1 times [2019-10-22 09:02:48,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:48,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146227641] [2019-10-22 09:02:48,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,991 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:48,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-10-22 09:02:49,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146227641] [2019-10-22 09:02:49,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:49,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101189177] [2019-10-22 09:02:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,096 INFO L87 Difference]: Start difference. First operand 2024 states and 2724 transitions. Second operand 3 states. [2019-10-22 09:02:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,262 INFO L93 Difference]: Finished difference Result 4264 states and 5762 transitions. [2019-10-22 09:02:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-22 09:02:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,272 INFO L225 Difference]: With dead ends: 4264 [2019-10-22 09:02:49,272 INFO L226 Difference]: Without dead ends: 2249 [2019-10-22 09:02:49,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-10-22 09:02:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2237. [2019-10-22 09:02:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2237 states. [2019-10-22 09:02:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 2967 transitions. [2019-10-22 09:02:49,327 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 2967 transitions. Word has length 217 [2019-10-22 09:02:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:49,327 INFO L462 AbstractCegarLoop]: Abstraction has 2237 states and 2967 transitions. [2019-10-22 09:02:49,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2967 transitions. [2019-10-22 09:02:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-22 09:02:49,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:49,334 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:49,334 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1392663397, now seen corresponding path program 1 times [2019-10-22 09:02:49,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:49,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637165640] [2019-10-22 09:02:49,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-10-22 09:02:49,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637165640] [2019-10-22 09:02:49,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:49,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273090296] [2019-10-22 09:02:49,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,434 INFO L87 Difference]: Start difference. First operand 2237 states and 2967 transitions. Second operand 3 states. [2019-10-22 09:02:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,598 INFO L93 Difference]: Finished difference Result 4576 states and 6077 transitions. [2019-10-22 09:02:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-22 09:02:49,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,606 INFO L225 Difference]: With dead ends: 4576 [2019-10-22 09:02:49,606 INFO L226 Difference]: Without dead ends: 2348 [2019-10-22 09:02:49,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2019-10-22 09:02:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2336. [2019-10-22 09:02:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2019-10-22 09:02:49,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 3081 transitions. [2019-10-22 09:02:49,669 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 3081 transitions. Word has length 241 [2019-10-22 09:02:49,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:49,669 INFO L462 AbstractCegarLoop]: Abstraction has 2336 states and 3081 transitions. [2019-10-22 09:02:49,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 3081 transitions. [2019-10-22 09:02:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-22 09:02:49,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:49,674 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:49,675 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:49,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:49,675 INFO L82 PathProgramCache]: Analyzing trace with hash 844629829, now seen corresponding path program 1 times [2019-10-22 09:02:49,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:49,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821501503] [2019-10-22 09:02:49,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-22 09:02:49,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821501503] [2019-10-22 09:02:49,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:49,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:49,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010472568] [2019-10-22 09:02:49,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:49,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:49,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,761 INFO L87 Difference]: Start difference. First operand 2336 states and 3081 transitions. Second operand 3 states. [2019-10-22 09:02:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:49,953 INFO L93 Difference]: Finished difference Result 4963 states and 6677 transitions. [2019-10-22 09:02:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:49,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-10-22 09:02:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:49,963 INFO L225 Difference]: With dead ends: 4963 [2019-10-22 09:02:49,963 INFO L226 Difference]: Without dead ends: 2636 [2019-10-22 09:02:49,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2019-10-22 09:02:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2576. [2019-10-22 09:02:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-10-22 09:02:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3363 transitions. [2019-10-22 09:02:50,030 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3363 transitions. Word has length 252 [2019-10-22 09:02:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,030 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 3363 transitions. [2019-10-22 09:02:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3363 transitions. [2019-10-22 09:02:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-22 09:02:50,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,038 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:50,038 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1701177459, now seen corresponding path program 1 times [2019-10-22 09:02:50,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:50,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117857570] [2019-10-22 09:02:50,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:50,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-22 09:02:50,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117857570] [2019-10-22 09:02:50,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902222097] [2019-10-22 09:02:50,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:50,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:50,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-22 09:02:50,410 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:50,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:50,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70468371] [2019-10-22 09:02:50,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:50,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:50,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:50,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:50,412 INFO L87 Difference]: Start difference. First operand 2576 states and 3363 transitions. Second operand 4 states. [2019-10-22 09:02:50,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:50,797 INFO L93 Difference]: Finished difference Result 8082 states and 10681 transitions. [2019-10-22 09:02:50,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:50,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-10-22 09:02:50,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:50,814 INFO L225 Difference]: With dead ends: 8082 [2019-10-22 09:02:50,814 INFO L226 Difference]: Without dead ends: 5509 [2019-10-22 09:02:50,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2019-10-22 09:02:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5117. [2019-10-22 09:02:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5117 states. [2019-10-22 09:02:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 6676 transitions. [2019-10-22 09:02:50,933 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 6676 transitions. Word has length 291 [2019-10-22 09:02:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:50,934 INFO L462 AbstractCegarLoop]: Abstraction has 5117 states and 6676 transitions. [2019-10-22 09:02:50,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 6676 transitions. [2019-10-22 09:02:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-22 09:02:50,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:50,944 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:51,144 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:51,145 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1916566562, now seen corresponding path program 1 times [2019-10-22 09:02:51,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544848887] [2019-10-22 09:02:51,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-10-22 09:02:51,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544848887] [2019-10-22 09:02:51,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:51,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992215143] [2019-10-22 09:02:51,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:51,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,285 INFO L87 Difference]: Start difference. First operand 5117 states and 6676 transitions. Second operand 3 states. [2019-10-22 09:02:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:51,397 INFO L93 Difference]: Finished difference Result 12402 states and 16215 transitions. [2019-10-22 09:02:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:51,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-22 09:02:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:51,425 INFO L225 Difference]: With dead ends: 12402 [2019-10-22 09:02:51,429 INFO L226 Difference]: Without dead ends: 7294 [2019-10-22 09:02:51,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2019-10-22 09:02:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 7292. [2019-10-22 09:02:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7292 states. [2019-10-22 09:02:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7292 states to 7292 states and 9521 transitions. [2019-10-22 09:02:51,645 INFO L78 Accepts]: Start accepts. Automaton has 7292 states and 9521 transitions. Word has length 292 [2019-10-22 09:02:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:51,646 INFO L462 AbstractCegarLoop]: Abstraction has 7292 states and 9521 transitions. [2019-10-22 09:02:51,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 7292 states and 9521 transitions. [2019-10-22 09:02:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-22 09:02:51,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:51,655 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:51,656 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:51,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:51,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777966, now seen corresponding path program 1 times [2019-10-22 09:02:51,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:51,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832730042] [2019-10-22 09:02:51,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:51,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-22 09:02:51,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832730042] [2019-10-22 09:02:51,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:51,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:51,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105662570] [2019-10-22 09:02:51,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:51,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,756 INFO L87 Difference]: Start difference. First operand 7292 states and 9521 transitions. Second operand 3 states. [2019-10-22 09:02:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:51,955 INFO L93 Difference]: Finished difference Result 14569 states and 18999 transitions. [2019-10-22 09:02:51,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:51,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-10-22 09:02:51,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:51,983 INFO L225 Difference]: With dead ends: 14569 [2019-10-22 09:02:51,984 INFO L226 Difference]: Without dead ends: 7286 [2019-10-22 09:02:51,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2019-10-22 09:02:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 6269. [2019-10-22 09:02:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6269 states. [2019-10-22 09:02:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6269 states to 6269 states and 8068 transitions. [2019-10-22 09:02:52,123 INFO L78 Accepts]: Start accepts. Automaton has 6269 states and 8068 transitions. Word has length 293 [2019-10-22 09:02:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:52,123 INFO L462 AbstractCegarLoop]: Abstraction has 6269 states and 8068 transitions. [2019-10-22 09:02:52,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6269 states and 8068 transitions. [2019-10-22 09:02:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-22 09:02:52,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:52,133 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 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, 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] [2019-10-22 09:02:52,133 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2024435260, now seen corresponding path program 1 times [2019-10-22 09:02:52,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887978159] [2019-10-22 09:02:52,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1419 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:02:52,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887978159] [2019-10-22 09:02:52,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:52,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:52,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538914536] [2019-10-22 09:02:52,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:52,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,235 INFO L87 Difference]: Start difference. First operand 6269 states and 8068 transitions. Second operand 3 states. [2019-10-22 09:02:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:52,449 INFO L93 Difference]: Finished difference Result 13675 states and 17821 transitions. [2019-10-22 09:02:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:52,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-10-22 09:02:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:52,464 INFO L225 Difference]: With dead ends: 13675 [2019-10-22 09:02:52,464 INFO L226 Difference]: Without dead ends: 7415 [2019-10-22 09:02:52,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-10-22 09:02:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 6611. [2019-10-22 09:02:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6611 states. [2019-10-22 09:02:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 8554 transitions. [2019-10-22 09:02:52,671 INFO L78 Accepts]: Start accepts. Automaton has 6611 states and 8554 transitions. Word has length 333 [2019-10-22 09:02:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:52,672 INFO L462 AbstractCegarLoop]: Abstraction has 6611 states and 8554 transitions. [2019-10-22 09:02:52,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6611 states and 8554 transitions. [2019-10-22 09:02:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-22 09:02:52,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:52,686 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:52,686 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:52,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2018141812, now seen corresponding path program 1 times [2019-10-22 09:02:52,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:52,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698976449] [2019-10-22 09:02:52,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:52,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:02:52,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698976449] [2019-10-22 09:02:52,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310830113] [2019-10-22 09:02:52,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:53,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-10-22 09:02:53,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:02:53,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:02:53,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961337617] [2019-10-22 09:02:53,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:53,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:53,183 INFO L87 Difference]: Start difference. First operand 6611 states and 8554 transitions. Second operand 3 states. [2019-10-22 09:02:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:53,283 INFO L93 Difference]: Finished difference Result 15401 states and 19915 transitions. [2019-10-22 09:02:53,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:53,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-10-22 09:02:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:53,298 INFO L225 Difference]: With dead ends: 15401 [2019-10-22 09:02:53,298 INFO L226 Difference]: Without dead ends: 8799 [2019-10-22 09:02:53,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8799 states. [2019-10-22 09:02:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8799 to 8799. [2019-10-22 09:02:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8799 states. [2019-10-22 09:02:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8799 states to 8799 states and 11356 transitions. [2019-10-22 09:02:53,477 INFO L78 Accepts]: Start accepts. Automaton has 8799 states and 11356 transitions. Word has length 371 [2019-10-22 09:02:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:53,478 INFO L462 AbstractCegarLoop]: Abstraction has 8799 states and 11356 transitions. [2019-10-22 09:02:53,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8799 states and 11356 transitions. [2019-10-22 09:02:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-22 09:02:53,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:53,492 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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] [2019-10-22 09:02:53,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:53,693 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -106230564, now seen corresponding path program 1 times [2019-10-22 09:02:53,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:53,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528631149] [2019-10-22 09:02:53,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:02:53,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528631149] [2019-10-22 09:02:53,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115172258] [2019-10-22 09:02:53,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:53,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-22 09:02:54,066 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:54,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:54,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783728703] [2019-10-22 09:02:54,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:54,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:54,067 INFO L87 Difference]: Start difference. First operand 8799 states and 11356 transitions. Second operand 4 states. [2019-10-22 09:02:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:54,444 INFO L93 Difference]: Finished difference Result 19741 states and 25400 transitions. [2019-10-22 09:02:54,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:54,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-10-22 09:02:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:54,467 INFO L225 Difference]: With dead ends: 19741 [2019-10-22 09:02:54,467 INFO L226 Difference]: Without dead ends: 10934 [2019-10-22 09:02:54,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-10-22 09:02:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 9585. [2019-10-22 09:02:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9585 states. [2019-10-22 09:02:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9585 states to 9585 states and 12272 transitions. [2019-10-22 09:02:54,697 INFO L78 Accepts]: Start accepts. Automaton has 9585 states and 12272 transitions. Word has length 373 [2019-10-22 09:02:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:54,698 INFO L462 AbstractCegarLoop]: Abstraction has 9585 states and 12272 transitions. [2019-10-22 09:02:54,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9585 states and 12272 transitions. [2019-10-22 09:02:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-22 09:02:54,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:54,715 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:54,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:54,916 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash -77148624, now seen corresponding path program 1 times [2019-10-22 09:02:54,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:54,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644930605] [2019-10-22 09:02:54,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:54,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:54,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-22 09:02:55,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644930605] [2019-10-22 09:02:55,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:55,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:55,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856633682] [2019-10-22 09:02:55,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:55,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:55,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:55,094 INFO L87 Difference]: Start difference. First operand 9585 states and 12272 transitions. Second operand 3 states. [2019-10-22 09:02:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:55,358 INFO L93 Difference]: Finished difference Result 18222 states and 23076 transitions. [2019-10-22 09:02:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:55,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-10-22 09:02:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:55,366 INFO L225 Difference]: With dead ends: 18222 [2019-10-22 09:02:55,367 INFO L226 Difference]: Without dead ends: 3798 [2019-10-22 09:02:55,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2019-10-22 09:02:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3523. [2019-10-22 09:02:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-10-22 09:02:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 4382 transitions. [2019-10-22 09:02:55,477 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 4382 transitions. Word has length 412 [2019-10-22 09:02:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:55,477 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 4382 transitions. [2019-10-22 09:02:55,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 4382 transitions. [2019-10-22 09:02:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-22 09:02:55,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:55,491 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:55,492 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash -896719054, now seen corresponding path program 1 times [2019-10-22 09:02:55,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:55,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355947538] [2019-10-22 09:02:55,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-22 09:02:55,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355947538] [2019-10-22 09:02:55,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508377769] [2019-10-22 09:02:55,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:02:55,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-22 09:02:55,974 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:55,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 09:02:55,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648325001] [2019-10-22 09:02:55,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:55,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:55,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:55,978 INFO L87 Difference]: Start difference. First operand 3523 states and 4382 transitions. Second operand 4 states. [2019-10-22 09:02:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:56,163 INFO L93 Difference]: Finished difference Result 3784 states and 4712 transitions. [2019-10-22 09:02:56,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:56,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-10-22 09:02:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:56,164 INFO L225 Difference]: With dead ends: 3784 [2019-10-22 09:02:56,164 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:02:56,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:02:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:02:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:02:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:02:56,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 441 [2019-10-22 09:02:56,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:56,170 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:56,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:56,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:02:56,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:56,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:02:56,801 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 96 [2019-10-22 09:02:57,556 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-10-22 09:02:58,175 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2019-10-22 09:02:58,332 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-22 09:02:58,332 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-10-22 09:02:58,332 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-10-22 09:02:58,332 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-10-22 09:02:58,332 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-10-22 09:02:58,333 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-22 09:02:58,333 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-22 09:02:58,333 INFO L439 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-10-22 09:02:58,333 INFO L446 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-10-22 09:02:58,333 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-22 09:02:58,333 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-10-22 09:02:58,333 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L439 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse1) (and .cse0 .cse1))) [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L439 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-10-22 09:02:58,334 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L439 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-10-22 09:02:58,335 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-10-22 09:02:58,336 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-10-22 09:02:58,336 INFO L443 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-10-22 09:02:58,338 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-10-22 09:02:58,338 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-10-22 09:02:58,338 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-10-22 09:02:58,338 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-10-22 09:02:58,338 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-10-22 09:02:58,338 INFO L439 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-10-22 09:02:58,339 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-22 09:02:58,339 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-10-22 09:02:58,339 INFO L443 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-10-22 09:02:58,340 INFO L446 ceAbstractionStarter]: At program point L544(lines 11 546) the Hoare annotation is: true [2019-10-22 09:02:58,340 INFO L439 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: false [2019-10-22 09:02:58,340 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-10-22 09:02:58,340 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-10-22 09:02:58,340 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-10-22 09:02:58,340 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-10-22 09:02:58,340 INFO L439 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse3 .cse2))) [2019-10-22 09:02:58,340 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L439 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse9 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse8 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse5 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse7 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse1 .cse4) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse8) (and .cse10 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse7) (and .cse9 .cse5 .cse8) (and .cse0 .cse5 .cse7) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse5 .cse7) (and .cse1 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4384) .cse1) (and .cse5 .cse4 .cse7) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4496) .cse5 .cse7) (and .cse5 .cse7 (= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (= ULTIMATE.start_ssl3_connect_~s__state~0 4480) .cse5 .cse7))) [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-10-22 09:02:58,341 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L439 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-10-22 09:02:58,342 INFO L439 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-10-22 09:02:58,342 INFO L443 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-10-22 09:02:58,343 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-10-22 09:02:58,344 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-10-22 09:02:58,344 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-10-22 09:02:58,346 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-10-22 09:02:58,346 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-10-22 09:02:58,346 INFO L439 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (and .cse0 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2019-10-22 09:02:58,346 INFO L439 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1))) [2019-10-22 09:02:58,347 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L446 ceAbstractionStarter]: At program point L555(lines 547 557) the Hoare annotation is: true [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-10-22 09:02:58,348 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L439 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 .cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse4 .cse1 .cse3))) [2019-10-22 09:02:58,349 INFO L439 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-10-22 09:02:58,349 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-10-22 09:02:58,350 INFO L439 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2))) [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-10-22 09:02:58,350 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-10-22 09:02:58,351 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-10-22 09:02:58,351 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-10-22 09:02:58,351 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-10-22 09:02:58,351 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-10-22 09:02:58,351 INFO L439 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (<= 4464 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2))) [2019-10-22 09:02:58,351 INFO L439 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) .cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)))) [2019-10-22 09:02:58,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:58 BoogieIcfgContainer [2019-10-22 09:02:58,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:58,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:58,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:58,394 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:58,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:45" (3/4) ... [2019-10-22 09:02:58,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:02:58,416 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:02:58,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:02:58,531 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_33ea8f78-81d6-4987-b244-a21ccde1d5c6/bin/uautomizer/witness.graphml [2019-10-22 09:02:58,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:58,533 INFO L168 Benchmark]: Toolchain (without parser) took 14168.54 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 861.9 MB). Free memory was 947.1 MB in the beginning and 1.8 GB in the end (delta: -835.5 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,533 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:58,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,534 INFO L168 Benchmark]: Boogie Preprocessor took 55.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,534 INFO L168 Benchmark]: RCFGBuilder took 893.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,534 INFO L168 Benchmark]: TraceAbstraction took 12646.64 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 752.4 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -752.5 MB). Peak memory consumption was 829.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,535 INFO L168 Benchmark]: Witness Printer took 138.11 ms. Allocated memory is still 1.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:58,539 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 947.1 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 893.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12646.64 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 752.4 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -752.5 MB). Peak memory consumption was 829.6 MB. Max. memory is 11.5 GB. * Witness Printer took 138.11 ms. Allocated memory is still 1.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 12292 == s__state) || (((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 12292 == s__state) && 0 == s__hit) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((((((((4512 == s__state && blastFlag <= 2) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2)) || (blastFlag <= 2 && s__state == 4528)) || (((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 0 == s__hit)) || ((s__state <= 3 && s__s3__tmp__new_cipher__algorithms == 256) && s__s3__tmp__next_state___0 <= 4560)) || ((4512 == s__state && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (blastFlag <= 2 && 4368 == s__state)) || (s__state == 4384 && blastFlag <= 2)) || ((s__s3__tmp__new_cipher__algorithms == 256 && s__state == 4528) && 0 == s__hit)) || ((s__state == 4496 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((s__s3__tmp__new_cipher__algorithms == 256 && 0 == s__hit) && 4464 == s__state)) || ((s__state == 4480 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((4560 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((4560 <= s__state && blastFlag <= 4) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || ((4560 <= s__state && blastFlag <= 2) && 0 == s__hit)) || ((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || ((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((s__state <= 4352 && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((s__state <= 4352 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (((s__state <= 4352 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((s__state <= 4560 && blastFlag <= 2) || ((blastFlag <= 4 && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit)) || (blastFlag <= 2 && 0 == s__hit) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) || (((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) && 0 == s__hit) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((s__state <= 4560 && blastFlag <= 2) && 4352 <= s__state) && 0 == s__hit) || ((((s__state <= 4560 && blastFlag <= 4) && 4352 <= s__state) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((4464 <= s__state && s__state <= 4560) && blastFlag <= 2) || (((4464 <= s__state && s__state <= 4560) && s__s3__tmp__new_cipher__algorithms == 256) && 0 == s__hit) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: SAFE, OverallTime: 12.5s, OverallIterations: 24, TraceHistogramMax: 18, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 4616 SDtfs, 1482 SDslu, 2556 SDs, 0 SdLazy, 2390 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9585occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 4007 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 325 NumberOfFragments, 660 HoareAnnotationTreeSize, 22 FomulaSimplifications, 12234 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1989 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 6398 NumberOfCodeBlocks, 6398 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6370 ConstructedInterpolants, 0 QuantifiedInterpolants, 2622380 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2587 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 21955/22034 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 correct! Received shutdown request...