./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.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_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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 1c80528d715feba546d9b9f6f7af7c865965b863 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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 1c80528d715feba546d9b9f6f7af7c865965b863 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01:23,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:23,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:23,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:23,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:23,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:23,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:23,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:23,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:23,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:23,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:23,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:23,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:23,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:23,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:23,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:23,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:23,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:23,680 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:23,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:23,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:23,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:23,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:23,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:23,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:23,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:23,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:23,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:23,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:23,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:23,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:23,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:23,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:23,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:23,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:23,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:23,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:23,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:23,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:23,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:23,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:23,701 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:23,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:23,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:23,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:23,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:23,717 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:23,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:23,717 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:23,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:23,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:23,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:23,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:23,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:23,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:23,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:23,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:23,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:23,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:23,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:23,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:23,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:23,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:23,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:23,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:23,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:23,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:23,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:23,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:23,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:23,731 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_38aab8fc-a140-4d1e-ad71-79b045460ec3/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 -> 1c80528d715feba546d9b9f6f7af7c865965b863 [2019-10-22 09:01:23,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:23,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:23,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:23,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:23,779 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:23,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 09:01:23,823 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/7d242f0c2/2b348f42d52d4d5cbb36bf26e832f5d1/FLAG240478f13 [2019-10-22 09:01:24,309 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:24,318 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 09:01:24,342 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/7d242f0c2/2b348f42d52d4d5cbb36bf26e832f5d1/FLAG240478f13 [2019-10-22 09:01:24,850 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/7d242f0c2/2b348f42d52d4d5cbb36bf26e832f5d1 [2019-10-22 09:01:24,854 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:24,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:24,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:24,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:24,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:24,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:24" (1/1) ... [2019-10-22 09:01:24,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd6334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:24, skipping insertion in model container [2019-10-22 09:01:24,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:24" (1/1) ... [2019-10-22 09:01:24,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:24,919 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:25,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:25,422 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:25,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:25,551 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:25,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25 WrapperNode [2019-10-22 09:01:25,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:25,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:25,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:25,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:25,562 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:01:25" (1/1) ... [2019-10-22 09:01:25,599 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:01:25" (1/1) ... [2019-10-22 09:01:25,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:25,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:25,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:25,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:25,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... [2019-10-22 09:01:25,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:25,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:25,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:25,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:25,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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:01:25,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:01:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:01:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:01:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:01:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:25,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:25,997 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:01:26,749 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 09:01:26,749 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 09:01:26,751 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:26,751 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:26,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:26 BoogieIcfgContainer [2019-10-22 09:01:26,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:26,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:26,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:26,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:26,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:24" (1/3) ... [2019-10-22 09:01:26,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c325d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:26, skipping insertion in model container [2019-10-22 09:01:26,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:25" (2/3) ... [2019-10-22 09:01:26,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c325d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:26, skipping insertion in model container [2019-10-22 09:01:26,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:26" (3/3) ... [2019-10-22 09:01:26,761 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-10-22 09:01:26,772 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:26,780 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:26,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:26,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:26,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:26,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:26,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:26,813 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:26,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:26,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:26,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-10-22 09:01:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:01:26,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,842 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:01:26,844 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-10-22 09:01:26,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331282331] [2019-10-22 09:01:26,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:27,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331282331] [2019-10-22 09:01:27,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:27,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067204686] [2019-10-22 09:01:27,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:27,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:27,180 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-10-22 09:01:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,613 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-10-22 09:01:27,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:27,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 09:01:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,631 INFO L225 Difference]: With dead ends: 313 [2019-10-22 09:01:27,634 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 09:01:27,637 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:01:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 09:01:27,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-10-22 09:01:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-10-22 09:01:27,689 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-10-22 09:01:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,689 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-10-22 09:01:27,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-10-22 09:01:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 09:01:27,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,692 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:01:27,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-10-22 09:01:27,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788062368] [2019-10-22 09:01:27,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,830 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:01:27,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788062368] [2019-10-22 09:01:27,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:27,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43919908] [2019-10-22 09:01:27,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:27,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:27,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:27,834 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-10-22 09:01:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,183 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-10-22 09:01:28,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:28,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-22 09:01:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,185 INFO L225 Difference]: With dead ends: 280 [2019-10-22 09:01:28,185 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 09:01:28,186 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:01:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 09:01:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-10-22 09:01:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-10-22 09:01:28,204 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-10-22 09:01:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,205 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-10-22 09:01:28,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-10-22 09:01:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:01:28,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,207 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:28,207 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,207 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-10-22 09:01:28,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792667339] [2019-10-22 09:01:28,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,297 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:01:28,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792667339] [2019-10-22 09:01:28,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:28,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:28,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106040676] [2019-10-22 09:01:28,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:28,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:28,300 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-10-22 09:01:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,582 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-10-22 09:01:28,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:28,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:01:28,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,585 INFO L225 Difference]: With dead ends: 279 [2019-10-22 09:01:28,585 INFO L226 Difference]: Without dead ends: 157 [2019-10-22 09:01:28,586 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:01:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-22 09:01:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-10-22 09:01:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-10-22 09:01:28,595 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-10-22 09:01:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,595 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-10-22 09:01:28,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-10-22 09:01:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:01:28,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,597 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:01:28,597 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-10-22 09:01:28,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139841950] [2019-10-22 09:01:28,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,692 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:01:28,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139841950] [2019-10-22 09:01:28,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:28,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:28,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112179685] [2019-10-22 09:01:28,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:28,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:28,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:28,694 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-10-22 09:01:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,980 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-10-22 09:01:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:28,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:01:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,981 INFO L225 Difference]: With dead ends: 277 [2019-10-22 09:01:28,982 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 09:01:28,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 09:01:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-10-22 09:01:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-10-22 09:01:28,990 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-10-22 09:01:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,991 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-10-22 09:01:28,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-10-22 09:01:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:01:28,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,992 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:01:28,993 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-10-22 09:01:28,993 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170746449] [2019-10-22 09:01:28,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,053 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:01:29,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170746449] [2019-10-22 09:01:29,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:29,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463305781] [2019-10-22 09:01:29,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:29,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:29,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:29,056 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-10-22 09:01:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,309 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-10-22 09:01:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:29,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:01:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,310 INFO L225 Difference]: With dead ends: 276 [2019-10-22 09:01:29,310 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 09:01:29,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:01:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 09:01:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 09:01:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-10-22 09:01:29,318 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-10-22 09:01:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,318 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-10-22 09:01:29,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-10-22 09:01:29,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:01:29,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,320 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,320 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,320 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-10-22 09:01:29,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680258274] [2019-10-22 09:01:29,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,402 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:01:29,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680258274] [2019-10-22 09:01:29,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:29,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356459968] [2019-10-22 09:01:29,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:29,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:29,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:29,404 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-10-22 09:01:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,611 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-10-22 09:01:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:29,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:01:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,618 INFO L225 Difference]: With dead ends: 276 [2019-10-22 09:01:29,618 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 09:01:29,619 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:01:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 09:01:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 09:01:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-10-22 09:01:29,625 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-10-22 09:01:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,625 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-10-22 09:01:29,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-10-22 09:01:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 09:01:29,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,627 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,627 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-10-22 09:01:29,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438379022] [2019-10-22 09:01:29,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,689 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:01:29,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438379022] [2019-10-22 09:01:29,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:29,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090407195] [2019-10-22 09:01:29,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:29,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:29,693 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-10-22 09:01:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,911 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-10-22 09:01:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:29,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 09:01:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,916 INFO L225 Difference]: With dead ends: 276 [2019-10-22 09:01:29,916 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 09:01:29,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 09:01:29,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 09:01:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-10-22 09:01:29,927 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-10-22 09:01:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-10-22 09:01:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-10-22 09:01:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:01:29,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,928 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,928 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-10-22 09:01:29,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310942971] [2019-10-22 09:01:29,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,972 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:01:29,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310942971] [2019-10-22 09:01:29,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:29,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435592075] [2019-10-22 09:01:29,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:29,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:29,974 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-10-22 09:01:30,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,172 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-10-22 09:01:30,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:30,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 09:01:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,173 INFO L225 Difference]: With dead ends: 276 [2019-10-22 09:01:30,173 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 09:01:30,173 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:01:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 09:01:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 09:01:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-10-22 09:01:30,178 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-10-22 09:01:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:30,178 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-10-22 09:01:30,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-10-22 09:01:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 09:01:30,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:30,179 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:30,180 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:30,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-10-22 09:01:30,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809497185] [2019-10-22 09:01:30,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,236 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:01:30,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809497185] [2019-10-22 09:01:30,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:30,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:30,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862036283] [2019-10-22 09:01:30,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:30,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:30,238 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-10-22 09:01:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,415 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-10-22 09:01:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:30,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 09:01:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,417 INFO L225 Difference]: With dead ends: 266 [2019-10-22 09:01:30,417 INFO L226 Difference]: Without dead ends: 144 [2019-10-22 09:01:30,417 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:01:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-22 09:01:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-10-22 09:01:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 09:01:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-10-22 09:01:30,421 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-10-22 09:01:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:30,421 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-10-22 09:01:30,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-10-22 09:01:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 09:01:30,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:30,422 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:01:30,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-10-22 09:01:30,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449398014] [2019-10-22 09:01:30,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,486 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:01:30,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449398014] [2019-10-22 09:01:30,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:30,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:30,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568715617] [2019-10-22 09:01:30,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:30,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:30,488 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-10-22 09:01:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,749 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-10-22 09:01:30,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:30,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 09:01:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,750 INFO L225 Difference]: With dead ends: 306 [2019-10-22 09:01:30,750 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 09:01:30,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:01:30,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 09:01:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-10-22 09:01:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-10-22 09:01:30,756 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-10-22 09:01:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:30,756 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-10-22 09:01:30,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-10-22 09:01:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 09:01:30,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:30,758 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:01:30,758 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-10-22 09:01:30,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826053976] [2019-10-22 09:01:30,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,831 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:01:30,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826053976] [2019-10-22 09:01:30,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:30,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:30,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774318713] [2019-10-22 09:01:30,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:30,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:30,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:30,833 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-10-22 09:01:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,138 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-10-22 09:01:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:31,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-10-22 09:01:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:31,140 INFO L225 Difference]: With dead ends: 328 [2019-10-22 09:01:31,140 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 09:01:31,140 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:01:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 09:01:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-10-22 09:01:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-10-22 09:01:31,145 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-10-22 09:01:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,145 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-10-22 09:01:31,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-10-22 09:01:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:01:31,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,146 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:31,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-10-22 09:01:31,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583638792] [2019-10-22 09:01:31,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,211 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:01:31,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583638792] [2019-10-22 09:01:31,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:31,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740908626] [2019-10-22 09:01:31,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:31,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:31,213 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-10-22 09:01:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,493 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-10-22 09:01:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:31,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 09:01:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:31,494 INFO L225 Difference]: With dead ends: 327 [2019-10-22 09:01:31,495 INFO L226 Difference]: Without dead ends: 183 [2019-10-22 09:01:31,495 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:01:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-22 09:01:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-10-22 09:01:31,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:31,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-10-22 09:01:31,503 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-10-22 09:01:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,503 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-10-22 09:01:31,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:31,503 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-10-22 09:01:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:01:31,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,504 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:01:31,504 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-10-22 09:01:31,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935659215] [2019-10-22 09:01:31,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,580 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:01:31,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935659215] [2019-10-22 09:01:31,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:31,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468734751] [2019-10-22 09:01:31,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:31,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:31,584 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-10-22 09:01:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,845 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-10-22 09:01:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:31,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 09:01:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:31,846 INFO L225 Difference]: With dead ends: 325 [2019-10-22 09:01:31,847 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 09:01:31,847 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:01:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 09:01:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-10-22 09:01:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-10-22 09:01:31,852 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-10-22 09:01:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,853 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-10-22 09:01:31,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-10-22 09:01:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:01:31,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,854 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:01:31,854 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-10-22 09:01:31,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508163078] [2019-10-22 09:01:31,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,903 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:01:31,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508163078] [2019-10-22 09:01:31,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:31,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312055655] [2019-10-22 09:01:31,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:31,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:31,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:31,905 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-10-22 09:01:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,171 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-10-22 09:01:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:32,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 09:01:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,173 INFO L225 Difference]: With dead ends: 324 [2019-10-22 09:01:32,173 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 09:01:32,173 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:01:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 09:01:32,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 09:01:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-10-22 09:01:32,177 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-10-22 09:01:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,178 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-10-22 09:01:32,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-10-22 09:01:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 09:01:32,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,180 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,180 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-10-22 09:01:32,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269579142] [2019-10-22 09:01:32,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,226 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:01:32,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269579142] [2019-10-22 09:01:32,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:32,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927456300] [2019-10-22 09:01:32,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:32,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:32,228 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-10-22 09:01:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,476 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-10-22 09:01:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:32,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 09:01:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,477 INFO L225 Difference]: With dead ends: 324 [2019-10-22 09:01:32,478 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 09:01:32,478 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:01:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 09:01:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 09:01:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-10-22 09:01:32,482 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-10-22 09:01:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,482 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-10-22 09:01:32,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-10-22 09:01:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 09:01:32,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,486 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,486 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-10-22 09:01:32,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881488814] [2019-10-22 09:01:32,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,530 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:01:32,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881488814] [2019-10-22 09:01:32,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:32,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245443668] [2019-10-22 09:01:32,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:32,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:32,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:32,532 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-10-22 09:01:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,803 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-10-22 09:01:32,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:32,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 09:01:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,804 INFO L225 Difference]: With dead ends: 324 [2019-10-22 09:01:32,805 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 09:01:32,805 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:01:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 09:01:32,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 09:01:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:32,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-10-22 09:01:32,809 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-10-22 09:01:32,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,810 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-10-22 09:01:32,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-10-22 09:01:32,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 09:01:32,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,811 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,811 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,811 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-10-22 09:01:32,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906281845] [2019-10-22 09:01:32,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,846 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:01:32,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906281845] [2019-10-22 09:01:32,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:32,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919802649] [2019-10-22 09:01:32,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:32,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:32,848 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-10-22 09:01:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,116 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-10-22 09:01:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:33,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 09:01:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,117 INFO L225 Difference]: With dead ends: 324 [2019-10-22 09:01:33,117 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 09:01:33,118 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:01:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 09:01:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-10-22 09:01:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-10-22 09:01:33,122 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-10-22 09:01:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,122 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-10-22 09:01:33,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-10-22 09:01:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 09:01:33,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,123 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:33,123 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,123 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-10-22 09:01:33,123 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966030114] [2019-10-22 09:01:33,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,160 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:01:33,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966030114] [2019-10-22 09:01:33,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:33,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709828129] [2019-10-22 09:01:33,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:33,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:33,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:33,162 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-10-22 09:01:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,399 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-10-22 09:01:33,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:33,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-22 09:01:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,401 INFO L225 Difference]: With dead ends: 314 [2019-10-22 09:01:33,401 INFO L226 Difference]: Without dead ends: 170 [2019-10-22 09:01:33,401 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:01:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-22 09:01:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-10-22 09:01:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 09:01:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-10-22 09:01:33,406 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-10-22 09:01:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,406 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-10-22 09:01:33,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-10-22 09:01:33,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:01:33,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,407 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:01:33,408 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-10-22 09:01:33,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292476252] [2019-10-22 09:01:33,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,471 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:01:33,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292476252] [2019-10-22 09:01:33,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:33,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995712849] [2019-10-22 09:01:33,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:33,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:33,473 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-10-22 09:01:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,878 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-10-22 09:01:33,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:33,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 09:01:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,879 INFO L225 Difference]: With dead ends: 402 [2019-10-22 09:01:33,880 INFO L226 Difference]: Without dead ends: 258 [2019-10-22 09:01:33,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-22 09:01:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-10-22 09:01:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 09:01:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-10-22 09:01:33,886 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-10-22 09:01:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,886 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-10-22 09:01:33,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-10-22 09:01:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:01:33,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,887 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:01:33,888 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-10-22 09:01:33,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809493105] [2019-10-22 09:01:33,888 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,967 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:01:33,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809493105] [2019-10-22 09:01:33,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:33,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479566661] [2019-10-22 09:01:33,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:33,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:33,968 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-10-22 09:01:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,263 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-10-22 09:01:34,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:34,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 09:01:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,264 INFO L225 Difference]: With dead ends: 442 [2019-10-22 09:01:34,264 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 09:01:34,265 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:01:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 09:01:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-10-22 09:01:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 09:01:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-10-22 09:01:34,270 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-10-22 09:01:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,271 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-10-22 09:01:34,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-10-22 09:01:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:01:34,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,272 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:01:34,272 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-10-22 09:01:34,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432809591] [2019-10-22 09:01:34,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,320 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:01:34,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432809591] [2019-10-22 09:01:34,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:34,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253942698] [2019-10-22 09:01:34,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:34,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:34,321 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-10-22 09:01:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,692 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-10-22 09:01:34,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:34,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 09:01:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,694 INFO L225 Difference]: With dead ends: 493 [2019-10-22 09:01:34,694 INFO L226 Difference]: Without dead ends: 282 [2019-10-22 09:01:34,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-22 09:01:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-10-22 09:01:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 09:01:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-10-22 09:01:34,700 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-10-22 09:01:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,700 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-10-22 09:01:34,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-10-22 09:01:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 09:01:34,701 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,701 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:01:34,702 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-10-22 09:01:34,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27478461] [2019-10-22 09:01:34,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,747 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:01:34,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27478461] [2019-10-22 09:01:34,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:34,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567440576] [2019-10-22 09:01:34,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:34,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:34,748 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-10-22 09:01:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:35,031 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-10-22 09:01:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:35,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 09:01:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:35,032 INFO L225 Difference]: With dead ends: 466 [2019-10-22 09:01:35,032 INFO L226 Difference]: Without dead ends: 255 [2019-10-22 09:01:35,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-22 09:01:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-10-22 09:01:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 09:01:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-10-22 09:01:35,037 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-10-22 09:01:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,038 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-10-22 09:01:35,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-10-22 09:01:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:01:35,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,039 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:35,039 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-10-22 09:01:35,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:35,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266990703] [2019-10-22 09:01:35,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,088 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:01:35,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266990703] [2019-10-22 09:01:35,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:35,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:35,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69081549] [2019-10-22 09:01:35,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:35,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:35,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:35,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:35,089 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-10-22 09:01:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:35,428 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-10-22 09:01:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:35,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:01:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:35,429 INFO L225 Difference]: With dead ends: 492 [2019-10-22 09:01:35,430 INFO L226 Difference]: Without dead ends: 281 [2019-10-22 09:01:35,430 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:01:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-22 09:01:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-10-22 09:01:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 09:01:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-10-22 09:01:35,436 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-10-22 09:01:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,436 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-10-22 09:01:35,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-10-22 09:01:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:01:35,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,437 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:01:35,437 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-10-22 09:01:35,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:35,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179830232] [2019-10-22 09:01:35,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,489 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:01:35,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179830232] [2019-10-22 09:01:35,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:35,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:35,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014740967] [2019-10-22 09:01:35,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:35,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:35,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:35,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:35,490 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-10-22 09:01:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:35,844 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-10-22 09:01:35,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:35,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:01:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:35,845 INFO L225 Difference]: With dead ends: 490 [2019-10-22 09:01:35,845 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 09:01:35,846 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:01:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 09:01:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-10-22 09:01:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 09:01:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-10-22 09:01:35,852 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-10-22 09:01:35,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,852 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-10-22 09:01:35,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-10-22 09:01:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:01:35,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,853 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:01:35,853 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-10-22 09:01:35,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:35,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469295660] [2019-10-22 09:01:35,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,898 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:01:35,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469295660] [2019-10-22 09:01:35,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:35,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:35,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882778371] [2019-10-22 09:01:35,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:35,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:35,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:35,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:35,899 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-10-22 09:01:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:36,243 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-10-22 09:01:36,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:36,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:01:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:36,245 INFO L225 Difference]: With dead ends: 489 [2019-10-22 09:01:36,245 INFO L226 Difference]: Without dead ends: 278 [2019-10-22 09:01:36,245 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:01:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-22 09:01:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-10-22 09:01:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 09:01:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-10-22 09:01:36,251 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-10-22 09:01:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:36,251 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-10-22 09:01:36,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-10-22 09:01:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:01:36,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:36,252 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:36,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-10-22 09:01:36,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417876944] [2019-10-22 09:01:36,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,308 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:01:36,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417876944] [2019-10-22 09:01:36,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:36,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:36,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944317056] [2019-10-22 09:01:36,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:36,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:36,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:36,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:36,310 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-10-22 09:01:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:36,760 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-10-22 09:01:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:36,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-22 09:01:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:36,761 INFO L225 Difference]: With dead ends: 462 [2019-10-22 09:01:36,761 INFO L226 Difference]: Without dead ends: 251 [2019-10-22 09:01:36,762 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:01:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-22 09:01:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-10-22 09:01:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-10-22 09:01:36,768 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-10-22 09:01:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:36,768 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-10-22 09:01:36,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-10-22 09:01:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:01:36,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:36,769 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:01:36,769 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-10-22 09:01:36,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456110406] [2019-10-22 09:01:36,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,821 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:01:36,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456110406] [2019-10-22 09:01:36,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:36,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:36,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841973882] [2019-10-22 09:01:36,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:36,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:36,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:36,822 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-10-22 09:01:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,092 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-10-22 09:01:37,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:37,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:01:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,093 INFO L225 Difference]: With dead ends: 503 [2019-10-22 09:01:37,093 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 09:01:37,094 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:01:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 09:01:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-10-22 09:01:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-10-22 09:01:37,102 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-10-22 09:01:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,102 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-10-22 09:01:37,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-10-22 09:01:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 09:01:37,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,104 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:01:37,104 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-10-22 09:01:37,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:37,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001805952] [2019-10-22 09:01:37,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,158 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:01:37,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001805952] [2019-10-22 09:01:37,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:37,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:37,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73529164] [2019-10-22 09:01:37,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:37,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:37,159 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-10-22 09:01:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,422 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-10-22 09:01:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:37,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 09:01:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,424 INFO L225 Difference]: With dead ends: 502 [2019-10-22 09:01:37,424 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 09:01:37,424 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:01:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 09:01:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 09:01:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-10-22 09:01:37,431 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-10-22 09:01:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,431 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-10-22 09:01:37,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-10-22 09:01:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:01:37,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,432 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:01:37,432 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-10-22 09:01:37,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:37,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074376976] [2019-10-22 09:01:37,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,480 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:01:37,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074376976] [2019-10-22 09:01:37,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:37,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:37,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119130520] [2019-10-22 09:01:37,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:37,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:37,482 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-10-22 09:01:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,834 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-10-22 09:01:37,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:37,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 09:01:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,836 INFO L225 Difference]: With dead ends: 529 [2019-10-22 09:01:37,836 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 09:01:37,836 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:01:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 09:01:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-10-22 09:01:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-10-22 09:01:37,846 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-10-22 09:01:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:37,846 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-10-22 09:01:37,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-10-22 09:01:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:01:37,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:37,847 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:01:37,847 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-10-22 09:01:37,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:37,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329133909] [2019-10-22 09:01:37,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:37,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:37,894 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:01:37,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329133909] [2019-10-22 09:01:37,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:37,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:37,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071485380] [2019-10-22 09:01:37,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:37,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:37,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:37,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:37,898 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-10-22 09:01:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,187 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-10-22 09:01:38,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:38,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 09:01:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,189 INFO L225 Difference]: With dead ends: 502 [2019-10-22 09:01:38,189 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 09:01:38,189 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:01:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 09:01:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 09:01:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-10-22 09:01:38,196 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-10-22 09:01:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,197 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-10-22 09:01:38,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-10-22 09:01:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:01:38,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,198 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:38,198 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-10-22 09:01:38,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:38,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794957335] [2019-10-22 09:01:38,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,260 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:01:38,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794957335] [2019-10-22 09:01:38,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:38,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:38,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146589034] [2019-10-22 09:01:38,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:38,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:38,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:38,262 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-10-22 09:01:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,573 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-10-22 09:01:38,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:38,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 09:01:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,575 INFO L225 Difference]: With dead ends: 529 [2019-10-22 09:01:38,575 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 09:01:38,575 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:01:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 09:01:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-10-22 09:01:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-10-22 09:01:38,582 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-10-22 09:01:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,583 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-10-22 09:01:38,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-10-22 09:01:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:01:38,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,584 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:38,584 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-10-22 09:01:38,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:38,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343261990] [2019-10-22 09:01:38,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,648 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:01:38,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343261990] [2019-10-22 09:01:38,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:38,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:38,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325022050] [2019-10-22 09:01:38,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:38,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:38,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:38,650 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-10-22 09:01:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,881 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-10-22 09:01:38,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:38,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 09:01:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,883 INFO L225 Difference]: With dead ends: 502 [2019-10-22 09:01:38,883 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 09:01:38,883 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:01:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 09:01:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 09:01:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-10-22 09:01:38,890 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-10-22 09:01:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,891 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-10-22 09:01:38,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-10-22 09:01:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:01:38,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,891 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:38,892 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-10-22 09:01:38,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:38,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311637406] [2019-10-22 09:01:38,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,936 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:01:38,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311637406] [2019-10-22 09:01:38,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:38,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:38,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820388600] [2019-10-22 09:01:38,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:38,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:38,937 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-10-22 09:01:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:39,305 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-10-22 09:01:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:39,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 09:01:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:39,306 INFO L225 Difference]: With dead ends: 529 [2019-10-22 09:01:39,306 INFO L226 Difference]: Without dead ends: 298 [2019-10-22 09:01:39,307 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:01:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-22 09:01:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-10-22 09:01:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-10-22 09:01:39,314 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-10-22 09:01:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:39,315 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-10-22 09:01:39,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-10-22 09:01:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:01:39,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,316 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,316 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:39,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,316 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-10-22 09:01:39,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224900028] [2019-10-22 09:01:39,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,378 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:01:39,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224900028] [2019-10-22 09:01:39,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:39,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:39,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750656707] [2019-10-22 09:01:39,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:39,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:39,380 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-10-22 09:01:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:39,707 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-10-22 09:01:39,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:39,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 09:01:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:39,709 INFO L225 Difference]: With dead ends: 502 [2019-10-22 09:01:39,709 INFO L226 Difference]: Without dead ends: 271 [2019-10-22 09:01:39,709 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:01:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-22 09:01:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-10-22 09:01:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-10-22 09:01:39,716 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-10-22 09:01:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:39,716 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-10-22 09:01:39,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-10-22 09:01:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:01:39,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,717 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:39,717 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-10-22 09:01:39,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272114750] [2019-10-22 09:01:39,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,771 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:01:39,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272114750] [2019-10-22 09:01:39,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:39,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:39,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445625644] [2019-10-22 09:01:39,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:39,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:39,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:39,773 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-10-22 09:01:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,070 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-10-22 09:01:40,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:40,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 09:01:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,071 INFO L225 Difference]: With dead ends: 519 [2019-10-22 09:01:40,071 INFO L226 Difference]: Without dead ends: 288 [2019-10-22 09:01:40,072 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:01:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-22 09:01:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-10-22 09:01:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-10-22 09:01:40,078 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-10-22 09:01:40,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,079 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-10-22 09:01:40,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-10-22 09:01:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:01:40,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,080 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:40,080 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-10-22 09:01:40,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106764597] [2019-10-22 09:01:40,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,133 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:01:40,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106764597] [2019-10-22 09:01:40,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:40,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220835941] [2019-10-22 09:01:40,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:40,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:40,134 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-10-22 09:01:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,370 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-10-22 09:01:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:40,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 09:01:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,371 INFO L225 Difference]: With dead ends: 492 [2019-10-22 09:01:40,371 INFO L226 Difference]: Without dead ends: 261 [2019-10-22 09:01:40,372 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:01:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-22 09:01:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-10-22 09:01:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-10-22 09:01:40,378 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-10-22 09:01:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,378 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-10-22 09:01:40,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-10-22 09:01:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:01:40,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,379 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:01:40,379 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,380 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-10-22 09:01:40,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858284337] [2019-10-22 09:01:40,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,433 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:01:40,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858284337] [2019-10-22 09:01:40,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:40,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371278661] [2019-10-22 09:01:40,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:40,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:40,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:40,435 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-10-22 09:01:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,799 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-10-22 09:01:40,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:40,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 09:01:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,801 INFO L225 Difference]: With dead ends: 519 [2019-10-22 09:01:40,801 INFO L226 Difference]: Without dead ends: 288 [2019-10-22 09:01:40,801 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-22 09:01:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-10-22 09:01:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 09:01:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-10-22 09:01:40,808 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-10-22 09:01:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,809 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-10-22 09:01:40,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-10-22 09:01:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:01:40,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,810 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:01:40,810 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-10-22 09:01:40,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291903909] [2019-10-22 09:01:40,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,863 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:01:40,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291903909] [2019-10-22 09:01:40,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:40,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702200365] [2019-10-22 09:01:40,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:40,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:40,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:40,865 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-10-22 09:01:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,893 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-10-22 09:01:40,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:40,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 09:01:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,895 INFO L225 Difference]: With dead ends: 710 [2019-10-22 09:01:40,895 INFO L226 Difference]: Without dead ends: 479 [2019-10-22 09:01:40,896 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:01:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-22 09:01:40,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-10-22 09:01:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-22 09:01:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-10-22 09:01:40,907 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-10-22 09:01:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,907 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-10-22 09:01:40,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-10-22 09:01:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 09:01:40,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,909 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:01:40,909 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-10-22 09:01:40,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601044314] [2019-10-22 09:01:40,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,153 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:41,153 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:01:41,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:41 BoogieIcfgContainer [2019-10-22 09:01:41,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:41,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:41,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:41,278 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:41,278 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:26" (3/4) ... [2019-10-22 09:01:41,282 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:01:41,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:41,286 INFO L168 Benchmark]: Toolchain (without parser) took 16429.98 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,287 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:41,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.58 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.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,288 INFO L168 Benchmark]: Boogie Preprocessor took 104.20 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:01:41,289 INFO L168 Benchmark]: RCFGBuilder took 990.41 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: 95.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,289 INFO L168 Benchmark]: TraceAbstraction took 14524.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.2 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,289 INFO L168 Benchmark]: Witness Printer took 6.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:41,291 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -198.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.58 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.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.20 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 990.41 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: 95.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14524.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 265.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.2 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.40 ms. Allocated memory is still 1.5 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: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 9993 SDs, 0 SdLazy, 6809 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 84 SyntacticMatches, 33 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 741519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:43,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:43,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:43,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:43,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:43,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:43,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:43,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:43,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:43,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:43,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:43,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:43,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:43,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:43,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:43,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:43,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:43,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:43,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:43,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:43,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:43,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:43,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:43,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:43,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:43,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:43,405 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:43,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:43,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:43,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:43,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:43,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:43,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:43,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:43,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:43,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:43,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:43,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:43,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:43,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:43,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:43,413 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 09:01:43,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:43,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:43,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:43,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:43,432 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:43,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:43,433 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 09:01:43,434 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 09:01:43,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:43,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:43,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:43,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:43,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:43,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:43,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:43,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:43,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:43,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:43,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:43,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:43,437 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 09:01:43,437 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 09:01:43,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:43,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 09:01:43,438 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_38aab8fc-a140-4d1e-ad71-79b045460ec3/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 -> 1c80528d715feba546d9b9f6f7af7c865965b863 [2019-10-22 09:01:43,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:43,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:43,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:43,490 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:43,490 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:43,491 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 09:01:43,542 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/e47b07351/0771afafb5a5419196742db41e7e2bb2/FLAGe85b2acbf [2019-10-22 09:01:44,102 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:44,102 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-10-22 09:01:44,123 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/e47b07351/0771afafb5a5419196742db41e7e2bb2/FLAGe85b2acbf [2019-10-22 09:01:44,563 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/data/e47b07351/0771afafb5a5419196742db41e7e2bb2 [2019-10-22 09:01:44,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:44,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:44,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:44,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:44,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:44,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1044226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:44, skipping insertion in model container [2019-10-22 09:01:44,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:44" (1/1) ... [2019-10-22 09:01:44,583 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:44,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:45,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:45,179 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:45,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:45,315 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:45,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45 WrapperNode [2019-10-22 09:01:45,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:45,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:45,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:45,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:45,325 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:01:45" (1/1) ... [2019-10-22 09:01:45,356 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:01:45" (1/1) ... [2019-10-22 09:01:45,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:45,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:45,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:45,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:45,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... [2019-10-22 09:01:45,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:45,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:45,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:45,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:45,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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:01:45,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:01:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 09:01:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:01:45,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:01:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:45,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:45,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 09:01:45,767 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:01:48,199 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 09:01:48,199 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 09:01:48,200 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:48,200 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:48,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:48 BoogieIcfgContainer [2019-10-22 09:01:48,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:48,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:48,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:48,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:48,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:44" (1/3) ... [2019-10-22 09:01:48,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c90875c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:48, skipping insertion in model container [2019-10-22 09:01:48,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:45" (2/3) ... [2019-10-22 09:01:48,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c90875c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:48, skipping insertion in model container [2019-10-22 09:01:48,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:48" (3/3) ... [2019-10-22 09:01:48,209 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-10-22 09:01:48,219 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:48,228 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:48,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:48,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:48,263 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:48,263 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:48,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:48,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:48,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:48,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:48,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-10-22 09:01:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:01:48,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,289 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:01:48,291 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,296 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-10-22 09:01:48,307 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:48,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1006995623] [2019-10-22 09:01:48,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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:01:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:48,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:48,552 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:01:48,552 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:48,577 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:01:48,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1006995623] [2019-10-22 09:01:48,578 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:48,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:48,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893312923] [2019-10-22 09:01:48,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:48,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:48,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:48,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:48,598 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-10-22 09:01:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,706 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-10-22 09:01:48,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:48,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 09:01:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:48,721 INFO L225 Difference]: With dead ends: 540 [2019-10-22 09:01:48,722 INFO L226 Difference]: Without dead ends: 366 [2019-10-22 09:01:48,725 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:01:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-22 09:01:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-10-22 09:01:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-22 09:01:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-10-22 09:01:48,795 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-10-22 09:01:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:48,795 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-10-22 09:01:48,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-10-22 09:01:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 09:01:48,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,802 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:49,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:49,003 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-10-22 09:01:49,005 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:49,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1397635251] [2019-10-22 09:01:49,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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:01:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:49,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,288 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 09:01:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1397635251] [2019-10-22 09:01:49,325 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:49,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 09:01:49,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657570053] [2019-10-22 09:01:49,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:49,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 09:01:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:49,329 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-10-22 09:01:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:49,597 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-10-22 09:01:49,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:49,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 09:01:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:49,601 INFO L225 Difference]: With dead ends: 839 [2019-10-22 09:01:49,601 INFO L226 Difference]: Without dead ends: 600 [2019-10-22 09:01:49,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-22 09:01:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-22 09:01:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-22 09:01:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-10-22 09:01:49,659 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-10-22 09:01:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:49,660 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-10-22 09:01:49,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-10-22 09:01:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 09:01:49,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:49,669 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:01:49,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:49,871 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-10-22 09:01:49,872 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 09:01:49,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [96899062] [2019-10-22 09:01:49,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/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:01:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,081 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-10-22 09:01:52,081 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:01:52,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 09:01:52,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:52 BoogieIcfgContainer [2019-10-22 09:01:52,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:52,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:52,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:52,407 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:52,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:48" (3/4) ... [2019-10-22 09:01:52,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:01:52,508 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_38aab8fc-a140-4d1e-ad71-79b045460ec3/bin/uautomizer/witness.graphml [2019-10-22 09:01:52,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:52,510 INFO L168 Benchmark]: Toolchain (without parser) took 7942.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,511 INFO L168 Benchmark]: CDTParser took 0.18 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:01:52,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.60 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,511 INFO L168 Benchmark]: Boogie Preprocessor took 87.82 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,511 INFO L168 Benchmark]: RCFGBuilder took 2699.31 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.4 MB). Peak memory consumption was 91.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,512 INFO L168 Benchmark]: TraceAbstraction took 4202.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -133.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:52,512 INFO L168 Benchmark]: Witness Printer took 102.61 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: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,513 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.18 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 747.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.60 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.82 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2699.31 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.4 MB). Peak memory consumption was 91.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4202.94 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -133.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 102.61 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: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...