./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/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 9c69768cb083538b139479bdbb35676eb3378c1b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/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 9c69768cb083538b139479bdbb35676eb3378c1b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:56,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:56,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:56,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:56,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:56,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:56,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:56,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:56,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:56,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:56,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:56,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:56,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:56,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:56,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:56,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:56,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:56,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:56,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:56,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:56,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:56,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:56,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:56,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:56,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:56,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:56,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:56,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:56,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:56,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:56,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:56,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:56,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:56,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:56,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:56,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:56,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:56,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:56,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:56,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:56,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:56,640 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:56,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:56,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:56,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:56,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:56,653 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:56,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:56,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:56,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:56,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:56,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:56,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:56,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:56,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:56,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:56,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:56,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:56,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:56,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:56,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:56,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:56,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:56,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:56,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:56,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:56,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:56,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:56,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:56,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:56,656 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_b857a69a-ac05-4c26-bd5d-1dce21494180/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 -> 9c69768cb083538b139479bdbb35676eb3378c1b [2019-10-22 09:02:56,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:56,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:56,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:56,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:56,699 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:56,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 09:02:56,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/ad38fc1cb/bbdab630d2a44d2dbb5e188fee9425d0/FLAGf370c06a7 [2019-10-22 09:02:57,217 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:57,218 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 09:02:57,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/ad38fc1cb/bbdab630d2a44d2dbb5e188fee9425d0/FLAGf370c06a7 [2019-10-22 09:02:57,719 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/ad38fc1cb/bbdab630d2a44d2dbb5e188fee9425d0 [2019-10-22 09:02:57,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:57,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:57,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:57,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:57,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:57,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e95cc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57, skipping insertion in model container [2019-10-22 09:02:57,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,745 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:57,813 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:58,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:58,353 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:58,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:58,502 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:58,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:58 WrapperNode [2019-10-22 09:02:58,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:58,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:58,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:58,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:58,512 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:58" (1/1) ... [2019-10-22 09:02:58,542 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:58" (1/1) ... [2019-10-22 09:02:58,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:58,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:58,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:58,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:58,608 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:58" (1/1) ... [2019-10-22 09:02:58,609 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:58" (1/1) ... [2019-10-22 09:02:58,618 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:58" (1/1) ... [2019-10-22 09:02:58,623 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:58" (1/1) ... [2019-10-22 09:02:58,660 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:58" (1/1) ... [2019-10-22 09:02:58,682 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:58" (1/1) ... [2019-10-22 09:02:58,684 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:58" (1/1) ... [2019-10-22 09:02:58,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:58,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:58,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:58,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:58,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/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:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:02:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:58,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:02:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:02:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:58,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:59,024 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:59,866 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 09:02:59,866 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 09:02:59,867 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:59,867 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:59,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:59 BoogieIcfgContainer [2019-10-22 09:02:59,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:59,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:59,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:59,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:59,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:57" (1/3) ... [2019-10-22 09:02:59,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3464b54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:59, skipping insertion in model container [2019-10-22 09:02:59,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:58" (2/3) ... [2019-10-22 09:02:59,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3464b54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:59, skipping insertion in model container [2019-10-22 09:02:59,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:59" (3/3) ... [2019-10-22 09:02:59,876 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-10-22 09:02:59,886 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:59,899 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:59,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:59,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:59,934 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:59,934 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:59,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:59,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:59,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:59,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:59,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-10-22 09:02:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:02:59,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:59,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,963 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,970 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-10-22 09:02:59,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843827398] [2019-10-22 09:02:59,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,303 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:03:00,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843827398] [2019-10-22 09:03:00,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:00,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:00,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325190011] [2019-10-22 09:03:00,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:00,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:00,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:00,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:00,324 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-10-22 09:03:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:00,916 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-10-22 09:03:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:00,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 09:03:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:00,930 INFO L225 Difference]: With dead ends: 317 [2019-10-22 09:03:00,930 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 09:03:00,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 09:03:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-10-22 09:03:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-10-22 09:03:00,979 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-10-22 09:03:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:00,979 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-10-22 09:03:00,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-10-22 09:03:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 09:03:00,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:00,982 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:00,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:00,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-10-22 09:03:00,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021831698] [2019-10-22 09:03:00,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021831698] [2019-10-22 09:03:01,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:01,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:01,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716996539] [2019-10-22 09:03:01,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:01,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:01,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:01,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:01,138 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-10-22 09:03:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:01,485 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-10-22 09:03:01,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:01,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-22 09:03:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:01,487 INFO L225 Difference]: With dead ends: 284 [2019-10-22 09:03:01,488 INFO L226 Difference]: Without dead ends: 160 [2019-10-22 09:03:01,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-22 09:03:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-10-22 09:03:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-10-22 09:03:01,500 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-10-22 09:03:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:01,501 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-10-22 09:03:01,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-10-22 09:03:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:03:01,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:01,507 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,508 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:01,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-10-22 09:03:01,508 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902041299] [2019-10-22 09:03:01,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902041299] [2019-10-22 09:03:01,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:01,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:01,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197259911] [2019-10-22 09:03:01,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:01,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:01,648 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-10-22 09:03:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:01,960 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-10-22 09:03:01,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:01,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:03:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:01,962 INFO L225 Difference]: With dead ends: 282 [2019-10-22 09:03:01,963 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 09:03:01,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 09:03:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-10-22 09:03:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-10-22 09:03:01,972 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-10-22 09:03:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:01,973 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-10-22 09:03:01,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-10-22 09:03:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:03:01,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:01,975 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:01,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-10-22 09:03:01,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096293356] [2019-10-22 09:03:01,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096293356] [2019-10-22 09:03:02,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:02,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:02,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529990860] [2019-10-22 09:03:02,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:02,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:02,042 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-10-22 09:03:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:02,341 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-10-22 09:03:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:02,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:03:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:02,343 INFO L225 Difference]: With dead ends: 281 [2019-10-22 09:03:02,344 INFO L226 Difference]: Without dead ends: 157 [2019-10-22 09:03:02,344 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-22 09:03:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-10-22 09:03:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-10-22 09:03:02,358 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-10-22 09:03:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:02,358 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-10-22 09:03:02,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-10-22 09:03:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 09:03:02,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:02,360 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-10-22 09:03:02,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856395855] [2019-10-22 09:03:02,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,432 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:03:02,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856395855] [2019-10-22 09:03:02,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:02,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:02,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889595022] [2019-10-22 09:03:02,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:02,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:02,435 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-10-22 09:03:02,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:02,710 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-10-22 09:03:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:02,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 09:03:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:02,712 INFO L225 Difference]: With dead ends: 280 [2019-10-22 09:03:02,712 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 09:03:02,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 09:03:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 09:03:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-10-22 09:03:02,720 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-10-22 09:03:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:02,720 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-10-22 09:03:02,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-10-22 09:03:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 09:03:02,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:02,721 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,722 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-10-22 09:03:02,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057160853] [2019-10-22 09:03:02,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057160853] [2019-10-22 09:03:02,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:02,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:02,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520512726] [2019-10-22 09:03:02,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:02,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:02,784 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-10-22 09:03:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:03,051 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-10-22 09:03:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:03,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 09:03:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:03,052 INFO L225 Difference]: With dead ends: 280 [2019-10-22 09:03:03,052 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 09:03:03,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 09:03:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 09:03:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-10-22 09:03:03,059 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-10-22 09:03:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:03,059 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-10-22 09:03:03,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-10-22 09:03:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:03:03,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:03,060 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:03,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,060 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-10-22 09:03:03,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504668126] [2019-10-22 09:03:03,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504668126] [2019-10-22 09:03:03,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:03,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:03,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91991768] [2019-10-22 09:03:03,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:03,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:03,106 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-10-22 09:03:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:03,352 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-10-22 09:03:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:03,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 09:03:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:03,354 INFO L225 Difference]: With dead ends: 280 [2019-10-22 09:03:03,354 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 09:03:03,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 09:03:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 09:03:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-10-22 09:03:03,359 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-10-22 09:03:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:03,359 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-10-22 09:03:03,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-10-22 09:03:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 09:03:03,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:03,360 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,360 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-10-22 09:03:03,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986432374] [2019-10-22 09:03:03,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986432374] [2019-10-22 09:03:03,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:03,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:03,426 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581835292] [2019-10-22 09:03:03,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:03,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:03,427 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-10-22 09:03:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:03,708 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-10-22 09:03:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:03,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 09:03:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:03,710 INFO L225 Difference]: With dead ends: 280 [2019-10-22 09:03:03,710 INFO L226 Difference]: Without dead ends: 156 [2019-10-22 09:03:03,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-22 09:03:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-10-22 09:03:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 09:03:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-10-22 09:03:03,715 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-10-22 09:03:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:03,716 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-10-22 09:03:03,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-10-22 09:03:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 09:03:03,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:03,717 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,717 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:03,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-10-22 09:03:03,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989670013] [2019-10-22 09:03:03,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989670013] [2019-10-22 09:03:03,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:03,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:03,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101633911] [2019-10-22 09:03:03,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:03,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:03,771 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-10-22 09:03:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:04,102 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-10-22 09:03:04,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:04,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 09:03:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:04,103 INFO L225 Difference]: With dead ends: 310 [2019-10-22 09:03:04,103 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 09:03:04,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:04,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 09:03:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-10-22 09:03:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-10-22 09:03:04,109 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-10-22 09:03:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:04,109 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-10-22 09:03:04,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-10-22 09:03:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:03:04,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:04,110 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:04,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:04,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,111 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-10-22 09:03:04,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:04,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029458595] [2019-10-22 09:03:04,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029458595] [2019-10-22 09:03:04,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:04,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:04,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418001694] [2019-10-22 09:03:04,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:04,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:04,151 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-10-22 09:03:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:04,371 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-10-22 09:03:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:04,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:03:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:04,372 INFO L225 Difference]: With dead ends: 314 [2019-10-22 09:03:04,372 INFO L226 Difference]: Without dead ends: 168 [2019-10-22 09:03:04,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-22 09:03:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-10-22 09:03:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-10-22 09:03:04,377 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-10-22 09:03:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:04,377 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-10-22 09:03:04,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-10-22 09:03:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 09:03:04,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:04,381 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:04,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-10-22 09:03:04,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:04,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988575892] [2019-10-22 09:03:04,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988575892] [2019-10-22 09:03:04,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:04,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:04,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778463072] [2019-10-22 09:03:04,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:04,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:04,452 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-10-22 09:03:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:04,748 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-10-22 09:03:04,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:04,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-10-22 09:03:04,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:04,750 INFO L225 Difference]: With dead ends: 332 [2019-10-22 09:03:04,750 INFO L226 Difference]: Without dead ends: 186 [2019-10-22 09:03:04,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-22 09:03:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-10-22 09:03:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-10-22 09:03:04,755 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-10-22 09:03:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:04,755 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-10-22 09:03:04,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-10-22 09:03:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:03:04,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:04,756 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:04,756 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:04,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-10-22 09:03:04,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:04,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941729574] [2019-10-22 09:03:04,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941729574] [2019-10-22 09:03:04,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:04,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:04,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181077042] [2019-10-22 09:03:04,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:04,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:04,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:04,844 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-10-22 09:03:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:05,135 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-10-22 09:03:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:05,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 09:03:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:05,136 INFO L225 Difference]: With dead ends: 330 [2019-10-22 09:03:05,136 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 09:03:05,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 09:03:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-10-22 09:03:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-10-22 09:03:05,145 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-10-22 09:03:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:05,146 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-10-22 09:03:05,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-10-22 09:03:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:03:05,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:05,147 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:05,147 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-10-22 09:03:05,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:05,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33616220] [2019-10-22 09:03:05,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:05,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:05,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:05,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33616220] [2019-10-22 09:03:05,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:05,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:05,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868343057] [2019-10-22 09:03:05,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:05,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:05,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:05,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:05,195 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-10-22 09:03:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:05,448 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-10-22 09:03:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:05,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 09:03:05,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:05,449 INFO L225 Difference]: With dead ends: 329 [2019-10-22 09:03:05,449 INFO L226 Difference]: Without dead ends: 183 [2019-10-22 09:03:05,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-22 09:03:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-10-22 09:03:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-10-22 09:03:05,453 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-10-22 09:03:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:05,453 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-10-22 09:03:05,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-10-22 09:03:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 09:03:05,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:05,455 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:05,455 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:05,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-10-22 09:03:05,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:05,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548472067] [2019-10-22 09:03:05,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:05,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:05,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548472067] [2019-10-22 09:03:05,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:05,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:05,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456695330] [2019-10-22 09:03:05,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:05,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:05,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:05,495 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-10-22 09:03:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:05,784 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-10-22 09:03:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:05,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 09:03:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:05,785 INFO L225 Difference]: With dead ends: 328 [2019-10-22 09:03:05,785 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 09:03:05,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 09:03:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 09:03:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-10-22 09:03:05,790 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-10-22 09:03:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:05,790 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-10-22 09:03:05,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-10-22 09:03:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 09:03:05,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:05,791 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:05,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-10-22 09:03:05,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:05,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694921448] [2019-10-22 09:03:05,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:05,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:05,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:05,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694921448] [2019-10-22 09:03:05,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:05,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:05,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248187418] [2019-10-22 09:03:05,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:05,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:05,828 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-10-22 09:03:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:06,070 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-10-22 09:03:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:06,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 09:03:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:06,071 INFO L225 Difference]: With dead ends: 328 [2019-10-22 09:03:06,072 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 09:03:06,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 09:03:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 09:03:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-10-22 09:03:06,080 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-10-22 09:03:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,080 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-10-22 09:03:06,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-10-22 09:03:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 09:03:06,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:06,081 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:06,081 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-10-22 09:03:06,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:06,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48925726] [2019-10-22 09:03:06,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:06,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48925726] [2019-10-22 09:03:06,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:06,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:06,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229004173] [2019-10-22 09:03:06,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:06,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:06,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:06,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:06,128 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-10-22 09:03:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:06,367 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-10-22 09:03:06,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:06,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 09:03:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:06,368 INFO L225 Difference]: With dead ends: 328 [2019-10-22 09:03:06,368 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 09:03:06,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:06,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 09:03:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 09:03:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-10-22 09:03:06,373 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-10-22 09:03:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,373 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-10-22 09:03:06,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-10-22 09:03:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 09:03:06,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:06,374 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:06,374 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-10-22 09:03:06,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:06,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511767905] [2019-10-22 09:03:06,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:06,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511767905] [2019-10-22 09:03:06,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:06,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:06,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941448211] [2019-10-22 09:03:06,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:06,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:06,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:06,409 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-10-22 09:03:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:06,660 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-10-22 09:03:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:06,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-22 09:03:06,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:06,661 INFO L225 Difference]: With dead ends: 328 [2019-10-22 09:03:06,661 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 09:03:06,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 09:03:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-10-22 09:03:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-10-22 09:03:06,666 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-10-22 09:03:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,666 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-10-22 09:03:06,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-10-22 09:03:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-22 09:03:06,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:06,667 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:06,667 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-10-22 09:03:06,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:06,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926568036] [2019-10-22 09:03:06,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:06,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926568036] [2019-10-22 09:03:06,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:06,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:06,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378491771] [2019-10-22 09:03:06,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:06,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:06,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:06,708 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-10-22 09:03:06,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:06,939 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-10-22 09:03:06,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:06,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-22 09:03:06,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:06,941 INFO L225 Difference]: With dead ends: 318 [2019-10-22 09:03:06,941 INFO L226 Difference]: Without dead ends: 172 [2019-10-22 09:03:06,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-22 09:03:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-10-22 09:03:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-22 09:03:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-10-22 09:03:06,945 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-10-22 09:03:06,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,945 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-10-22 09:03:06,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-10-22 09:03:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:06,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:06,948 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:06,948 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-10-22 09:03:06,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:06,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749885447] [2019-10-22 09:03:06,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:07,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749885447] [2019-10-22 09:03:07,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:07,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:07,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740690451] [2019-10-22 09:03:07,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:07,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:07,011 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-10-22 09:03:07,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:07,388 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-10-22 09:03:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:07,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 09:03:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:07,390 INFO L225 Difference]: With dead ends: 408 [2019-10-22 09:03:07,390 INFO L226 Difference]: Without dead ends: 262 [2019-10-22 09:03:07,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-22 09:03:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-10-22 09:03:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-22 09:03:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-10-22 09:03:07,396 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-10-22 09:03:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:07,396 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-10-22 09:03:07,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-10-22 09:03:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:07,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:07,397 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:07,397 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-10-22 09:03:07,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:07,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919591132] [2019-10-22 09:03:07,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:07,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:07,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:07,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919591132] [2019-10-22 09:03:07,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:07,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:07,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045226294] [2019-10-22 09:03:07,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:07,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:07,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:07,460 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-10-22 09:03:07,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:07,764 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-10-22 09:03:07,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:07,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 09:03:07,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:07,766 INFO L225 Difference]: With dead ends: 446 [2019-10-22 09:03:07,766 INFO L226 Difference]: Without dead ends: 257 [2019-10-22 09:03:07,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-22 09:03:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-10-22 09:03:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-10-22 09:03:07,772 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-10-22 09:03:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:07,773 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-10-22 09:03:07,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-10-22 09:03:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:03:07,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:07,774 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:07,774 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:07,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-10-22 09:03:07,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:07,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187024688] [2019-10-22 09:03:07,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:07,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:07,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:07,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187024688] [2019-10-22 09:03:07,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:07,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:07,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302690507] [2019-10-22 09:03:07,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:07,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:07,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:07,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:07,835 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-10-22 09:03:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:08,198 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-10-22 09:03:08,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:08,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 09:03:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:08,200 INFO L225 Difference]: With dead ends: 499 [2019-10-22 09:03:08,200 INFO L226 Difference]: Without dead ends: 286 [2019-10-22 09:03:08,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-22 09:03:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-10-22 09:03:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-10-22 09:03:08,205 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-10-22 09:03:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:08,205 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-10-22 09:03:08,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-10-22 09:03:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:03:08,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:08,206 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:08,206 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-10-22 09:03:08,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:08,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283541310] [2019-10-22 09:03:08,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:08,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283541310] [2019-10-22 09:03:08,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:08,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:08,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282256066] [2019-10-22 09:03:08,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:08,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:08,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:08,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:08,264 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-10-22 09:03:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:08,542 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-10-22 09:03:08,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:08,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 09:03:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:08,544 INFO L225 Difference]: With dead ends: 470 [2019-10-22 09:03:08,544 INFO L226 Difference]: Without dead ends: 257 [2019-10-22 09:03:08,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-10-22 09:03:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-10-22 09:03:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-10-22 09:03:08,550 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-10-22 09:03:08,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:08,550 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-10-22 09:03:08,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-10-22 09:03:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:03:08,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:08,551 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:08,551 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-10-22 09:03:08,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:08,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831722204] [2019-10-22 09:03:08,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:08,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831722204] [2019-10-22 09:03:08,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:08,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:08,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084850342] [2019-10-22 09:03:08,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:08,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:08,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:08,603 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-10-22 09:03:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:08,980 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-10-22 09:03:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:08,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:03:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:08,982 INFO L225 Difference]: With dead ends: 497 [2019-10-22 09:03:08,982 INFO L226 Difference]: Without dead ends: 284 [2019-10-22 09:03:08,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-22 09:03:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-10-22 09:03:08,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-10-22 09:03:08,988 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-10-22 09:03:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:08,988 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-10-22 09:03:08,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-10-22 09:03:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:03:08,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:08,989 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:08,989 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-10-22 09:03:08,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:08,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680956255] [2019-10-22 09:03:08,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:09,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680956255] [2019-10-22 09:03:09,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:09,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:09,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525317031] [2019-10-22 09:03:09,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:09,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:09,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:09,046 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-10-22 09:03:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:09,397 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-10-22 09:03:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:09,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:03:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:09,398 INFO L225 Difference]: With dead ends: 496 [2019-10-22 09:03:09,398 INFO L226 Difference]: Without dead ends: 283 [2019-10-22 09:03:09,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-22 09:03:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-10-22 09:03:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-10-22 09:03:09,407 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-10-22 09:03:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:09,408 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-10-22 09:03:09,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-10-22 09:03:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:03:09,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:09,409 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:09,409 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-10-22 09:03:09,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:09,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486630692] [2019-10-22 09:03:09,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:09,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486630692] [2019-10-22 09:03:09,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:09,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:09,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559099422] [2019-10-22 09:03:09,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:09,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:09,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:09,506 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-10-22 09:03:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:09,797 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-10-22 09:03:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:09,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:03:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:09,798 INFO L225 Difference]: With dead ends: 468 [2019-10-22 09:03:09,798 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 09:03:09,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 09:03:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-10-22 09:03:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-10-22 09:03:09,804 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-10-22 09:03:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:09,804 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-10-22 09:03:09,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-10-22 09:03:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:03:09,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:09,805 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:09,805 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:09,805 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-10-22 09:03:09,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:09,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744296204] [2019-10-22 09:03:09,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:09,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744296204] [2019-10-22 09:03:09,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:09,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:09,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620100136] [2019-10-22 09:03:09,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:09,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:09,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:09,857 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-10-22 09:03:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,126 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-10-22 09:03:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:10,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:03:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,128 INFO L225 Difference]: With dead ends: 467 [2019-10-22 09:03:10,128 INFO L226 Difference]: Without dead ends: 254 [2019-10-22 09:03:10,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-10-22 09:03:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-10-22 09:03:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-10-22 09:03:10,134 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-10-22 09:03:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:10,134 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-10-22 09:03:10,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-10-22 09:03:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:03:10,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:10,135 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:10,135 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:10,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-10-22 09:03:10,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:10,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792755010] [2019-10-22 09:03:10,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:10,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792755010] [2019-10-22 09:03:10,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:10,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:10,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042567418] [2019-10-22 09:03:10,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:10,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:10,191 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-10-22 09:03:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,532 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-10-22 09:03:10,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:10,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 09:03:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,534 INFO L225 Difference]: With dead ends: 495 [2019-10-22 09:03:10,534 INFO L226 Difference]: Without dead ends: 282 [2019-10-22 09:03:10,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-22 09:03:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-10-22 09:03:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 09:03:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-10-22 09:03:10,540 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-10-22 09:03:10,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:10,540 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-10-22 09:03:10,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-10-22 09:03:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:03:10,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:10,541 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:10,541 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:10,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:10,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-10-22 09:03:10,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:10,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647375126] [2019-10-22 09:03:10,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-22 09:03:10,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647375126] [2019-10-22 09:03:10,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:10,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:10,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392090921] [2019-10-22 09:03:10,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:10,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:10,613 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-10-22 09:03:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,957 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-10-22 09:03:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:10,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-22 09:03:10,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,958 INFO L225 Difference]: With dead ends: 466 [2019-10-22 09:03:10,958 INFO L226 Difference]: Without dead ends: 253 [2019-10-22 09:03:10,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-22 09:03:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-10-22 09:03:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-10-22 09:03:10,961 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-10-22 09:03:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:10,962 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-10-22 09:03:10,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-10-22 09:03:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:03:10,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:10,963 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:10,963 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-10-22 09:03:10,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:10,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633783359] [2019-10-22 09:03:10,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:11,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633783359] [2019-10-22 09:03:11,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:11,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667579683] [2019-10-22 09:03:11,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:11,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:11,029 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-10-22 09:03:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:11,309 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-10-22 09:03:11,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:11,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 09:03:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:11,311 INFO L225 Difference]: With dead ends: 535 [2019-10-22 09:03:11,311 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 09:03:11,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 09:03:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-10-22 09:03:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-10-22 09:03:11,318 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-10-22 09:03:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:11,318 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-10-22 09:03:11,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-10-22 09:03:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:03:11,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:11,319 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:11,319 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:11,320 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-10-22 09:03:11,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:11,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061727301] [2019-10-22 09:03:11,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:11,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061727301] [2019-10-22 09:03:11,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:11,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977703087] [2019-10-22 09:03:11,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:11,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:11,365 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-10-22 09:03:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:11,606 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-10-22 09:03:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:11,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 09:03:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:11,607 INFO L225 Difference]: With dead ends: 506 [2019-10-22 09:03:11,607 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 09:03:11,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 09:03:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-10-22 09:03:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-10-22 09:03:11,613 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-10-22 09:03:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:11,613 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-10-22 09:03:11,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-10-22 09:03:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:03:11,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:11,615 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:11,615 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-10-22 09:03:11,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:11,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138875088] [2019-10-22 09:03:11,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:11,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138875088] [2019-10-22 09:03:11,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:11,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611031110] [2019-10-22 09:03:11,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:11,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:11,669 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-10-22 09:03:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:11,922 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-10-22 09:03:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:11,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 09:03:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:11,923 INFO L225 Difference]: With dead ends: 535 [2019-10-22 09:03:11,923 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 09:03:11,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 09:03:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-10-22 09:03:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-10-22 09:03:11,928 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-10-22 09:03:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:11,928 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-10-22 09:03:11,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-10-22 09:03:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:03:11,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:11,929 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:11,930 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:11,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-10-22 09:03:11,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:11,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598866066] [2019-10-22 09:03:11,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:11,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598866066] [2019-10-22 09:03:11,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:11,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623489588] [2019-10-22 09:03:11,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:11,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:11,986 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-10-22 09:03:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:12,191 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-10-22 09:03:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:12,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 09:03:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:12,193 INFO L225 Difference]: With dead ends: 506 [2019-10-22 09:03:12,193 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 09:03:12,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 09:03:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-10-22 09:03:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-10-22 09:03:12,199 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-10-22 09:03:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:12,199 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-10-22 09:03:12,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-10-22 09:03:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:03:12,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:12,200 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:12,200 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-10-22 09:03:12,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:12,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152898931] [2019-10-22 09:03:12,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:12,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152898931] [2019-10-22 09:03:12,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:12,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:12,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368065825] [2019-10-22 09:03:12,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:12,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:12,244 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-10-22 09:03:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:12,616 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-10-22 09:03:12,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:12,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 09:03:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:12,617 INFO L225 Difference]: With dead ends: 535 [2019-10-22 09:03:12,617 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 09:03:12,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 09:03:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-10-22 09:03:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-10-22 09:03:12,627 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-10-22 09:03:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:12,628 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-10-22 09:03:12,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-10-22 09:03:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:03:12,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:12,629 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:12,630 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-10-22 09:03:12,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:12,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679575340] [2019-10-22 09:03:12,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:12,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679575340] [2019-10-22 09:03:12,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:12,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:12,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849779872] [2019-10-22 09:03:12,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:12,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:12,675 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-10-22 09:03:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:12,947 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-10-22 09:03:12,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:12,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 09:03:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:12,948 INFO L225 Difference]: With dead ends: 506 [2019-10-22 09:03:12,948 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 09:03:12,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 09:03:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-10-22 09:03:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-10-22 09:03:12,953 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-10-22 09:03:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:12,954 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-10-22 09:03:12,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-10-22 09:03:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 09:03:12,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:12,955 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:12,955 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:12,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-10-22 09:03:12,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:12,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568391448] [2019-10-22 09:03:12,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:13,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568391448] [2019-10-22 09:03:13,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:13,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:13,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337207407] [2019-10-22 09:03:13,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:13,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:13,011 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-10-22 09:03:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:13,319 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-10-22 09:03:13,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:13,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 09:03:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:13,320 INFO L225 Difference]: With dead ends: 525 [2019-10-22 09:03:13,320 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 09:03:13,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 09:03:13,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-10-22 09:03:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-10-22 09:03:13,327 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-10-22 09:03:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:13,327 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-10-22 09:03:13,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-10-22 09:03:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 09:03:13,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:13,329 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:13,329 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-10-22 09:03:13,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:13,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714740511] [2019-10-22 09:03:13,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:13,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714740511] [2019-10-22 09:03:13,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:13,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:13,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933019438] [2019-10-22 09:03:13,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:13,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:13,391 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-10-22 09:03:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:13,629 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-10-22 09:03:13,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:13,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 09:03:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:13,631 INFO L225 Difference]: With dead ends: 496 [2019-10-22 09:03:13,631 INFO L226 Difference]: Without dead ends: 263 [2019-10-22 09:03:13,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-22 09:03:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-10-22 09:03:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-10-22 09:03:13,638 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-10-22 09:03:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:13,639 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-10-22 09:03:13,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-10-22 09:03:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:03:13,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:13,640 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:13,640 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-10-22 09:03:13,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:13,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346085671] [2019-10-22 09:03:13,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:13,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346085671] [2019-10-22 09:03:13,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:13,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:13,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607815756] [2019-10-22 09:03:13,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:13,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:13,738 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-10-22 09:03:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:14,064 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-10-22 09:03:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:14,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 09:03:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:14,065 INFO L225 Difference]: With dead ends: 525 [2019-10-22 09:03:14,065 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 09:03:14,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 09:03:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-10-22 09:03:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-22 09:03:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-10-22 09:03:14,073 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-10-22 09:03:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-10-22 09:03:14,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-10-22 09:03:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:03:14,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:14,074 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:14,075 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-10-22 09:03:14,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:14,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693939649] [2019-10-22 09:03:14,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 09:03:14,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693939649] [2019-10-22 09:03:14,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:14,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:14,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019741942] [2019-10-22 09:03:14,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:14,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:14,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:14,124 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-10-22 09:03:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:14,153 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-10-22 09:03:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:14,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 09:03:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:14,155 INFO L225 Difference]: With dead ends: 716 [2019-10-22 09:03:14,155 INFO L226 Difference]: Without dead ends: 483 [2019-10-22 09:03:14,156 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:03:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-22 09:03:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-10-22 09:03:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-10-22 09:03:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-10-22 09:03:14,167 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-10-22 09:03:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:14,167 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-10-22 09:03:14,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-10-22 09:03:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 09:03:14,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:14,168 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:14,169 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-10-22 09:03:14,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:14,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904183242] [2019-10-22 09:03:14,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-22 09:03:14,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904183242] [2019-10-22 09:03:14,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:14,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:14,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696693253] [2019-10-22 09:03:14,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:14,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:14,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:14,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:14,220 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-10-22 09:03:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:14,270 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-10-22 09:03:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:14,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-22 09:03:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:14,272 INFO L225 Difference]: With dead ends: 947 [2019-10-22 09:03:14,272 INFO L226 Difference]: Without dead ends: 483 [2019-10-22 09:03:14,273 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:03:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-22 09:03:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-10-22 09:03:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-10-22 09:03:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-10-22 09:03:14,285 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-10-22 09:03:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:14,286 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-10-22 09:03:14,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-10-22 09:03:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 09:03:14,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:14,287 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:14,287 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:14,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-10-22 09:03:14,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:14,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443268013] [2019-10-22 09:03:14,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:14,486 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:14,486 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:03:14,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:03:14 BoogieIcfgContainer [2019-10-22 09:03:14,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:03:14,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:14,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:14,597 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:14,598 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:59" (3/4) ... [2019-10-22 09:03:14,601 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:03:14,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:14,603 INFO L168 Benchmark]: Toolchain (without parser) took 16878.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 351.8 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:14,604 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:14,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:14,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:14,604 INFO L168 Benchmark]: Boogie Preprocessor took 97.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:14,604 INFO L168 Benchmark]: RCFGBuilder took 1174.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.1 MB). Peak memory consumption was 91.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:14,605 INFO L168 Benchmark]: TraceAbstraction took 14726.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:14,605 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:14,606 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 778.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1174.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.1 MB). Peak memory consumption was 91.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14726.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-3:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-3:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-3:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.6s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 10403 SDs, 0 SdLazy, 6834 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 86 SyntacticMatches, 33 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 773930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 09:03:16,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:03:16,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:03:16,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:03:16,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:03:16,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:03:16,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:03:16,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:03:16,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:03:16,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:03:16,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:03:16,644 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:03:16,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:03:16,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:03:16,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:03:16,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:03:16,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:03:16,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:03:16,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:03:16,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:03:16,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:03:16,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:03:16,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:03:16,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:03:16,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:03:16,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:03:16,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:03:16,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:03:16,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:03:16,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:03:16,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:03:16,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:03:16,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:03:16,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:03:16,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:03:16,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:03:16,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:03:16,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:03:16,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:03:16,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:03:16,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:03:16,664 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 09:03:16,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:03:16,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:03:16,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:03:16,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:03:16,677 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:03:16,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:03:16,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:03:16,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:03:16,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:03:16,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:03:16,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:03:16,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:03:16,679 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 09:03:16,679 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 09:03:16,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:03:16,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:03:16,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:03:16,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:03:16,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:03:16,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:03:16,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:03:16,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:03:16,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:03:16,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:03:16,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:03:16,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:03:16,681 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 09:03:16,681 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 09:03:16,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:03:16,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 09:03:16,681 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/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 -> 9c69768cb083538b139479bdbb35676eb3378c1b [2019-10-22 09:03:16,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:03:16,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:03:16,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:03:16,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:03:16,721 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:03:16,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 09:03:16,760 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/be610a68a/35fd39485c1f49dc8391bb9e91cf4117/FLAGf345e35d7 [2019-10-22 09:03:17,308 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:03:17,308 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-10-22 09:03:17,322 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/be610a68a/35fd39485c1f49dc8391bb9e91cf4117/FLAGf345e35d7 [2019-10-22 09:03:17,747 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/data/be610a68a/35fd39485c1f49dc8391bb9e91cf4117 [2019-10-22 09:03:17,751 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:03:17,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:03:17,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:17,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:03:17,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:03:17,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:17" (1/1) ... [2019-10-22 09:03:17,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1793d380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:17, skipping insertion in model container [2019-10-22 09:03:17,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:17" (1/1) ... [2019-10-22 09:03:17,766 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:03:17,823 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:03:18,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:18,286 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:03:18,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:18,403 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:03:18,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18 WrapperNode [2019-10-22 09:03:18,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:18,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:18,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:03:18,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:03:18,413 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:03:18" (1/1) ... [2019-10-22 09:03:18,435 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:03:18" (1/1) ... [2019-10-22 09:03:18,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:18,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:03:18,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:03:18,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:03:18,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... [2019-10-22 09:03:18,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:03:18,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:03:18,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:03:18,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:03:18,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/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:03:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:03:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:03:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 09:03:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:03:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:03:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:03:18,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:03:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 09:03:18,989 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:03:21,578 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 09:03:21,578 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 09:03:21,579 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:03:21,579 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:03:21,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:21 BoogieIcfgContainer [2019-10-22 09:03:21,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:03:21,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:03:21,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:03:21,584 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:03:21,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:03:17" (1/3) ... [2019-10-22 09:03:21,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4a3706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:03:21, skipping insertion in model container [2019-10-22 09:03:21,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:18" (2/3) ... [2019-10-22 09:03:21,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f4a3706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:03:21, skipping insertion in model container [2019-10-22 09:03:21,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:21" (3/3) ... [2019-10-22 09:03:21,588 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-10-22 09:03:21,596 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:03:21,604 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:03:21,616 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:03:21,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:03:21,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:03:21,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:03:21,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:03:21,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:03:21,639 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:03:21,639 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:03:21,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:03:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-10-22 09:03:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:03:21,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:21,661 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:21,662 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:21,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-10-22 09:03:21,677 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:03:21,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1675352768] [2019-10-22 09:03:21,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:21,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:21,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:21,911 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:03:21,912 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:03:21,934 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:03:21,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1675352768] [2019-10-22 09:03:21,935 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:21,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:03:21,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714032364] [2019-10-22 09:03:21,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:21,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:03:21,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:21,959 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-10-22 09:03:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:22,102 INFO L93 Difference]: Finished difference Result 549 states and 925 transitions. [2019-10-22 09:03:22,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:22,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 09:03:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:22,116 INFO L225 Difference]: With dead ends: 549 [2019-10-22 09:03:22,116 INFO L226 Difference]: Without dead ends: 373 [2019-10-22 09:03:22,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-10-22 09:03:22,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2019-10-22 09:03:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-22 09:03:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2019-10-22 09:03:22,180 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 45 [2019-10-22 09:03:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:22,181 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2019-10-22 09:03:22,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2019-10-22 09:03:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:03:22,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:22,184 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:22,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:22,385 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash -60762572, now seen corresponding path program 1 times [2019-10-22 09:03:22,386 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:03:22,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [907131331] [2019-10-22 09:03:22,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:22,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:22,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:22,569 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:03:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:22,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [907131331] [2019-10-22 09:03:22,589 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:22,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:03:22,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369327074] [2019-10-22 09:03:22,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:22,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:03:22,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:22,592 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand 4 states. [2019-10-22 09:03:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:22,885 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2019-10-22 09:03:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:22,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:03:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:22,888 INFO L225 Difference]: With dead ends: 853 [2019-10-22 09:03:22,889 INFO L226 Difference]: Without dead ends: 611 [2019-10-22 09:03:22,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-22 09:03:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-10-22 09:03:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-10-22 09:03:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 922 transitions. [2019-10-22 09:03:22,946 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 922 transitions. Word has length 63 [2019-10-22 09:03:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:22,946 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 922 transitions. [2019-10-22 09:03:22,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 922 transitions. [2019-10-22 09:03:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 09:03:22,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:22,951 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:23,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:23,151 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2005677060, now seen corresponding path program 1 times [2019-10-22 09:03:23,153 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:03:23,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [135206492] [2019-10-22 09:03:23,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:23,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:23,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:23,462 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:03:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:03:23,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [135206492] [2019-10-22 09:03:23,491 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:23,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:03:23,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821467451] [2019-10-22 09:03:23,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:23,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:03:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:23,494 INFO L87 Difference]: Start difference. First operand 609 states and 922 transitions. Second operand 4 states. [2019-10-22 09:03:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:23,916 INFO L93 Difference]: Finished difference Result 1091 states and 1654 transitions. [2019-10-22 09:03:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:23,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-22 09:03:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:23,919 INFO L225 Difference]: With dead ends: 1091 [2019-10-22 09:03:23,919 INFO L226 Difference]: Without dead ends: 611 [2019-10-22 09:03:23,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-22 09:03:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-22 09:03:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-22 09:03:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 918 transitions. [2019-10-22 09:03:23,949 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 918 transitions. Word has length 123 [2019-10-22 09:03:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:23,952 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 918 transitions. [2019-10-22 09:03:23,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 918 transitions. [2019-10-22 09:03:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-22 09:03:23,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:23,960 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:24,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:24,161 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-10-22 09:03:24,162 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:03:24,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1933427089] [2019-10-22 09:03:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:26,238 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-10-22 09:03:26,239 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:03:26,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:03:26,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:03:26 BoogieIcfgContainer [2019-10-22 09:03:26,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:03:26,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:26,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:26,612 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:26,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:21" (3/4) ... [2019-10-22 09:03:26,614 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:03:26,736 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b857a69a-ac05-4c26-bd5d-1dce21494180/bin/uautomizer/witness.graphml [2019-10-22 09:03:26,736 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:26,738 INFO L168 Benchmark]: Toolchain (without parser) took 8985.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -110.2 MB). Peak memory consumption was 130.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,738 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:26,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,739 INFO L168 Benchmark]: Boogie Preprocessor took 101.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,739 INFO L168 Benchmark]: RCFGBuilder took 2996.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.8 MB). Peak memory consumption was 96.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,739 INFO L168 Benchmark]: TraceAbstraction took 5029.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,739 INFO L168 Benchmark]: Witness Printer took 124.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:26,741 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 651.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2996.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.8 MB). Peak memory consumption was 96.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5029.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.8 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Witness Printer took 124.83 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1706]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.9s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 951 SDtfs, 1145 SDslu, 976 SDs, 0 SdLazy, 86 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 120522 SizeOfPredicates, 2 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 224/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...