./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 bf0d0cf8dda9e68b67ebf00ec54daecd196b7f63 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 bf0d0cf8dda9e68b67ebf00ec54daecd196b7f63 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 08:58:41,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:41,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:41,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:41,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:41,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:41,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:41,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:41,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:41,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:41,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:41,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:41,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:41,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:41,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:41,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:41,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:41,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:41,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:41,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:41,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:41,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:41,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:41,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:41,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:41,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:41,061 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:41,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:41,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:41,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:41,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:41,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:41,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:41,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:41,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:41,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:41,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:41,066 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:41,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:41,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:41,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:41,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:41,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:41,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:41,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:41,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:41,085 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:41,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:41,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:41,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:41,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:41,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:41,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:41,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:41,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:41,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:41,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:41,090 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:41,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:41,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:41,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:41,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:41,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:41,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:41,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:41,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:41,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:41,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:41,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:41,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:41,092 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_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 -> bf0d0cf8dda9e68b67ebf00ec54daecd196b7f63 [2019-10-22 08:58:41,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:41,135 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:41,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:41,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:41,139 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:41,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-10-22 08:58:41,187 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/97957d3a9/ca44a27959894797af8b3ba988189313/FLAGa63d9f6ca [2019-10-22 08:58:41,694 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:41,696 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-10-22 08:58:41,716 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/97957d3a9/ca44a27959894797af8b3ba988189313/FLAGa63d9f6ca [2019-10-22 08:58:41,970 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/97957d3a9/ca44a27959894797af8b3ba988189313 [2019-10-22 08:58:41,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:41,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:41,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:41,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:41,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:41,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:41" (1/1) ... [2019-10-22 08:58:41,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd37f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:41, skipping insertion in model container [2019-10-22 08:58:41,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:41" (1/1) ... [2019-10-22 08:58:41,987 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:42,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:42,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:42,511 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:42,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:42,661 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:42,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42 WrapperNode [2019-10-22 08:58:42,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:42,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:42,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:42,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:42,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:42,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:42,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:42,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:42,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... [2019-10-22 08:58:42,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:42,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:42,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:42,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:42,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 08:58:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:58:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:42,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:58:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:42,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:42,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:43,080 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:43,846 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 08:58:43,847 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 08:58:43,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:43,849 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:43,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:43 BoogieIcfgContainer [2019-10-22 08:58:43,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:43,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:43,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:43,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:43,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:41" (1/3) ... [2019-10-22 08:58:43,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc17232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:43, skipping insertion in model container [2019-10-22 08:58:43,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:42" (2/3) ... [2019-10-22 08:58:43,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc17232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:43, skipping insertion in model container [2019-10-22 08:58:43,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:43" (3/3) ... [2019-10-22 08:58:43,863 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-10-22 08:58:43,875 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:43,889 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:58:43,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:58:43,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:43,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:43,926 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:43,926 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:43,926 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:43,926 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:43,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:43,927 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-10-22 08:58:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:58:43,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:43,956 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 08:58:43,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:43,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:43,963 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-10-22 08:58:43,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:43,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262825498] [2019-10-22 08:58:43,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:43,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:44,294 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 08:58:44,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262825498] [2019-10-22 08:58:44,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:44,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:44,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019615190] [2019-10-22 08:58:44,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:44,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:44,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:44,317 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-10-22 08:58:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:44,763 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-10-22 08:58:44,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:44,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 08:58:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:44,778 INFO L225 Difference]: With dead ends: 313 [2019-10-22 08:58:44,778 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 08:58:44,784 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 08:58:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 08:58:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-10-22 08:58:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-10-22 08:58:44,826 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-10-22 08:58:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:44,826 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-10-22 08:58:44,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-10-22 08:58:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-22 08:58:44,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:44,829 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 08:58:44,829 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-10-22 08:58:44,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:44,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891855655] [2019-10-22 08:58:44,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:44,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:44,951 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 08:58:44,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891855655] [2019-10-22 08:58:44,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:44,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:44,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286549868] [2019-10-22 08:58:44,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:44,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:44,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:44,956 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-10-22 08:58:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:45,258 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-10-22 08:58:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:45,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-22 08:58:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:45,260 INFO L225 Difference]: With dead ends: 280 [2019-10-22 08:58:45,260 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 08:58:45,261 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 08:58:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 08:58:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-10-22 08:58:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-10-22 08:58:45,270 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-10-22 08:58:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:45,270 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-10-22 08:58:45,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-10-22 08:58:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:58:45,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:45,272 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 08:58:45,273 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-10-22 08:58:45,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792898227] [2019-10-22 08:58:45,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:45,331 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 08:58:45,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792898227] [2019-10-22 08:58:45,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:45,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:45,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829443085] [2019-10-22 08:58:45,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:45,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:45,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:45,333 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-10-22 08:58:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:45,632 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-10-22 08:58:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:45,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 08:58:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:45,634 INFO L225 Difference]: With dead ends: 279 [2019-10-22 08:58:45,634 INFO L226 Difference]: Without dead ends: 157 [2019-10-22 08:58:45,635 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 08:58:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-22 08:58:45,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-10-22 08:58:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-10-22 08:58:45,644 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-10-22 08:58:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:45,648 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-10-22 08:58:45,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-10-22 08:58:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:58:45,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:45,650 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 08:58:45,650 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-10-22 08:58:45,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66944043] [2019-10-22 08:58:45,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:45,774 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 08:58:45,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66944043] [2019-10-22 08:58:45,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:45,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:45,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425032405] [2019-10-22 08:58:45,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:45,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:45,777 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-10-22 08:58:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:46,084 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-10-22 08:58:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:46,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 08:58:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:46,086 INFO L225 Difference]: With dead ends: 277 [2019-10-22 08:58:46,086 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 08:58:46,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 08:58:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-10-22 08:58:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-10-22 08:58:46,094 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-10-22 08:58:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:46,094 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-10-22 08:58:46,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-10-22 08:58:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:58:46,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:46,096 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 08:58:46,096 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-10-22 08:58:46,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803183419] [2019-10-22 08:58:46,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:46,148 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 08:58:46,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803183419] [2019-10-22 08:58:46,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:46,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:46,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532714923] [2019-10-22 08:58:46,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:46,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:46,150 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-10-22 08:58:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:46,406 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-10-22 08:58:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:46,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 08:58:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:46,408 INFO L225 Difference]: With dead ends: 276 [2019-10-22 08:58:46,408 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 08:58:46,408 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 08:58:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 08:58:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 08:58:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-10-22 08:58:46,414 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-10-22 08:58:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:46,415 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-10-22 08:58:46,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-10-22 08:58:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 08:58:46,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:46,416 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 08:58:46,417 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-10-22 08:58:46,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380659494] [2019-10-22 08:58:46,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:46,491 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 08:58:46,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380659494] [2019-10-22 08:58:46,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:46,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:46,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440946075] [2019-10-22 08:58:46,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:46,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:46,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:46,492 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-10-22 08:58:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:46,744 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-10-22 08:58:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:46,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 08:58:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:46,745 INFO L225 Difference]: With dead ends: 276 [2019-10-22 08:58:46,745 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 08:58:46,746 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 08:58:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 08:58:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 08:58:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-10-22 08:58:46,752 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-10-22 08:58:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:46,752 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-10-22 08:58:46,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-10-22 08:58:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-22 08:58:46,753 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:46,753 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 08:58:46,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-10-22 08:58:46,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:46,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469405121] [2019-10-22 08:58:46,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,754 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:46,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:46,797 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 08:58:46,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469405121] [2019-10-22 08:58:46,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:46,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:46,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817556816] [2019-10-22 08:58:46,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:46,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:46,798 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-10-22 08:58:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,008 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-10-22 08:58:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:47,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-22 08:58:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:47,009 INFO L225 Difference]: With dead ends: 276 [2019-10-22 08:58:47,009 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 08:58:47,009 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 08:58:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 08:58:47,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 08:58:47,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-10-22 08:58:47,014 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-10-22 08:58:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:47,014 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-10-22 08:58:47,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-10-22 08:58:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 08:58:47,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:47,016 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 08:58:47,016 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,016 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-10-22 08:58:47,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004279113] [2019-10-22 08:58:47,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,082 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 08:58:47,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004279113] [2019-10-22 08:58:47,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:47,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:47,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508979970] [2019-10-22 08:58:47,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:47,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:47,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:47,084 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-10-22 08:58:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,329 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-10-22 08:58:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:47,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 08:58:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:47,330 INFO L225 Difference]: With dead ends: 276 [2019-10-22 08:58:47,331 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 08:58:47,331 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 08:58:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 08:58:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-10-22 08:58:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-10-22 08:58:47,337 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-10-22 08:58:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:47,337 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-10-22 08:58:47,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-10-22 08:58:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 08:58:47,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:47,339 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 08:58:47,340 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-10-22 08:58:47,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632025414] [2019-10-22 08:58:47,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,404 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 08:58:47,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632025414] [2019-10-22 08:58:47,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:47,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:47,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378769895] [2019-10-22 08:58:47,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:47,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:47,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:47,406 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-10-22 08:58:47,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,620 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-10-22 08:58:47,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:47,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 08:58:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:47,621 INFO L225 Difference]: With dead ends: 266 [2019-10-22 08:58:47,621 INFO L226 Difference]: Without dead ends: 144 [2019-10-22 08:58:47,622 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 08:58:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-22 08:58:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-10-22 08:58:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-22 08:58:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-10-22 08:58:47,625 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-10-22 08:58:47,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:47,626 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-10-22 08:58:47,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-10-22 08:58:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-22 08:58:47,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:47,626 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 08:58:47,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:47,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-10-22 08:58:47,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618478522] [2019-10-22 08:58:47,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,692 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 08:58:47,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618478522] [2019-10-22 08:58:47,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:47,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:47,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662433608] [2019-10-22 08:58:47,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:47,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:47,693 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-10-22 08:58:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,958 INFO L93 Difference]: Finished difference Result 307 states and 462 transitions. [2019-10-22 08:58:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:47,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-22 08:58:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:47,959 INFO L225 Difference]: With dead ends: 307 [2019-10-22 08:58:47,960 INFO L226 Difference]: Without dead ends: 185 [2019-10-22 08:58:47,960 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 08:58:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-22 08:58:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-10-22 08:58:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-10-22 08:58:47,964 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-10-22 08:58:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:47,965 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-10-22 08:58:47,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-10-22 08:58:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-22 08:58:47,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:47,966 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 08:58:47,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-10-22 08:58:47,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104802866] [2019-10-22 08:58:47,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:48,020 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 08:58:48,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104802866] [2019-10-22 08:58:48,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:48,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:48,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410995224] [2019-10-22 08:58:48,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:48,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:48,022 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-10-22 08:58:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:48,314 INFO L93 Difference]: Finished difference Result 329 states and 499 transitions. [2019-10-22 08:58:48,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:48,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-10-22 08:58:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:48,316 INFO L225 Difference]: With dead ends: 329 [2019-10-22 08:58:48,316 INFO L226 Difference]: Without dead ends: 185 [2019-10-22 08:58:48,316 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 08:58:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-22 08:58:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 163. [2019-10-22 08:58:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-10-22 08:58:48,322 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-10-22 08:58:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:48,322 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-10-22 08:58:48,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-10-22 08:58:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 08:58:48,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:48,324 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 08:58:48,324 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-10-22 08:58:48,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:48,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164704002] [2019-10-22 08:58:48,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:48,375 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 08:58:48,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164704002] [2019-10-22 08:58:48,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:48,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:48,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833084708] [2019-10-22 08:58:48,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:48,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:48,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:48,377 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-10-22 08:58:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:48,654 INFO L93 Difference]: Finished difference Result 328 states and 496 transitions. [2019-10-22 08:58:48,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:48,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 08:58:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:48,656 INFO L225 Difference]: With dead ends: 328 [2019-10-22 08:58:48,656 INFO L226 Difference]: Without dead ends: 184 [2019-10-22 08:58:48,656 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 08:58:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-22 08:58:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-10-22 08:58:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-10-22 08:58:48,660 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-10-22 08:58:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:48,661 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-10-22 08:58:48,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-10-22 08:58:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 08:58:48,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:48,661 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 08:58:48,662 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:48,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-10-22 08:58:48,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:48,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222743684] [2019-10-22 08:58:48,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:48,705 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 08:58:48,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222743684] [2019-10-22 08:58:48,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:48,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:48,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854828942] [2019-10-22 08:58:48,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:48,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:48,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:48,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:48,707 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-10-22 08:58:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:48,962 INFO L93 Difference]: Finished difference Result 326 states and 492 transitions. [2019-10-22 08:58:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:48,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 08:58:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:48,963 INFO L225 Difference]: With dead ends: 326 [2019-10-22 08:58:48,963 INFO L226 Difference]: Without dead ends: 182 [2019-10-22 08:58:48,964 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 08:58:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-22 08:58:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2019-10-22 08:58:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-10-22 08:58:48,968 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-10-22 08:58:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:48,969 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-10-22 08:58:48,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-10-22 08:58:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 08:58:48,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:48,970 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 08:58:48,970 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-10-22 08:58:48,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:48,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960651793] [2019-10-22 08:58:48,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:48,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:49,016 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 08:58:49,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960651793] [2019-10-22 08:58:49,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:49,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:49,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877126393] [2019-10-22 08:58:49,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:49,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:49,019 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-10-22 08:58:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:49,278 INFO L93 Difference]: Finished difference Result 325 states and 489 transitions. [2019-10-22 08:58:49,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:49,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 08:58:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:49,280 INFO L225 Difference]: With dead ends: 325 [2019-10-22 08:58:49,280 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 08:58:49,280 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 08:58:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 08:58:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-10-22 08:58:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-10-22 08:58:49,285 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-10-22 08:58:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:49,285 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-10-22 08:58:49,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-10-22 08:58:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-22 08:58:49,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:49,286 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 08:58:49,286 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:49,286 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-10-22 08:58:49,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:49,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182664166] [2019-10-22 08:58:49,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:49,332 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 08:58:49,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182664166] [2019-10-22 08:58:49,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:49,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:49,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539911878] [2019-10-22 08:58:49,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:49,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:49,333 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-10-22 08:58:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:49,605 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-10-22 08:58:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:49,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-22 08:58:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:49,606 INFO L225 Difference]: With dead ends: 325 [2019-10-22 08:58:49,606 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 08:58:49,607 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 08:58:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 08:58:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-10-22 08:58:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-10-22 08:58:49,611 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-10-22 08:58:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:49,612 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-10-22 08:58:49,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-10-22 08:58:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-22 08:58:49,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:49,613 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 08:58:49,613 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-10-22 08:58:49,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:49,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850024409] [2019-10-22 08:58:49,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:49,647 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 08:58:49,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850024409] [2019-10-22 08:58:49,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:49,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:49,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366700714] [2019-10-22 08:58:49,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:49,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:49,649 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-10-22 08:58:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:49,901 INFO L93 Difference]: Finished difference Result 325 states and 485 transitions. [2019-10-22 08:58:49,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:49,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-22 08:58:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:49,902 INFO L225 Difference]: With dead ends: 325 [2019-10-22 08:58:49,902 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 08:58:49,903 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 08:58:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 08:58:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-10-22 08:58:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-10-22 08:58:49,906 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-10-22 08:58:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:49,907 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-10-22 08:58:49,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-10-22 08:58:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-22 08:58:49,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:49,908 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 08:58:49,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:49,908 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-10-22 08:58:49,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:49,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649953308] [2019-10-22 08:58:49,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:49,942 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 08:58:49,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649953308] [2019-10-22 08:58:49,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:49,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:49,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189838419] [2019-10-22 08:58:49,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:49,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:49,943 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-10-22 08:58:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:50,190 INFO L93 Difference]: Finished difference Result 325 states and 483 transitions. [2019-10-22 08:58:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:50,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-22 08:58:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:50,191 INFO L225 Difference]: With dead ends: 325 [2019-10-22 08:58:50,191 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 08:58:50,192 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 08:58:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 08:58:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-10-22 08:58:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-10-22 08:58:50,196 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-10-22 08:58:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:50,196 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-10-22 08:58:50,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-10-22 08:58:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-22 08:58:50,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:50,198 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 08:58:50,198 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-10-22 08:58:50,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:50,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511056980] [2019-10-22 08:58:50,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:50,250 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 08:58:50,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511056980] [2019-10-22 08:58:50,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:50,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:50,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066739857] [2019-10-22 08:58:50,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:50,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:50,252 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-10-22 08:58:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:50,485 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-10-22 08:58:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:50,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-22 08:58:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:50,486 INFO L225 Difference]: With dead ends: 315 [2019-10-22 08:58:50,486 INFO L226 Difference]: Without dead ends: 171 [2019-10-22 08:58:50,487 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 08:58:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-22 08:58:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2019-10-22 08:58:50,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-22 08:58:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-10-22 08:58:50,490 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-10-22 08:58:50,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:50,490 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-10-22 08:58:50,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-10-22 08:58:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:50,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:50,492 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 08:58:50,492 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:50,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:50,492 INFO L82 PathProgramCache]: Analyzing trace with hash 719124867, now seen corresponding path program 1 times [2019-10-22 08:58:50,492 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:50,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021161509] [2019-10-22 08:58:50,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:50,552 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 08:58:50,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021161509] [2019-10-22 08:58:50,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:50,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:50,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942783859] [2019-10-22 08:58:50,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:50,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:50,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:50,553 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-10-22 08:58:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:50,896 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-10-22 08:58:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:50,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 08:58:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:50,898 INFO L225 Difference]: With dead ends: 403 [2019-10-22 08:58:50,898 INFO L226 Difference]: Without dead ends: 259 [2019-10-22 08:58:50,898 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 08:58:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-22 08:58:50,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-10-22 08:58:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 08:58:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-10-22 08:58:50,906 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-10-22 08:58:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:50,906 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-10-22 08:58:50,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:50,906 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-10-22 08:58:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:50,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:50,907 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 08:58:50,907 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:50,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:50,908 INFO L82 PathProgramCache]: Analyzing trace with hash -178268411, now seen corresponding path program 1 times [2019-10-22 08:58:50,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:50,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993073372] [2019-10-22 08:58:50,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:50,978 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 08:58:50,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993073372] [2019-10-22 08:58:50,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:50,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:50,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104578158] [2019-10-22 08:58:50,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:50,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:50,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:50,980 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-10-22 08:58:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:51,304 INFO L93 Difference]: Finished difference Result 443 states and 687 transitions. [2019-10-22 08:58:51,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:51,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-22 08:58:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:51,305 INFO L225 Difference]: With dead ends: 443 [2019-10-22 08:58:51,305 INFO L226 Difference]: Without dead ends: 256 [2019-10-22 08:58:51,306 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 08:58:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-22 08:58:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-10-22 08:58:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 08:58:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-10-22 08:58:51,311 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-10-22 08:58:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:51,311 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-10-22 08:58:51,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-10-22 08:58:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:58:51,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:51,313 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 08:58:51,313 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2081210466, now seen corresponding path program 1 times [2019-10-22 08:58:51,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:51,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956647287] [2019-10-22 08:58:51,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:51,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:51,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:51,366 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 08:58:51,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956647287] [2019-10-22 08:58:51,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:51,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:51,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687709464] [2019-10-22 08:58:51,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:51,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:51,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:51,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:51,368 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-10-22 08:58:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:51,669 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-10-22 08:58:51,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:51,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 08:58:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:51,670 INFO L225 Difference]: With dead ends: 494 [2019-10-22 08:58:51,671 INFO L226 Difference]: Without dead ends: 283 [2019-10-22 08:58:51,671 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 08:58:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-22 08:58:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-10-22 08:58:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 08:58:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-10-22 08:58:51,676 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-10-22 08:58:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:51,676 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-10-22 08:58:51,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-10-22 08:58:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:58:51,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:51,677 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 08:58:51,677 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:51,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:51,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2121885216, now seen corresponding path program 1 times [2019-10-22 08:58:51,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:51,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971210490] [2019-10-22 08:58:51,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:51,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:51,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:51,725 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 08:58:51,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971210490] [2019-10-22 08:58:51,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:51,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:51,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58477035] [2019-10-22 08:58:51,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:51,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:51,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:51,726 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-10-22 08:58:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:52,002 INFO L93 Difference]: Finished difference Result 467 states and 726 transitions. [2019-10-22 08:58:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:52,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 08:58:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:52,004 INFO L225 Difference]: With dead ends: 467 [2019-10-22 08:58:52,004 INFO L226 Difference]: Without dead ends: 256 [2019-10-22 08:58:52,004 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 08:58:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-22 08:58:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 230. [2019-10-22 08:58:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 08:58:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-10-22 08:58:52,009 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-10-22 08:58:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:52,009 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-10-22 08:58:52,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-10-22 08:58:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:52,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:52,010 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 08:58:52,010 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -314494398, now seen corresponding path program 1 times [2019-10-22 08:58:52,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399684047] [2019-10-22 08:58:52,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:52,054 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 08:58:52,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399684047] [2019-10-22 08:58:52,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:52,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:52,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807643820] [2019-10-22 08:58:52,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:52,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:52,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:52,055 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-10-22 08:58:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:52,349 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-10-22 08:58:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:52,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 08:58:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:52,350 INFO L225 Difference]: With dead ends: 493 [2019-10-22 08:58:52,350 INFO L226 Difference]: Without dead ends: 282 [2019-10-22 08:58:52,351 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 08:58:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-22 08:58:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-10-22 08:58:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 08:58:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-10-22 08:58:52,355 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-10-22 08:58:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:52,356 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-10-22 08:58:52,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-10-22 08:58:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:52,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:52,356 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 08:58:52,357 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1028699053, now seen corresponding path program 1 times [2019-10-22 08:58:52,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368781335] [2019-10-22 08:58:52,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:52,413 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 08:58:52,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368781335] [2019-10-22 08:58:52,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:52,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:52,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984584020] [2019-10-22 08:58:52,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:52,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:52,415 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-10-22 08:58:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:52,746 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-10-22 08:58:52,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:52,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 08:58:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:52,747 INFO L225 Difference]: With dead ends: 491 [2019-10-22 08:58:52,747 INFO L226 Difference]: Without dead ends: 280 [2019-10-22 08:58:52,748 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 08:58:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-10-22 08:58:52,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-10-22 08:58:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 08:58:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-10-22 08:58:52,753 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-10-22 08:58:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:52,753 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-10-22 08:58:52,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-10-22 08:58:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:52,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:52,754 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 08:58:52,754 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:52,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1978047213, now seen corresponding path program 1 times [2019-10-22 08:58:52,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717366748] [2019-10-22 08:58:52,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:52,799 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 08:58:52,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717366748] [2019-10-22 08:58:52,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:52,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:52,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432112043] [2019-10-22 08:58:52,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:52,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:52,801 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-10-22 08:58:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:53,141 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-10-22 08:58:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:53,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 08:58:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:53,143 INFO L225 Difference]: With dead ends: 490 [2019-10-22 08:58:53,143 INFO L226 Difference]: Without dead ends: 279 [2019-10-22 08:58:53,143 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 08:58:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-22 08:58:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-10-22 08:58:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-22 08:58:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-10-22 08:58:53,147 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-10-22 08:58:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:53,148 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-10-22 08:58:53,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-10-22 08:58:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:53,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:53,149 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 08:58:53,149 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash 523516374, now seen corresponding path program 1 times [2019-10-22 08:58:53,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138853762] [2019-10-22 08:58:53,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:53,216 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 08:58:53,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138853762] [2019-10-22 08:58:53,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:53,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:53,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275707458] [2019-10-22 08:58:53,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:53,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:53,218 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-10-22 08:58:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:53,594 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-10-22 08:58:53,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:53,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-22 08:58:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:53,596 INFO L225 Difference]: With dead ends: 462 [2019-10-22 08:58:53,596 INFO L226 Difference]: Without dead ends: 251 [2019-10-22 08:58:53,596 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 08:58:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-22 08:58:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-10-22 08:58:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-10-22 08:58:53,601 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-10-22 08:58:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:53,601 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-10-22 08:58:53,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-10-22 08:58:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:53,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:53,602 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 08:58:53,602 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2005350993, now seen corresponding path program 1 times [2019-10-22 08:58:53,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949556788] [2019-10-22 08:58:53,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:53,650 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 08:58:53,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949556788] [2019-10-22 08:58:53,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:53,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:53,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733930388] [2019-10-22 08:58:53,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:53,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:53,652 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-10-22 08:58:53,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:53,949 INFO L93 Difference]: Finished difference Result 504 states and 766 transitions. [2019-10-22 08:58:53,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:53,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 08:58:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:53,950 INFO L225 Difference]: With dead ends: 504 [2019-10-22 08:58:53,950 INFO L226 Difference]: Without dead ends: 273 [2019-10-22 08:58:53,951 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 08:58:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-22 08:58:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 250. [2019-10-22 08:58:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-10-22 08:58:53,956 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-10-22 08:58:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:53,956 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-10-22 08:58:53,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-10-22 08:58:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 08:58:53,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:53,957 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 08:58:53,958 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1056002833, now seen corresponding path program 1 times [2019-10-22 08:58:53,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88663622] [2019-10-22 08:58:53,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,013 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 08:58:54,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88663622] [2019-10-22 08:58:54,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:54,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:54,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180399691] [2019-10-22 08:58:54,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:54,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:54,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:54,015 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-10-22 08:58:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:54,267 INFO L93 Difference]: Finished difference Result 503 states and 763 transitions. [2019-10-22 08:58:54,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:54,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-22 08:58:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:54,269 INFO L225 Difference]: With dead ends: 503 [2019-10-22 08:58:54,269 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 08:58:54,269 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 08:58:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 08:58:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-10-22 08:58:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-10-22 08:58:54,274 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-10-22 08:58:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:54,274 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-10-22 08:58:54,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-10-22 08:58:54,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:58:54,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:54,275 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 08:58:54,275 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1449434210, now seen corresponding path program 1 times [2019-10-22 08:58:54,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548329644] [2019-10-22 08:58:54,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,321 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 08:58:54,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548329644] [2019-10-22 08:58:54,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:54,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:54,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276566575] [2019-10-22 08:58:54,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:54,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:54,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:54,322 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-10-22 08:58:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:54,660 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-10-22 08:58:54,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:54,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 08:58:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:54,662 INFO L225 Difference]: With dead ends: 530 [2019-10-22 08:58:54,662 INFO L226 Difference]: Without dead ends: 299 [2019-10-22 08:58:54,662 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 08:58:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-22 08:58:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-10-22 08:58:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-10-22 08:58:54,669 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-10-22 08:58:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:54,669 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-10-22 08:58:54,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-10-22 08:58:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 08:58:54,670 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:54,670 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 08:58:54,670 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1015705124, now seen corresponding path program 1 times [2019-10-22 08:58:54,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614570629] [2019-10-22 08:58:54,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,718 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 08:58:54,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614570629] [2019-10-22 08:58:54,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:54,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:54,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706083104] [2019-10-22 08:58:54,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:54,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:54,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:54,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:54,721 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-10-22 08:58:54,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:54,969 INFO L93 Difference]: Finished difference Result 503 states and 759 transitions. [2019-10-22 08:58:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:54,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-22 08:58:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:54,971 INFO L225 Difference]: With dead ends: 503 [2019-10-22 08:58:54,971 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 08:58:54,971 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 08:58:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 08:58:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-10-22 08:58:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-10-22 08:58:54,978 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-10-22 08:58:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:54,978 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-10-22 08:58:54,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-10-22 08:58:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:58:54,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:54,979 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 08:58:54,979 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:54,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,980 INFO L82 PathProgramCache]: Analyzing trace with hash 542245225, now seen corresponding path program 1 times [2019-10-22 08:58:54,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029030315] [2019-10-22 08:58:54,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,044 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 08:58:55,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029030315] [2019-10-22 08:58:55,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:55,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:55,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113384554] [2019-10-22 08:58:55,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:55,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:55,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:55,045 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-10-22 08:58:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:55,364 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-10-22 08:58:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:55,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 08:58:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:55,366 INFO L225 Difference]: With dead ends: 530 [2019-10-22 08:58:55,366 INFO L226 Difference]: Without dead ends: 299 [2019-10-22 08:58:55,366 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 08:58:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-22 08:58:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-10-22 08:58:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-10-22 08:58:55,372 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-10-22 08:58:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:55,373 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-10-22 08:58:55,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-10-22 08:58:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 08:58:55,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:55,374 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 08:58:55,374 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1102945003, now seen corresponding path program 1 times [2019-10-22 08:58:55,375 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457321995] [2019-10-22 08:58:55,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,443 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 08:58:55,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457321995] [2019-10-22 08:58:55,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:55,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:55,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459102238] [2019-10-22 08:58:55,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:55,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:55,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:55,445 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-10-22 08:58:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:55,696 INFO L93 Difference]: Finished difference Result 503 states and 755 transitions. [2019-10-22 08:58:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:55,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-22 08:58:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:55,698 INFO L225 Difference]: With dead ends: 503 [2019-10-22 08:58:55,698 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 08:58:55,698 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 08:58:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 08:58:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-10-22 08:58:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-10-22 08:58:55,704 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-10-22 08:58:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:55,705 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-10-22 08:58:55,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-10-22 08:58:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 08:58:55,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:55,706 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 08:58:55,706 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:55,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,706 INFO L82 PathProgramCache]: Analyzing trace with hash 952064921, now seen corresponding path program 1 times [2019-10-22 08:58:55,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402623762] [2019-10-22 08:58:55,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,753 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 08:58:55,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402623762] [2019-10-22 08:58:55,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:55,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:55,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690951116] [2019-10-22 08:58:55,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:55,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:55,755 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-10-22 08:58:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,085 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-10-22 08:58:56,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:56,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 08:58:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:56,086 INFO L225 Difference]: With dead ends: 530 [2019-10-22 08:58:56,086 INFO L226 Difference]: Without dead ends: 299 [2019-10-22 08:58:56,086 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 08:58:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-22 08:58:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-10-22 08:58:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-10-22 08:58:56,091 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-10-22 08:58:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:56,092 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-10-22 08:58:56,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-10-22 08:58:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 08:58:56,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:56,093 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 08:58:56,093 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1153888855, now seen corresponding path program 1 times [2019-10-22 08:58:56,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825331261] [2019-10-22 08:58:56,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,139 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 08:58:56,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825331261] [2019-10-22 08:58:56,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:56,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:56,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138764235] [2019-10-22 08:58:56,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:56,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:56,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:56,140 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-10-22 08:58:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,416 INFO L93 Difference]: Finished difference Result 503 states and 751 transitions. [2019-10-22 08:58:56,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:56,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-10-22 08:58:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:56,418 INFO L225 Difference]: With dead ends: 503 [2019-10-22 08:58:56,418 INFO L226 Difference]: Without dead ends: 272 [2019-10-22 08:58:56,418 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 08:58:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-10-22 08:58:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-10-22 08:58:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-10-22 08:58:56,425 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-10-22 08:58:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:56,425 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-10-22 08:58:56,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-10-22 08:58:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 08:58:56,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:56,427 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 08:58:56,427 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,427 INFO L82 PathProgramCache]: Analyzing trace with hash -431127036, now seen corresponding path program 1 times [2019-10-22 08:58:56,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579425773] [2019-10-22 08:58:56,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,491 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 08:58:56,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579425773] [2019-10-22 08:58:56,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:56,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:56,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087856227] [2019-10-22 08:58:56,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:56,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:56,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:56,492 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-10-22 08:58:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,823 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-10-22 08:58:56,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:56,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 08:58:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:56,824 INFO L225 Difference]: With dead ends: 520 [2019-10-22 08:58:56,824 INFO L226 Difference]: Without dead ends: 289 [2019-10-22 08:58:56,824 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 08:58:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-22 08:58:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-10-22 08:58:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-10-22 08:58:56,830 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-10-22 08:58:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:56,830 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-10-22 08:58:56,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-10-22 08:58:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 08:58:56,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:56,831 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 08:58:56,831 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:56,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1530447622, now seen corresponding path program 1 times [2019-10-22 08:58:56,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183499084] [2019-10-22 08:58:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,883 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 08:58:56,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183499084] [2019-10-22 08:58:56,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:56,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:56,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622286811] [2019-10-22 08:58:56,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:56,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:56,884 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-10-22 08:58:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:57,100 INFO L93 Difference]: Finished difference Result 493 states and 735 transitions. [2019-10-22 08:58:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:57,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-22 08:58:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:57,101 INFO L225 Difference]: With dead ends: 493 [2019-10-22 08:58:57,101 INFO L226 Difference]: Without dead ends: 262 [2019-10-22 08:58:57,102 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 08:58:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-22 08:58:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2019-10-22 08:58:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-10-22 08:58:57,107 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-10-22 08:58:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:57,107 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-10-22 08:58:57,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-10-22 08:58:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:58:57,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:57,108 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 08:58:57,108 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1853395595, now seen corresponding path program 1 times [2019-10-22 08:58:57,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434211042] [2019-10-22 08:58:57,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,157 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 08:58:57,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434211042] [2019-10-22 08:58:57,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:57,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:57,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265185578] [2019-10-22 08:58:57,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:57,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:57,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:57,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:57,159 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-10-22 08:58:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:57,489 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-10-22 08:58:57,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:57,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-22 08:58:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:57,491 INFO L225 Difference]: With dead ends: 520 [2019-10-22 08:58:57,491 INFO L226 Difference]: Without dead ends: 289 [2019-10-22 08:58:57,492 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 08:58:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-22 08:58:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-10-22 08:58:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-22 08:58:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-10-22 08:58:57,501 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-10-22 08:58:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:57,501 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-10-22 08:58:57,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-10-22 08:58:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:58:57,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:57,502 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 08:58:57,503 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash 167215757, now seen corresponding path program 1 times [2019-10-22 08:58:57,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417330623] [2019-10-22 08:58:57,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,556 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 08:58:57,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417330623] [2019-10-22 08:58:57,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:57,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:57,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401575192] [2019-10-22 08:58:57,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:57,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:57,558 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-10-22 08:58:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:57,589 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-10-22 08:58:57,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:57,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 08:58:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:57,591 INFO L225 Difference]: With dead ends: 710 [2019-10-22 08:58:57,591 INFO L226 Difference]: Without dead ends: 479 [2019-10-22 08:58:57,591 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 08:58:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-22 08:58:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-10-22 08:58:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-22 08:58:57,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-10-22 08:58:57,602 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-10-22 08:58:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:57,602 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-10-22 08:58:57,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-10-22 08:58:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 08:58:57,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:57,604 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 08:58:57,604 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-10-22 08:58:57,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140203079] [2019-10-22 08:58:57,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:57,826 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:57,826 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:58:57,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:57 BoogieIcfgContainer [2019-10-22 08:58:57,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:57,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:57,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:57,953 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:57,953 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:43" (3/4) ... [2019-10-22 08:58:57,957 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:57,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:57,960 INFO L168 Benchmark]: Toolchain (without parser) took 15987.15 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.4 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -232.5 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,962 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,963 INFO L168 Benchmark]: Boogie Preprocessor took 96.91 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,963 INFO L168 Benchmark]: RCFGBuilder took 1004.36 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: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,963 INFO L168 Benchmark]: TraceAbstraction took 14099.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -157.9 MB). Peak memory consumption was 121.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,963 INFO L168 Benchmark]: Witness Printer took 5.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,964 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 688.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.91 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1004.36 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: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14099.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -157.9 MB). Peak memory consumption was 121.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.78 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7109 SDtfs, 2139 SDslu, 10027 SDs, 0 SdLazy, 6809 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s 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, 941 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 08:59:00,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:00,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:00,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:00,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:00,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:00,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:00,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:00,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:00,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:00,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:00,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:00,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:00,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:00,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:00,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:00,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:00,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:00,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:00,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:00,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:00,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:00,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:00,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:00,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:00,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:00,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:00,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:00,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:00,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:00,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:00,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:00,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:00,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:00,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:00,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:00,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:00,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:00,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:00,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:00,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:00,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 08:59:00,069 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:00,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:00,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:00,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:00,070 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:00,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:00,070 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:00,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:00,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:00,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:59:00,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:00,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:59:00,072 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 08:59:00,072 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 08:59:00,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:00,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:00,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:00,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:59:00,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:00,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:00,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:00,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:00,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:00,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:00,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:00,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:59:00,074 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 08:59:00,074 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 08:59:00,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:59:00,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:59:00,074 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_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 -> bf0d0cf8dda9e68b67ebf00ec54daecd196b7f63 [2019-10-22 08:59:00,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:00,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:00,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:00,114 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:00,114 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:00,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-10-22 08:59:00,157 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/1db9eaf89/7e8f603c242a41479d0468a3bc62244e/FLAGb6eb1b949 [2019-10-22 08:59:00,627 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:00,627 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/sv-benchmarks/c/ssh/s3_srvr.blast.02.i.cil-1.c [2019-10-22 08:59:00,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/1db9eaf89/7e8f603c242a41479d0468a3bc62244e/FLAGb6eb1b949 [2019-10-22 08:59:00,665 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/data/1db9eaf89/7e8f603c242a41479d0468a3bc62244e [2019-10-22 08:59:00,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:00,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:00,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:00,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:00,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:00,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf4f964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:00, skipping insertion in model container [2019-10-22 08:59:00,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:00" (1/1) ... [2019-10-22 08:59:00,689 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:00,734 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:01,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:01,286 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:01,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:01,415 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:01,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01 WrapperNode [2019-10-22 08:59:01,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:01,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:01,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:01,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:01,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:01,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:01,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:01,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:01,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... [2019-10-22 08:59:01,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:01,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:01,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:01,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:01,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 08:59:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:59:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 08:59:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:59:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:01,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 08:59:01,826 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:59:04,116 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-10-22 08:59:04,116 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-10-22 08:59:04,117 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:04,118 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:59:04,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:04 BoogieIcfgContainer [2019-10-22 08:59:04,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:04,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:04,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:04,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:04,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:00" (1/3) ... [2019-10-22 08:59:04,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:04, skipping insertion in model container [2019-10-22 08:59:04,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:01" (2/3) ... [2019-10-22 08:59:04,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:04, skipping insertion in model container [2019-10-22 08:59:04,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:04" (3/3) ... [2019-10-22 08:59:04,126 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2019-10-22 08:59:04,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:04,141 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:59:04,151 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:59:04,172 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:04,172 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:59:04,173 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:04,173 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:04,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:04,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:04,173 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:04,173 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-10-22 08:59:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:59:04,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:04,196 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 08:59:04,198 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-10-22 08:59:04,212 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:59:04,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1793965126] [2019-10-22 08:59:04,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 08:59:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:04,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:04,444 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 08:59:04,445 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:59:04,465 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 08:59:04,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1793965126] [2019-10-22 08:59:04,467 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:04,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:59:04,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880209650] [2019-10-22 08:59:04,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:04,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:59:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:04,486 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-10-22 08:59:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:04,591 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-10-22 08:59:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:04,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-10-22 08:59:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:04,605 INFO L225 Difference]: With dead ends: 537 [2019-10-22 08:59:04,605 INFO L226 Difference]: Without dead ends: 363 [2019-10-22 08:59:04,608 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 08:59:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-22 08:59:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-10-22 08:59:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 08:59:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-10-22 08:59:04,665 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-10-22 08:59:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:04,665 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-10-22 08:59:04,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-10-22 08:59:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 08:59:04,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:04,669 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 08:59:04,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:59:04,870 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1786835122, now seen corresponding path program 1 times [2019-10-22 08:59:04,872 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:59:04,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1072783337] [2019-10-22 08:59:04,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 08:59:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:05,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:05,130 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 08:59:05,130 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:59:05,159 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 08:59:05,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072783337] [2019-10-22 08:59:05,160 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:59:05,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798613364] [2019-10-22 08:59:05,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:05,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:59:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:05,162 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-10-22 08:59:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,394 INFO L93 Difference]: Finished difference Result 833 states and 1271 transitions. [2019-10-22 08:59:05,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:05,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 08:59:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,397 INFO L225 Difference]: With dead ends: 833 [2019-10-22 08:59:05,397 INFO L226 Difference]: Without dead ends: 597 [2019-10-22 08:59:05,398 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 08:59:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-22 08:59:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-22 08:59:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-22 08:59:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 905 transitions. [2019-10-22 08:59:05,434 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 905 transitions. Word has length 103 [2019-10-22 08:59:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,435 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 905 transitions. [2019-10-22 08:59:05,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 905 transitions. [2019-10-22 08:59:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 08:59:05,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,440 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 08:59:05,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:59:05,641 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1381936186, now seen corresponding path program 1 times [2019-10-22 08:59:05,642 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:59:05,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1935964901] [2019-10-22 08:59:05,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/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 08:59:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,832 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-10-22 08:59:07,833 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:59:08,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 08:59:08,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:08 BoogieIcfgContainer [2019-10-22 08:59:08,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:08,144 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:08,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:08,145 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:08,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:04" (3/4) ... [2019-10-22 08:59:08,148 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:59:08,283 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7b69e769-f7fc-4c73-8608-8eedb5de3acc/bin/uautomizer/witness.graphml [2019-10-22 08:59:08,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:08,287 INFO L168 Benchmark]: Toolchain (without parser) took 7615.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.5 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -218.8 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:08,287 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:08,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:08,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:08,288 INFO L168 Benchmark]: Boogie Preprocessor took 75.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 08:59:08,288 INFO L168 Benchmark]: RCFGBuilder took 2539.96 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: 91.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:08,289 INFO L168 Benchmark]: TraceAbstraction took 4024.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:08,289 INFO L168 Benchmark]: Witness Printer took 140.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:08,290 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 742.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 2539.96 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: 91.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4024.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 140.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1351] COND FALSE !(ret <= 0) [L1356] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1356] COND TRUE s->hit [L1357] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1361] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1554] EXPR s->session [L1554] EXPR s->s3 [L1554] EXPR (s->s3)->tmp.new_cipher [L1554] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1555] COND FALSE !(! tmp___9) [L1561] ret = __VERIFIER_nondet_int() [L1562] COND TRUE blastFlag == 2 [L1563] blastFlag = 3 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 657 SDslu, 785 SDs, 0 SdLazy, 50 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s 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...