./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/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 425afc8b22e60c0a2f2550983f32b043f3f437d4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:42:33,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:42:33,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:42:33,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:42:33,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:42:33,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:42:33,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:42:33,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:42:33,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:42:33,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:42:33,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:42:33,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:42:33,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:42:33,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:42:33,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:42:33,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:42:33,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:42:33,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:42:33,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:42:33,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:42:33,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:42:33,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:42:33,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:42:33,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:42:33,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:42:33,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:42:33,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:42:33,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:42:33,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:42:33,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:42:33,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:42:33,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:42:33,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:42:33,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:42:33,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:42:33,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:42:33,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:42:33,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:42:33,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:42:33,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:42:33,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:42:33,083 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:42:33,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:42:33,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:42:33,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:42:33,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:42:33,119 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:42:33,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:42:33,120 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:42:33,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:42:33,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:42:33,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:42:33,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:42:33,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:42:33,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:42:33,122 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:42:33,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:42:33,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:42:33,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:42:33,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:42:33,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:42:33,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:42:33,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:42:33,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:42:33,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:42:33,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:42:33,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:42:33,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:42:33,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:42:33,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:42:33,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-15 23:42:33,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:42:33,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:42:33,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:42:33,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:42:33,167 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:42:33,168 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-15 23:42:33,223 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/8b64b8557/dc00e1ac6f4343ef987c210b962ea7f9/FLAG797762eda [2019-11-15 23:42:33,637 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:42:33,646 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-15 23:42:33,659 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/8b64b8557/dc00e1ac6f4343ef987c210b962ea7f9/FLAG797762eda [2019-11-15 23:42:34,021 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/8b64b8557/dc00e1ac6f4343ef987c210b962ea7f9 [2019-11-15 23:42:34,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:42:34,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:42:34,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:42:34,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:42:34,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:42:34,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b43a16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34, skipping insertion in model container [2019-11-15 23:42:34,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,039 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:42:34,093 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:42:34,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:42:34,487 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:42:34,536 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:42:34,550 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:42:34,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34 WrapperNode [2019-11-15 23:42:34,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:42:34,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:42:34,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:42:34,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:42:34,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:42:34,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:42:34,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:42:34,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:42:34,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... [2019-11-15 23:42:34,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:42:34,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:42:34,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:42:34,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:42:34,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:42:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:42:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:42:34,828 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:42:35,360 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 23:42:35,360 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 23:42:35,362 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:42:35,362 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:42:35,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:42:35 BoogieIcfgContainer [2019-11-15 23:42:35,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:42:35,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:42:35,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:42:35,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:42:35,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:42:34" (1/3) ... [2019-11-15 23:42:35,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7162021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:42:35, skipping insertion in model container [2019-11-15 23:42:35,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:34" (2/3) ... [2019-11-15 23:42:35,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7162021a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:42:35, skipping insertion in model container [2019-11-15 23:42:35,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:42:35" (3/3) ... [2019-11-15 23:42:35,376 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-15 23:42:35,391 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:42:35,398 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:42:35,408 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:42:35,445 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:42:35,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:42:35,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:42:35,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:42:35,448 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:42:35,448 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:42:35,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:42:35,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:42:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 23:42:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:42:35,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:35,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:35,481 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-15 23:42:35,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:35,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058968321] [2019-11-15 23:42:35,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:35,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:35,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:35,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058968321] [2019-11-15 23:42:35,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:35,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:42:35,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385219066] [2019-11-15 23:42:35,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:35,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:35,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:35,677 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-15 23:42:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:35,878 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-15 23:42:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:35,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:42:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:35,891 INFO L225 Difference]: With dead ends: 245 [2019-11-15 23:42:35,891 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:42:35,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:42:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 23:42:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:42:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-15 23:42:35,933 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-15 23:42:35,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:35,933 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-15 23:42:35,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:35,934 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-15 23:42:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:42:35,935 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:35,936 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] [2019-11-15 23:42:35,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-15 23:42:35,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:35,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491781567] [2019-11-15 23:42:35,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:35,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:35,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:36,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491781567] [2019-11-15 23:42:36,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:36,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:36,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099533940] [2019-11-15 23:42:36,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:36,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,017 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-15 23:42:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:36,188 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-15 23:42:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:36,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-15 23:42:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:36,191 INFO L225 Difference]: With dead ends: 232 [2019-11-15 23:42:36,191 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 23:42:36,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 23:42:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-15 23:42:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:42:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-15 23:42:36,212 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-15 23:42:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:36,212 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-15 23:42:36,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-15 23:42:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:42:36,218 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:36,219 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:36,219 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:36,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-15 23:42:36,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:36,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503828836] [2019-11-15 23:42:36,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:36,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:42:36,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503828836] [2019-11-15 23:42:36,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:36,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:36,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693492952] [2019-11-15 23:42:36,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:36,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:36,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,303 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-15 23:42:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:36,454 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-15 23:42:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:36,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:42:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:36,456 INFO L225 Difference]: With dead ends: 264 [2019-11-15 23:42:36,457 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 23:42:36,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 23:42:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-15 23:42:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 23:42:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-15 23:42:36,468 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-15 23:42:36,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:36,469 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-15 23:42:36,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-15 23:42:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:42:36,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:36,471 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:36,471 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:36,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:36,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-15 23:42:36,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:36,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341504736] [2019-11-15 23:42:36,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:42:36,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341504736] [2019-11-15 23:42:36,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:36,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:36,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772398358] [2019-11-15 23:42:36,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:36,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:36,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,539 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-15 23:42:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:36,573 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-15 23:42:36,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:36,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:42:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:36,577 INFO L225 Difference]: With dead ends: 298 [2019-11-15 23:42:36,577 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 23:42:36,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 23:42:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-15 23:42:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 23:42:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-15 23:42:36,599 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-15 23:42:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:36,599 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-15 23:42:36,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-15 23:42:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:42:36,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:36,602 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:36,602 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-15 23:42:36,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:36,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362216159] [2019-11-15 23:42:36,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:42:36,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362216159] [2019-11-15 23:42:36,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:36,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:36,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21761239] [2019-11-15 23:42:36,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:36,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,691 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-11-15 23:42:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:36,918 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-11-15 23:42:36,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:36,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:42:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:36,921 INFO L225 Difference]: With dead ends: 369 [2019-11-15 23:42:36,921 INFO L226 Difference]: Without dead ends: 213 [2019-11-15 23:42:36,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-15 23:42:36,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-11-15 23:42:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 23:42:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-11-15 23:42:36,943 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-11-15 23:42:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:36,945 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-11-15 23:42:36,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-11-15 23:42:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:42:36,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:36,953 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:36,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-11-15 23:42:36,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:36,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777310293] [2019-11-15 23:42:36,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:36,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:42:37,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777310293] [2019-11-15 23:42:37,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:37,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:37,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238227308] [2019-11-15 23:42:37,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:37,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,013 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-11-15 23:42:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:37,168 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-11-15 23:42:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:37,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:42:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:37,171 INFO L225 Difference]: With dead ends: 424 [2019-11-15 23:42:37,171 INFO L226 Difference]: Without dead ends: 228 [2019-11-15 23:42:37,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-15 23:42:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-11-15 23:42:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-15 23:42:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-11-15 23:42:37,182 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-11-15 23:42:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:37,183 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-11-15 23:42:37,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-11-15 23:42:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 23:42:37,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:37,185 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:37,185 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:37,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-11-15 23:42:37,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:37,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571593005] [2019-11-15 23:42:37,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-15 23:42:37,257 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571593005] [2019-11-15 23:42:37,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:37,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:37,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167050133] [2019-11-15 23:42:37,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:37,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,259 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-11-15 23:42:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:37,429 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-11-15 23:42:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:37,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-15 23:42:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:37,432 INFO L225 Difference]: With dead ends: 463 [2019-11-15 23:42:37,432 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 23:42:37,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 23:42:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-11-15 23:42:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-15 23:42:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-15 23:42:37,444 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-11-15 23:42:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:37,445 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-15 23:42:37,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-15 23:42:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 23:42:37,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:37,450 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:37,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-15 23:42:37,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:37,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615006957] [2019-11-15 23:42:37,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:42:37,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615006957] [2019-11-15 23:42:37,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:37,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:37,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919347808] [2019-11-15 23:42:37,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:37,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:37,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,578 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-11-15 23:42:37,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:37,636 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-11-15 23:42:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:37,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-15 23:42:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:37,641 INFO L225 Difference]: With dead ends: 694 [2019-11-15 23:42:37,641 INFO L226 Difference]: Without dead ends: 458 [2019-11-15 23:42:37,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-15 23:42:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-11-15 23:42:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-15 23:42:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-11-15 23:42:37,665 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-11-15 23:42:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:37,665 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-11-15 23:42:37,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-11-15 23:42:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:42:37,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:37,668 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:37,668 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-15 23:42:37,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:37,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366081870] [2019-11-15 23:42:37,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 23:42:37,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366081870] [2019-11-15 23:42:37,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:37,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:37,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055053117] [2019-11-15 23:42:37,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:37,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:37,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:37,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,770 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-11-15 23:42:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:37,816 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-11-15 23:42:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:37,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 23:42:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:37,821 INFO L225 Difference]: With dead ends: 673 [2019-11-15 23:42:37,821 INFO L226 Difference]: Without dead ends: 671 [2019-11-15 23:42:37,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-15 23:42:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-15 23:42:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-15 23:42:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-15 23:42:37,842 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-11-15 23:42:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:37,842 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-15 23:42:37,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-15 23:42:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 23:42:37,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:37,849 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:37,849 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:37,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-15 23:42:37,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:37,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171614499] [2019-11-15 23:42:37,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:37,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 23:42:37,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171614499] [2019-11-15 23:42:37,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:37,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:37,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334847877] [2019-11-15 23:42:37,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:37,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:37,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:37,917 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-15 23:42:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:38,099 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-11-15 23:42:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:38,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-15 23:42:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:38,107 INFO L225 Difference]: With dead ends: 1483 [2019-11-15 23:42:38,108 INFO L226 Difference]: Without dead ends: 818 [2019-11-15 23:42:38,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-15 23:42:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-11-15 23:42:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-15 23:42:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-11-15 23:42:38,141 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-11-15 23:42:38,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:38,142 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-11-15 23:42:38,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-11-15 23:42:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 23:42:38,146 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:38,146 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:38,146 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-11-15 23:42:38,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:38,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355355917] [2019-11-15 23:42:38,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-15 23:42:38,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355355917] [2019-11-15 23:42:38,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:38,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:38,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436661012] [2019-11-15 23:42:38,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:38,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:38,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,223 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-11-15 23:42:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:38,400 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-11-15 23:42:38,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:38,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-15 23:42:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:38,406 INFO L225 Difference]: With dead ends: 1845 [2019-11-15 23:42:38,406 INFO L226 Difference]: Without dead ends: 1015 [2019-11-15 23:42:38,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-15 23:42:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-11-15 23:42:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-15 23:42:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-11-15 23:42:38,433 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-11-15 23:42:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:38,434 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-11-15 23:42:38,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-11-15 23:42:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 23:42:38,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:38,437 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2019-11-15 23:42:38,438 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-15 23:42:38,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:38,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445647039] [2019-11-15 23:42:38,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 23:42:38,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445647039] [2019-11-15 23:42:38,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:38,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:38,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268150200] [2019-11-15 23:42:38,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:38,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:38,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:38,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,582 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-11-15 23:42:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:38,620 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-11-15 23:42:38,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:38,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-15 23:42:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:38,627 INFO L225 Difference]: With dead ends: 2279 [2019-11-15 23:42:38,628 INFO L226 Difference]: Without dead ends: 1311 [2019-11-15 23:42:38,629 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-15 23:42:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-11-15 23:42:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-15 23:42:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-11-15 23:42:38,669 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-11-15 23:42:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:38,669 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-11-15 23:42:38,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-11-15 23:42:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:42:38,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:38,674 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:38,674 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:38,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:38,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-11-15 23:42:38,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:38,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125390099] [2019-11-15 23:42:38,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:42:38,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125390099] [2019-11-15 23:42:38,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:38,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:42:38,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008727752] [2019-11-15 23:42:38,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:38,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:42:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,779 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-11-15 23:42:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:38,842 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-11-15 23:42:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:38,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-15 23:42:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:38,857 INFO L225 Difference]: With dead ends: 3667 [2019-11-15 23:42:38,857 INFO L226 Difference]: Without dead ends: 2365 [2019-11-15 23:42:38,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-11-15 23:42:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-11-15 23:42:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-15 23:42:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-11-15 23:42:38,949 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-11-15 23:42:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:38,950 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-11-15 23:42:38,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-11-15 23:42:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:42:38,956 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:38,956 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:38,957 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-15 23:42:38,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:42:38,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552269603] [2019-11-15 23:42:38,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:42:38,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:42:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:42:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:42:39,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:42:39,175 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:42:39,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:42:39 BoogieIcfgContainer [2019-11-15 23:42:39,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:42:39,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:42:39,293 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:42:39,293 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:42:39,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:42:35" (3/4) ... [2019-11-15 23:42:39,297 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:42:39,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:42:39,301 INFO L168 Benchmark]: Toolchain (without parser) took 5274.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 948.7 MB in the beginning and 769.4 MB in the end (delta: 179.3 MB). Peak memory consumption was 404.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:39,302 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:42:39,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:39,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.43 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: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:39,308 INFO L168 Benchmark]: Boogie Preprocessor took 31.89 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-11-15 23:42:39,308 INFO L168 Benchmark]: RCFGBuilder took 699.65 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:39,309 INFO L168 Benchmark]: TraceAbstraction took 3927.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 769.4 MB in the end (delta: 290.6 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:39,309 INFO L168 Benchmark]: Witness Printer took 5.27 ms. Allocated memory is still 1.3 GB. Free memory is still 769.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:42:39,318 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 534.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.43 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: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.89 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. * RCFGBuilder took 699.65 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3927.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.4 MB). Free memory was 1.1 GB in the beginning and 769.4 MB in the end (delta: 290.6 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.27 ms. Allocated memory is still 1.3 GB. Free memory is still 769.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 607]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 355. Possible FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.8s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:42:41,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:42:41,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:42:41,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:42:41,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:42:41,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:42:41,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:42:41,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:42:41,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:42:41,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:42:41,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:42:41,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:42:41,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:42:41,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:42:41,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:42:41,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:42:41,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:42:41,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:42:41,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:42:41,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:42:41,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:42:41,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:42:41,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:42:41,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:42:41,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:42:41,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:42:41,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:42:41,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:42:41,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:42:41,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:42:41,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:42:41,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:42:41,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:42:41,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:42:41,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:42:41,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:42:41,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:42:41,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:42:41,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:42:41,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:42:41,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:42:41,481 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:42:41,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:42:41,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:42:41,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:42:41,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:42:41,510 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:42:41,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:42:41,510 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:42:41,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:42:41,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:42:41,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:42:41,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:42:41,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:42:41,511 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:42:41,511 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:42:41,512 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:42:41,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:42:41,512 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:42:41,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:42:41,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:42:41,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:42:41,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:42:41,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:42:41,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:42:41,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:42:41,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:42:41,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:42:41,514 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:42:41,514 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:42:41,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:42:41,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:42:41,515 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/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 -> 425afc8b22e60c0a2f2550983f32b043f3f437d4 [2019-11-15 23:42:41,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:42:41,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:42:41,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:42:41,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:42:41,583 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:42:41,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-15 23:42:41,634 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/631760559/ffa7073ac2bf4bc98cea09eedba82303/FLAGfc157b17e [2019-11-15 23:42:42,054 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:42:42,055 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-11-15 23:42:42,066 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/631760559/ffa7073ac2bf4bc98cea09eedba82303/FLAGfc157b17e [2019-11-15 23:42:42,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/data/631760559/ffa7073ac2bf4bc98cea09eedba82303 [2019-11-15 23:42:42,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:42:42,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:42:42,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:42:42,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:42:42,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:42:42,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f8bf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42, skipping insertion in model container [2019-11-15 23:42:42,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:42:42,507 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:42:42,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:42:42,790 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:42:42,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:42:42,910 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:42:42,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42 WrapperNode [2019-11-15 23:42:42,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:42:42,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:42:42,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:42:42,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:42:42,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:42:42,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:42:42,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:42:42,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:42:42,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:42,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:43,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:43,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... [2019-11-15 23:42:43,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:42:43,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:42:43,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:42:43,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:42:43,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:42:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:42:43,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:42:43,220 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:42:43,776 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 23:42:43,776 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 23:42:43,777 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:42:43,777 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:42:43,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:42:43 BoogieIcfgContainer [2019-11-15 23:42:43,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:42:43,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:42:43,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:42:43,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:42:43,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:42:42" (1/3) ... [2019-11-15 23:42:43,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dd4355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:42:43, skipping insertion in model container [2019-11-15 23:42:43,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:42:42" (2/3) ... [2019-11-15 23:42:43,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dd4355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:42:43, skipping insertion in model container [2019-11-15 23:42:43,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:42:43" (3/3) ... [2019-11-15 23:42:43,786 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-11-15 23:42:43,794 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:42:43,799 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:42:43,806 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:42:43,826 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:42:43,826 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:42:43,827 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:42:43,827 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:42:43,827 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:42:43,827 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:42:43,827 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:42:43,828 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:42:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 23:42:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:42:43,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:43,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:43,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:43,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-15 23:42:43,866 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:43,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [250462437] [2019-11-15 23:42:43,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:43,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:43,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:44,011 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:44,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [250462437] [2019-11-15 23:42:44,030 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:44,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:42:44,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935215382] [2019-11-15 23:42:44,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:44,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:44,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:44,051 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-15 23:42:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:44,303 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-15 23:42:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:44,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 23:42:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:44,314 INFO L225 Difference]: With dead ends: 245 [2019-11-15 23:42:44,314 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:42:44,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:42:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-15 23:42:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:42:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-15 23:42:44,353 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-15 23:42:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:44,354 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-15 23:42:44,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-15 23:42:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:42:44,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:44,356 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] [2019-11-15 23:42:44,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:44,561 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:44,561 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-15 23:42:44,562 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:44,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [737743966] [2019-11-15 23:42:44,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:44,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:44,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:44,655 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:42:44,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [737743966] [2019-11-15 23:42:44,661 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:44,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:44,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041355009] [2019-11-15 23:42:44,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:44,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:44,664 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-15 23:42:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:44,856 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-15 23:42:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:44,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-15 23:42:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:44,858 INFO L225 Difference]: With dead ends: 232 [2019-11-15 23:42:44,858 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 23:42:44,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 23:42:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-15 23:42:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 23:42:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-15 23:42:44,873 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-15 23:42:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:44,873 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-15 23:42:44,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-15 23:42:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:42:44,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:44,876 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:45,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:45,089 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:45,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-15 23:42:45,091 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:45,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1462373140] [2019-11-15 23:42:45,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:45,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:45,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:42:45,208 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:42:45,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1462373140] [2019-11-15 23:42:45,216 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:45,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:45,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701157093] [2019-11-15 23:42:45,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:45,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:45,218 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-15 23:42:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:45,364 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-15 23:42:45,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:45,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 23:42:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:45,366 INFO L225 Difference]: With dead ends: 264 [2019-11-15 23:42:45,366 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 23:42:45,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 23:42:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-15 23:42:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 23:42:45,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-15 23:42:45,383 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-15 23:42:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:45,384 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-15 23:42:45,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:45,384 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-15 23:42:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:42:45,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:45,387 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:45,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:45,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-15 23:42:45,588 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:45,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [880588189] [2019-11-15 23:42:45,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:45,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:45,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:42:45,720 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:42:45,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [880588189] [2019-11-15 23:42:45,733 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:45,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:45,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455287619] [2019-11-15 23:42:45,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:45,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:45,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:45,735 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-15 23:42:45,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:45,767 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-15 23:42:45,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:45,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:42:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:45,769 INFO L225 Difference]: With dead ends: 298 [2019-11-15 23:42:45,769 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 23:42:45,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:45,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 23:42:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-15 23:42:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 23:42:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-15 23:42:45,782 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-15 23:42:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:45,783 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-15 23:42:45,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-15 23:42:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:42:45,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:45,786 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:45,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:45,990 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-15 23:42:45,991 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:45,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [512743170] [2019-11-15 23:42:45,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:46,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:46,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:42:46,122 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 23:42:46,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [512743170] [2019-11-15 23:42:46,135 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:46,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:42:46,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672323147] [2019-11-15 23:42:46,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:42:46,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:46,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:42:46,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:42:46,137 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-11-15 23:42:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:46,234 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-11-15 23:42:46,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:42:46,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:42:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:46,240 INFO L225 Difference]: With dead ends: 581 [2019-11-15 23:42:46,240 INFO L226 Difference]: Without dead ends: 426 [2019-11-15 23:42:46,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:42:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-15 23:42:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-15 23:42:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-15 23:42:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-11-15 23:42:46,283 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-11-15 23:42:46,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:46,285 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-11-15 23:42:46,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:42:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-11-15 23:42:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:42:46,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:46,298 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:46,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:46,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-11-15 23:42:46,501 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:46,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1624518973] [2019-11-15 23:42:46,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:46,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:46,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:42:46,613 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 23:42:46,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1624518973] [2019-11-15 23:42:46,646 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:46,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:42:46,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573927216] [2019-11-15 23:42:46,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:46,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:46,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:46,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:46,648 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-11-15 23:42:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:46,699 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-11-15 23:42:46,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:46,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-15 23:42:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:46,704 INFO L225 Difference]: With dead ends: 869 [2019-11-15 23:42:46,704 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 23:42:46,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 23:42:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-11-15 23:42:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-15 23:42:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-11-15 23:42:46,735 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-11-15 23:42:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:46,735 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-11-15 23:42:46,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:46,736 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-11-15 23:42:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:42:46,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:46,737 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:46,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:46,947 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-11-15 23:42:46,948 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:46,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1880863748] [2019-11-15 23:42:46,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:47,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:47,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 23:42:47,072 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 23:42:47,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1880863748] [2019-11-15 23:42:47,091 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:47,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:42:47,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498006044] [2019-11-15 23:42:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:42:47,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:42:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:42:47,093 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-11-15 23:42:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:47,419 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-11-15 23:42:47,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:42:47,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-15 23:42:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:47,430 INFO L225 Difference]: With dead ends: 1066 [2019-11-15 23:42:47,430 INFO L226 Difference]: Without dead ends: 649 [2019-11-15 23:42:47,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:42:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-15 23:42:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-11-15 23:42:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-11-15 23:42:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-11-15 23:42:47,453 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-11-15 23:42:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:47,454 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-11-15 23:42:47,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:42:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-11-15 23:42:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 23:42:47,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:47,462 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:47,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:47,673 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:47,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-11-15 23:42:47,674 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:47,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1985511704] [2019-11-15 23:42:47,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:47,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:47,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-15 23:42:47,814 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-15 23:42:47,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985511704] [2019-11-15 23:42:47,831 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:47,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:47,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518406527] [2019-11-15 23:42:47,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:47,833 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:47,834 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-11-15 23:42:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:48,018 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-11-15 23:42:48,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:48,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-15 23:42:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:48,023 INFO L225 Difference]: With dead ends: 1291 [2019-11-15 23:42:48,024 INFO L226 Difference]: Without dead ends: 697 [2019-11-15 23:42:48,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-11-15 23:42:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-11-15 23:42:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-15 23:42:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-11-15 23:42:48,056 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-11-15 23:42:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:48,057 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-11-15 23:42:48,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-11-15 23:42:48,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 23:42:48,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:48,060 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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] [2019-11-15 23:42:48,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:48,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-11-15 23:42:48,269 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:48,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [777732028] [2019-11-15 23:42:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:48,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:48,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 23:42:48,389 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 23:42:48,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777732028] [2019-11-15 23:42:48,412 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:48,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:48,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959089834] [2019-11-15 23:42:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:48,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:48,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:48,414 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-11-15 23:42:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:48,452 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-11-15 23:42:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:48,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-15 23:42:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:48,458 INFO L225 Difference]: With dead ends: 1565 [2019-11-15 23:42:48,459 INFO L226 Difference]: Without dead ends: 914 [2019-11-15 23:42:48,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-15 23:42:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-11-15 23:42:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-15 23:42:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-11-15 23:42:48,488 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-11-15 23:42:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:48,489 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-11-15 23:42:48,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-11-15 23:42:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 23:42:48,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:48,493 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 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] [2019-11-15 23:42:48,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:48,697 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:48,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-11-15 23:42:48,698 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:48,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [409766] [2019-11-15 23:42:48,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:48,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:48,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-15 23:42:48,842 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-15 23:42:48,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [409766] [2019-11-15 23:42:48,866 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:48,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:48,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233156170] [2019-11-15 23:42:48,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:48,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:48,868 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-11-15 23:42:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:49,066 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-11-15 23:42:49,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:49,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-15 23:42:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:49,073 INFO L225 Difference]: With dead ends: 1847 [2019-11-15 23:42:49,073 INFO L226 Difference]: Without dead ends: 989 [2019-11-15 23:42:49,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-15 23:42:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-11-15 23:42:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-15 23:42:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-11-15 23:42:49,102 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-11-15 23:42:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:49,103 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-11-15 23:42:49,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-11-15 23:42:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 23:42:49,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:49,106 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:49,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:49,309 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:49,310 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-11-15 23:42:49,310 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:49,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [946287088] [2019-11-15 23:42:49,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:49,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:49,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-15 23:42:49,472 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-15 23:42:49,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946287088] [2019-11-15 23:42:49,498 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:49,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:49,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506897630] [2019-11-15 23:42:49,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:49,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:49,499 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-11-15 23:42:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:49,551 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-11-15 23:42:49,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:49,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-15 23:42:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:49,560 INFO L225 Difference]: With dead ends: 2432 [2019-11-15 23:42:49,560 INFO L226 Difference]: Without dead ends: 1511 [2019-11-15 23:42:49,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-11-15 23:42:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-11-15 23:42:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-11-15 23:42:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-11-15 23:42:49,616 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-11-15 23:42:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:49,616 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-11-15 23:42:49,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-11-15 23:42:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 23:42:49,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:49,621 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:49,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:49,823 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-11-15 23:42:49,824 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:49,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1567805146] [2019-11-15 23:42:49,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:49,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:49,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-15 23:42:50,003 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-15 23:42:50,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1567805146] [2019-11-15 23:42:50,035 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:50,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:42:50,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990153833] [2019-11-15 23:42:50,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:42:50,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:50,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:42:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:50,037 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-11-15 23:42:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:50,087 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-11-15 23:42:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:42:50,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-15 23:42:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:50,097 INFO L225 Difference]: With dead ends: 2354 [2019-11-15 23:42:50,098 INFO L226 Difference]: Without dead ends: 1513 [2019-11-15 23:42:50,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:42:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-15 23:42:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-11-15 23:42:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-11-15 23:42:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-11-15 23:42:50,158 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-11-15 23:42:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:50,158 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-11-15 23:42:50,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:42:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-11-15 23:42:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-15 23:42:50,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:50,163 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:50,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:50,369 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-11-15 23:42:50,370 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:50,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1368317661] [2019-11-15 23:42:50,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:42:50,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:42:50,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:42:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 23:42:50,528 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:42:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-15 23:42:50,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368317661] [2019-11-15 23:42:50,561 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:42:50,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:42:50,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932472785] [2019-11-15 23:42:50,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:42:50,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:42:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:42:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:42:50,563 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-11-15 23:42:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:42:50,882 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-11-15 23:42:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:42:50,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-15 23:42:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:42:50,891 INFO L225 Difference]: With dead ends: 3056 [2019-11-15 23:42:50,891 INFO L226 Difference]: Without dead ends: 1603 [2019-11-15 23:42:50,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:42:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-15 23:42:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-11-15 23:42:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-11-15 23:42:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-11-15 23:42:50,964 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-11-15 23:42:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:42:50,964 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-11-15 23:42:50,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:42:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-11-15 23:42:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:42:50,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:42:50,971 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:42:51,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:51,173 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:42:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:42:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-15 23:42:51,173 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:42:51,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1524028976] [2019-11-15 23:42:51,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:42:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:42:51,803 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 23:42:51,804 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:42:52,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:42:52,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:42:52 BoogieIcfgContainer [2019-11-15 23:42:52,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:42:52,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:42:52,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:42:52,089 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:42:52,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:42:43" (3/4) ... [2019-11-15 23:42:52,092 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:42:52,196 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab6dcd63-d2de-43cb-b291-9b82278a95f2/bin/uautomizer/witness.graphml [2019-11-15 23:42:52,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:42:52,198 INFO L168 Benchmark]: Toolchain (without parser) took 9738.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -251.3 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:52,199 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:42:52,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:52,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.69 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-11-15 23:42:52,200 INFO L168 Benchmark]: Boogie Preprocessor took 47.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:52,200 INFO L168 Benchmark]: RCFGBuilder took 767.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:52,200 INFO L168 Benchmark]: TraceAbstraction took 8308.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:52,201 INFO L168 Benchmark]: Witness Printer took 107.46 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:42:52,202 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.40 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 450.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.69 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 47.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 767.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8308.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.4 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Witness Printer took 107.46 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y = __VERIFIER_nondet_int(); [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND TRUE blastFlag == 3 [L323] blastFlag = 4 [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND FALSE !(blastFlag == 5) [L350] COND FALSE !(ret <= 0) [L355] s__state = ag_X ^ ag_Y [L356] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] s__state = 4416 [L317] s__init_num = 0 [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L321] ret = __VERIFIER_nondet_int() [L322] COND FALSE !(blastFlag == 3) [L327] COND FALSE !(ret <= 0) [L332] s__state = 4432 [L333] ag_X = (unsigned short)65535 [L334] s__init_num = 0 [L335] COND FALSE !(! tmp___6) [L565] COND FALSE !(! s__s3__tmp__reuse_message) [L594] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 5 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.2s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2513 SDtfs, 1104 SDslu, 1676 SDs, 0 SdLazy, 922 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2626 GetRequests, 2610 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1557occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1521 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2626 ConstructedInterpolants, 0 QuantifiedInterpolants, 558953 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 4520/4520 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...