./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/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan --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 Taipan --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/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan --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 Taipan --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-10-22 11:24:03,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:03,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:03,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:03,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:03,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:03,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:03,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:03,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:03,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:03,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:03,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:03,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:03,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:03,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:03,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:03,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:03,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:03,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:03,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:03,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:03,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:03,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:03,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:03,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:03,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:03,693 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:03,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:03,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:03,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:03,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:03,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:03,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:03,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:03,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:03,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:03,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:03,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:03,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:03,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:03,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:03,701 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:03,713 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:03,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:03,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:03,725 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:03,725 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:03,725 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:03,725 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:03,726 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:03,726 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:03,726 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:03,726 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:03,726 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:03,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:03,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:03,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:03,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:03,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:03,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:03,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:03,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:03,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:03,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:03,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:03,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:03,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:03,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:03,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:03,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:03,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:03,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:03,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:03,730 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:03,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:03,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:03,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:03,732 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan 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 -> Taipan 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-10-22 11:24:03,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:03,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:03,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:03,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:03,783 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:03,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 11:24:03,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/88f6a1442/d9ff2acaa0c540b99fdbc0d15d2bf8d7/FLAG9f945db93 [2019-10-22 11:24:04,255 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:04,256 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 11:24:04,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/88f6a1442/d9ff2acaa0c540b99fdbc0d15d2bf8d7/FLAG9f945db93 [2019-10-22 11:24:04,282 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/88f6a1442/d9ff2acaa0c540b99fdbc0d15d2bf8d7 [2019-10-22 11:24:04,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:04,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:04,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:04,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:04,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:04,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41de5395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04, skipping insertion in model container [2019-10-22 11:24:04,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,302 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:04,342 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:04,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:04,600 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:04,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:04,667 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:04,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04 WrapperNode [2019-10-22 11:24:04,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:04,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:04,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:04,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:04,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:04,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:04,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:04,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:04,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... [2019-10-22 11:24:04,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:04,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:04,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:04,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:04,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:05,052 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:24:05,509 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 11:24:05,509 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 11:24:05,510 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:05,511 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:24:05,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:05 BoogieIcfgContainer [2019-10-22 11:24:05,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:05,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:05,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:05,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:05,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:04" (1/3) ... [2019-10-22 11:24:05,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9d3b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:05, skipping insertion in model container [2019-10-22 11:24:05,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:04" (2/3) ... [2019-10-22 11:24:05,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9d3b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:05, skipping insertion in model container [2019-10-22 11:24:05,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:05" (3/3) ... [2019-10-22 11:24:05,521 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-10-22 11:24:05,530 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:05,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:24:05,548 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:24:05,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:05,574 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:05,575 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:05,575 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:05,575 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:05,575 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:05,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:05,576 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-22 11:24:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:05,602 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:05,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:05,605 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-10-22 11:24:05,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:05,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606934205] [2019-10-22 11:24:05,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:05,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606934205] [2019-10-22 11:24:05,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:05,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:24:05,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033243337] [2019-10-22 11:24:05,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:05,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:05,825 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-10-22 11:24:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:05,995 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-10-22 11:24:05,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:05,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:24:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,013 INFO L225 Difference]: With dead ends: 245 [2019-10-22 11:24:06,013 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 11:24:06,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 11:24:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 11:24:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 11:24:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-10-22 11:24:06,061 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-10-22 11:24:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,062 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-10-22 11:24:06,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-10-22 11:24:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:06,064 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,064 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-10-22 11:24:06,064 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-10-22 11:24:06,065 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131916158] [2019-10-22 11:24:06,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:06,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131916158] [2019-10-22 11:24:06,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:06,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076968185] [2019-10-22 11:24:06,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:06,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:06,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,155 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-10-22 11:24:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,291 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-10-22 11:24:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:06,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:24:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,293 INFO L225 Difference]: With dead ends: 232 [2019-10-22 11:24:06,293 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:24:06,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:24:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-22 11:24:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 11:24:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-10-22 11:24:06,304 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-10-22 11:24:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,304 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-10-22 11:24:06,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-10-22 11:24:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:24:06,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,306 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-10-22 11:24:06,306 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-10-22 11:24:06,306 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522485408] [2019-10-22 11:24:06,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:06,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522485408] [2019-10-22 11:24:06,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:06,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290061031] [2019-10-22 11:24:06,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:06,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,368 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-10-22 11:24:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,505 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-10-22 11:24:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:06,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 11:24:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,506 INFO L225 Difference]: With dead ends: 264 [2019-10-22 11:24:06,506 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 11:24:06,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 11:24:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-10-22 11:24:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:24:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-10-22 11:24:06,517 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-10-22 11:24:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,518 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-10-22 11:24:06,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-10-22 11:24:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:24:06,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,524 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-10-22 11:24:06,524 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-10-22 11:24:06,524 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71122861] [2019-10-22 11:24:06,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:06,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71122861] [2019-10-22 11:24:06,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:06,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573676914] [2019-10-22 11:24:06,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:06,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,636 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-10-22 11:24:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:06,667 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-10-22 11:24:06,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:06,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 11:24:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:06,669 INFO L225 Difference]: With dead ends: 298 [2019-10-22 11:24:06,670 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 11:24:06,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 11:24:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 11:24:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 11:24:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-10-22 11:24:06,690 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-10-22 11:24:06,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:06,690 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-10-22 11:24:06,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-10-22 11:24:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:24:06,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:06,692 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-10-22 11:24:06,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-10-22 11:24:06,693 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:06,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551448041] [2019-10-22 11:24:06,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:06,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:24:06,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551448041] [2019-10-22 11:24:06,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:06,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:06,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676402880] [2019-10-22 11:24:06,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:06,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:06,777 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-10-22 11:24:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,046 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-10-22 11:24:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:07,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 11:24:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,048 INFO L225 Difference]: With dead ends: 369 [2019-10-22 11:24:07,049 INFO L226 Difference]: Without dead ends: 213 [2019-10-22 11:24:07,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-22 11:24:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-10-22 11:24:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 11:24:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-10-22 11:24:07,078 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-10-22 11:24:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,079 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-10-22 11:24:07,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-10-22 11:24:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:24:07,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,081 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-10-22 11:24:07,081 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-10-22 11:24:07,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343304955] [2019-10-22 11:24:07,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:24:07,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343304955] [2019-10-22 11:24:07,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:07,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700990977] [2019-10-22 11:24:07,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:07,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:07,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,154 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-10-22 11:24:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,304 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-10-22 11:24:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:07,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 11:24:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,306 INFO L225 Difference]: With dead ends: 424 [2019-10-22 11:24:07,307 INFO L226 Difference]: Without dead ends: 228 [2019-10-22 11:24:07,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-22 11:24:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-10-22 11:24:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-22 11:24:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-10-22 11:24:07,324 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-10-22 11:24:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,325 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-10-22 11:24:07,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-10-22 11:24:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:24:07,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,326 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-10-22 11:24:07,326 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-10-22 11:24:07,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666479375] [2019-10-22 11:24:07,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 11:24:07,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666479375] [2019-10-22 11:24:07,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:07,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881723500] [2019-10-22 11:24:07,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:07,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,387 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-10-22 11:24:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,536 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-10-22 11:24:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:07,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-22 11:24:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,539 INFO L225 Difference]: With dead ends: 463 [2019-10-22 11:24:07,539 INFO L226 Difference]: Without dead ends: 248 [2019-10-22 11:24:07,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-22 11:24:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-10-22 11:24:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-22 11:24:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-10-22 11:24:07,555 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-10-22 11:24:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,555 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-10-22 11:24:07,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-10-22 11:24:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 11:24:07,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,557 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-10-22 11:24:07,558 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-10-22 11:24:07,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166707261] [2019-10-22 11:24:07,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 11:24:07,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166707261] [2019-10-22 11:24:07,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:07,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512892646] [2019-10-22 11:24:07,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:07,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,636 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-10-22 11:24:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,695 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-10-22 11:24:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:07,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-22 11:24:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,698 INFO L225 Difference]: With dead ends: 694 [2019-10-22 11:24:07,699 INFO L226 Difference]: Without dead ends: 458 [2019-10-22 11:24:07,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-22 11:24:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-10-22 11:24:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-22 11:24:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-10-22 11:24:07,718 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-10-22 11:24:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,719 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-10-22 11:24:07,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-10-22 11:24:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 11:24:07,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,723 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-10-22 11:24:07,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-10-22 11:24:07,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417255622] [2019-10-22 11:24:07,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 11:24:07,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417255622] [2019-10-22 11:24:07,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:07,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422951949] [2019-10-22 11:24:07,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:07,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,793 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-10-22 11:24:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:07,845 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-10-22 11:24:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:07,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 11:24:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:07,848 INFO L225 Difference]: With dead ends: 673 [2019-10-22 11:24:07,848 INFO L226 Difference]: Without dead ends: 671 [2019-10-22 11:24:07,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-10-22 11:24:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-10-22 11:24:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-10-22 11:24:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-10-22 11:24:07,873 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-10-22 11:24:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:07,874 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-10-22 11:24:07,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-10-22 11:24:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-22 11:24:07,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:07,879 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-10-22 11:24:07,879 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-10-22 11:24:07,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:07,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605695892] [2019-10-22 11:24:07,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 11:24:07,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605695892] [2019-10-22 11:24:07,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:07,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:07,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721447478] [2019-10-22 11:24:07,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:07,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:07,949 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-10-22 11:24:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:08,129 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-10-22 11:24:08,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:08,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-22 11:24:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:08,133 INFO L225 Difference]: With dead ends: 1483 [2019-10-22 11:24:08,134 INFO L226 Difference]: Without dead ends: 818 [2019-10-22 11:24:08,136 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-22 11:24:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-10-22 11:24:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-22 11:24:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-10-22 11:24:08,156 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-10-22 11:24:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:08,156 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-10-22 11:24:08,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-10-22 11:24:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-22 11:24:08,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:08,159 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-10-22 11:24:08,160 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-10-22 11:24:08,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:08,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185003597] [2019-10-22 11:24:08,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-22 11:24:08,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185003597] [2019-10-22 11:24:08,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:08,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:08,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905713025] [2019-10-22 11:24:08,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:08,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:08,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,221 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-10-22 11:24:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:08,377 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-10-22 11:24:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:08,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-22 11:24:08,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:08,382 INFO L225 Difference]: With dead ends: 1845 [2019-10-22 11:24:08,382 INFO L226 Difference]: Without dead ends: 1015 [2019-10-22 11:24:08,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-10-22 11:24:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-10-22 11:24:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 11:24:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-10-22 11:24:08,407 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-10-22 11:24:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:08,407 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-10-22 11:24:08,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-10-22 11:24:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-22 11:24:08,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:08,411 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-10-22 11:24:08,411 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-10-22 11:24:08,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:08,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898007607] [2019-10-22 11:24:08,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 11:24:08,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898007607] [2019-10-22 11:24:08,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:08,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:08,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135562153] [2019-10-22 11:24:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:08,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:08,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,529 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-10-22 11:24:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:08,558 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-10-22 11:24:08,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:08,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-22 11:24:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:08,563 INFO L225 Difference]: With dead ends: 2279 [2019-10-22 11:24:08,563 INFO L226 Difference]: Without dead ends: 1311 [2019-10-22 11:24:08,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-10-22 11:24:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-10-22 11:24:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-10-22 11:24:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-10-22 11:24:08,593 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-10-22 11:24:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-10-22 11:24:08,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-10-22 11:24:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 11:24:08,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:08,597 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-10-22 11:24:08,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-10-22 11:24:08,598 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:08,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642495717] [2019-10-22 11:24:08,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 11:24:08,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642495717] [2019-10-22 11:24:08,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:08,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:08,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013817634] [2019-10-22 11:24:08,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:08,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,694 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-10-22 11:24:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:08,752 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-10-22 11:24:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:08,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-22 11:24:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:08,761 INFO L225 Difference]: With dead ends: 3667 [2019-10-22 11:24:08,761 INFO L226 Difference]: Without dead ends: 2365 [2019-10-22 11:24:08,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-10-22 11:24:08,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-10-22 11:24:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-10-22 11:24:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-10-22 11:24:08,871 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-10-22 11:24:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:08,871 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-10-22 11:24:08,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-10-22 11:24:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 11:24:08,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:08,876 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-10-22 11:24:08,876 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-10-22 11:24:08,876 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:08,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486964010] [2019-10-22 11:24:08,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:08,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:09,049 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:24:09,050 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:09,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:09 BoogieIcfgContainer [2019-10-22 11:24:09,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:09,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:09,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:09,132 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:09,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:05" (3/4) ... [2019-10-22 11:24:09,137 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:24:09,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:09,140 INFO L168 Benchmark]: Toolchain (without parser) took 4850.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.5 MB). Free memory was 946.4 MB in the beginning and 1.3 GB in the end (delta: -317.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:09,141 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:09,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:09,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:09,143 INFO L168 Benchmark]: Boogie Preprocessor took 66.12 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:09,144 INFO L168 Benchmark]: RCFGBuilder took 716.37 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:09,144 INFO L168 Benchmark]: TraceAbstraction took 3619.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:09,145 INFO L168 Benchmark]: Witness Printer took 5.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:09,150 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.12 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 716.37 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3619.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.58 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. 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.5s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s 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-10-22 11:24:11,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:11,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:11,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:11,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:11,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:11,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:11,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:11,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:11,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:11,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:11,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:11,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:11,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:11,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:11,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:11,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:11,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:11,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:11,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:11,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:11,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:11,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:11,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:11,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:11,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:11,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:11,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:11,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:11,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:11,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:11,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:11,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:11,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:11,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:11,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:11,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:11,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:11,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:11,400 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:11,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:11,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:24:11,415 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:11,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:11,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:11,419 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:11,420 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:11,420 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:11,420 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:11,420 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:11,420 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:11,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:11,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:11,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:11,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:11,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:11,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:24:11,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:11,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:11,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:11,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:11,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:11,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:11,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:11,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:11,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:11,424 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:24:11,424 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:24:11,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:11,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:11,425 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan 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 -> Taipan 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-10-22 11:24:11,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:11,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:11,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:11,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:11,469 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:11,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 11:24:11,519 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/57f325901/17624c0cd2434deca089aaaf39b482a8/FLAGabb84d2a9 [2019-10-22 11:24:11,907 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:11,908 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-2a.c [2019-10-22 11:24:11,916 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/57f325901/17624c0cd2434deca089aaaf39b482a8/FLAGabb84d2a9 [2019-10-22 11:24:12,286 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/data/57f325901/17624c0cd2434deca089aaaf39b482a8 [2019-10-22 11:24:12,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:12,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:12,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:12,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:12,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:12,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df8c76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12, skipping insertion in model container [2019-10-22 11:24:12,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:12,338 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:12,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:12,564 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:12,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:12,692 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:12,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12 WrapperNode [2019-10-22 11:24:12,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:12,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:12,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:12,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:12,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:12,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:12,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:12,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:12,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:12,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:12,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:12,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:12,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:12,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:12,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:12,912 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:24:13,492 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 11:24:13,493 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 11:24:13,494 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:13,494 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:24:13,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:13 BoogieIcfgContainer [2019-10-22 11:24:13,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:13,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:13,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:13,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:13,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:12" (1/3) ... [2019-10-22 11:24:13,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eadf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:13, skipping insertion in model container [2019-10-22 11:24:13,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (2/3) ... [2019-10-22 11:24:13,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eadf7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:13, skipping insertion in model container [2019-10-22 11:24:13,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:13" (3/3) ... [2019-10-22 11:24:13,506 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-2a.c [2019-10-22 11:24:13,515 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:13,522 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:24:13,530 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:24:13,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:13,560 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:13,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:13,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:13,561 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:13,561 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:13,561 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:13,561 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-22 11:24:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:13,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:13,584 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:13,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:13,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-10-22 11:24:13,598 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:13,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1183235045] [2019-10-22 11:24:13,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:13,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:13,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:13,752 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:13,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1183235045] [2019-10-22 11:24:13,760 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:13,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:24:13,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047260409] [2019-10-22 11:24:13,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:13,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:13,782 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-10-22 11:24:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:13,997 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-10-22 11:24:13,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:13,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:24:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:14,010 INFO L225 Difference]: With dead ends: 245 [2019-10-22 11:24:14,011 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 11:24:14,014 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-10-22 11:24:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 11:24:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-22 11:24:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-22 11:24:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-10-22 11:24:14,052 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-10-22 11:24:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:14,052 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-10-22 11:24:14,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-10-22 11:24:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:14,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:14,054 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-10-22 11:24:14,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:14,255 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-10-22 11:24:14,256 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:14,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1702791693] [2019-10-22 11:24:14,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:14,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:14,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:14,353 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:14,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1702791693] [2019-10-22 11:24:14,362 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:14,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:14,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41386236] [2019-10-22 11:24:14,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:14,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:14,365 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-10-22 11:24:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:14,549 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-10-22 11:24:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:14,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:24:14,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:14,551 INFO L225 Difference]: With dead ends: 232 [2019-10-22 11:24:14,552 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:24:14,553 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-10-22 11:24:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:24:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-22 11:24:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-22 11:24:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-10-22 11:24:14,565 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-10-22 11:24:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:14,566 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-10-22 11:24:14,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-10-22 11:24:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:24:14,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:14,568 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-10-22 11:24:14,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:14,768 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:14,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:14,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-10-22 11:24:14,769 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:14,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1426805774] [2019-10-22 11:24:14,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:14,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:14,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:14,901 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:14,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1426805774] [2019-10-22 11:24:14,910 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:14,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:14,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184716734] [2019-10-22 11:24:14,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:14,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:14,913 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-10-22 11:24:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:15,163 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-10-22 11:24:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:15,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 11:24:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:15,165 INFO L225 Difference]: With dead ends: 264 [2019-10-22 11:24:15,165 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 11:24:15,165 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-10-22 11:24:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 11:24:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-10-22 11:24:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-22 11:24:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-10-22 11:24:15,176 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-10-22 11:24:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:15,177 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-10-22 11:24:15,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-10-22 11:24:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:24:15,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:15,179 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-10-22 11:24:15,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:15,380 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-10-22 11:24:15,380 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:15,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1307373754] [2019-10-22 11:24:15,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:15,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:15,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:15,467 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:15,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1307373754] [2019-10-22 11:24:15,477 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:15,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:15,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999474944] [2019-10-22 11:24:15,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:15,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:15,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:15,478 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-10-22 11:24:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:15,504 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-10-22 11:24:15,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:15,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-22 11:24:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:15,506 INFO L225 Difference]: With dead ends: 298 [2019-10-22 11:24:15,506 INFO L226 Difference]: Without dead ends: 164 [2019-10-22 11:24:15,507 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-10-22 11:24:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-22 11:24:15,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-10-22 11:24:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-22 11:24:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-10-22 11:24:15,518 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-10-22 11:24:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:15,519 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-10-22 11:24:15,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-10-22 11:24:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-22 11:24:15,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:15,521 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-10-22 11:24:15,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:15,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-10-22 11:24:15,723 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:15,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [778520874] [2019-10-22 11:24:15,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:15,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:15,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:24:15,824 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:24:15,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778520874] [2019-10-22 11:24:15,836 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:15,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:24:15,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141883314] [2019-10-22 11:24:15,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:15,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:15,837 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-10-22 11:24:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:15,910 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-10-22 11:24:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:15,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-22 11:24:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:15,913 INFO L225 Difference]: With dead ends: 581 [2019-10-22 11:24:15,913 INFO L226 Difference]: Without dead ends: 426 [2019-10-22 11:24:15,914 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-10-22 11:24:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-22 11:24:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-10-22 11:24:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-22 11:24:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-10-22 11:24:15,939 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-10-22 11:24:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:15,939 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-10-22 11:24:15,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-10-22 11:24:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:24:15,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:15,942 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:16,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:16,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:16,144 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-10-22 11:24:16,144 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:16,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [528058023] [2019-10-22 11:24:16,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:16,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:16,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 11:24:16,246 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 11:24:16,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528058023] [2019-10-22 11:24:16,256 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:16,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:24:16,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084198628] [2019-10-22 11:24:16,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:16,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:16,257 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-10-22 11:24:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:16,310 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-10-22 11:24:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:16,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 11:24:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:16,313 INFO L225 Difference]: With dead ends: 869 [2019-10-22 11:24:16,313 INFO L226 Difference]: Without dead ends: 452 [2019-10-22 11:24:16,314 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-10-22 11:24:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-22 11:24:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-10-22 11:24:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-22 11:24:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-10-22 11:24:16,362 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-10-22 11:24:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:16,363 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-10-22 11:24:16,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-10-22 11:24:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 11:24:16,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:16,365 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-10-22 11:24:16,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:16,566 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:16,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-10-22 11:24:16,567 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:16,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [525428627] [2019-10-22 11:24:16,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:16,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:16,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 11:24:16,685 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-22 11:24:16,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525428627] [2019-10-22 11:24:16,701 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:16,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:24:16,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831102156] [2019-10-22 11:24:16,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:16,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:16,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:16,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:16,702 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-10-22 11:24:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:16,956 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-10-22 11:24:16,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:16,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-22 11:24:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:16,960 INFO L225 Difference]: With dead ends: 1066 [2019-10-22 11:24:16,962 INFO L226 Difference]: Without dead ends: 649 [2019-10-22 11:24:16,963 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-10-22 11:24:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-22 11:24:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-10-22 11:24:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-22 11:24:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-10-22 11:24:16,986 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-10-22 11:24:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:16,986 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-10-22 11:24:16,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-10-22 11:24:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-22 11:24:16,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:16,988 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-10-22 11:24:17,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:17,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-10-22 11:24:17,190 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:17,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [208101535] [2019-10-22 11:24:17,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:17,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:17,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-22 11:24:17,288 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-22 11:24:17,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [208101535] [2019-10-22 11:24:17,300 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:17,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:17,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272104039] [2019-10-22 11:24:17,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:17,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:17,301 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-10-22 11:24:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:17,445 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-10-22 11:24:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:17,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-22 11:24:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:17,448 INFO L225 Difference]: With dead ends: 1291 [2019-10-22 11:24:17,448 INFO L226 Difference]: Without dead ends: 697 [2019-10-22 11:24:17,449 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-10-22 11:24:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-10-22 11:24:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-10-22 11:24:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-22 11:24:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-10-22 11:24:17,468 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-10-22 11:24:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:17,468 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-10-22 11:24:17,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-10-22 11:24:17,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-22 11:24:17,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:17,470 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-10-22 11:24:17,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:17,671 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-10-22 11:24:17,671 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:17,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [774081880] [2019-10-22 11:24:17,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:17,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:17,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 11:24:17,784 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 11:24:17,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [774081880] [2019-10-22 11:24:17,801 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:17,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:17,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419239558] [2019-10-22 11:24:17,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:17,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:17,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:17,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:17,803 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-10-22 11:24:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:17,834 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-10-22 11:24:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:17,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-22 11:24:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:17,838 INFO L225 Difference]: With dead ends: 1565 [2019-10-22 11:24:17,838 INFO L226 Difference]: Without dead ends: 914 [2019-10-22 11:24:17,839 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-10-22 11:24:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-22 11:24:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-10-22 11:24:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-10-22 11:24:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-10-22 11:24:17,865 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-10-22 11:24:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:17,866 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-10-22 11:24:17,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-10-22 11:24:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-22 11:24:17,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:17,868 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-10-22 11:24:18,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:18,069 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-10-22 11:24:18,069 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:18,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [629329388] [2019-10-22 11:24:18,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:18,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-22 11:24:18,184 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-10-22 11:24:18,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [629329388] [2019-10-22 11:24:18,204 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:18,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126797833] [2019-10-22 11:24:18,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:18,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,206 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-10-22 11:24:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,383 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-10-22 11:24:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-22 11:24:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,388 INFO L225 Difference]: With dead ends: 1847 [2019-10-22 11:24:18,388 INFO L226 Difference]: Without dead ends: 989 [2019-10-22 11:24:18,390 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-10-22 11:24:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-10-22 11:24:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-10-22 11:24:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-10-22 11:24:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-10-22 11:24:18,436 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-10-22 11:24:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,437 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-10-22 11:24:18,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-10-22 11:24:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 11:24:18,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,440 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-10-22 11:24:18,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:18,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-10-22 11:24:18,641 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:18,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1949212617] [2019-10-22 11:24:18,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:18,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-22 11:24:18,764 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:18,782 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-22 11:24:18,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1949212617] [2019-10-22 11:24:18,783 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:18,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085588136] [2019-10-22 11:24:18,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:18,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:18,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:18,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:18,790 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-10-22 11:24:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,833 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-10-22 11:24:18,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:18,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 11:24:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,839 INFO L225 Difference]: With dead ends: 2432 [2019-10-22 11:24:18,839 INFO L226 Difference]: Without dead ends: 1511 [2019-10-22 11:24:18,841 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-10-22 11:24:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-10-22 11:24:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-10-22 11:24:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-10-22 11:24:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-10-22 11:24:18,887 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-10-22 11:24:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,887 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-10-22 11:24:18,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-10-22 11:24:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 11:24:18,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,891 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-10-22 11:24:19,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:19,092 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:19,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-10-22 11:24:19,092 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:19,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1769713129] [2019-10-22 11:24:19,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:19,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-22 11:24:19,228 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-22 11:24:19,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1769713129] [2019-10-22 11:24:19,252 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:19,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661580727] [2019-10-22 11:24:19,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:19,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:19,253 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-10-22 11:24:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,294 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-10-22 11:24:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:19,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-22 11:24:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,299 INFO L225 Difference]: With dead ends: 2354 [2019-10-22 11:24:19,299 INFO L226 Difference]: Without dead ends: 1513 [2019-10-22 11:24:19,300 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-10-22 11:24:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-10-22 11:24:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-10-22 11:24:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-10-22 11:24:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-10-22 11:24:19,342 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-10-22 11:24:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,343 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-10-22 11:24:19,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-10-22 11:24:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-22 11:24:19,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,346 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-10-22 11:24:19,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:19,547 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:19,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-10-22 11:24:19,547 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:19,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2479108] [2019-10-22 11:24:19,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:19,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 11:24:19,682 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-22 11:24:19,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2479108] [2019-10-22 11:24:19,702 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:19,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:24:19,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651983995] [2019-10-22 11:24:19,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:19,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:19,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:19,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:19,703 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-10-22 11:24:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,931 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-10-22 11:24:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:19,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-10-22 11:24:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,937 INFO L225 Difference]: With dead ends: 3056 [2019-10-22 11:24:19,937 INFO L226 Difference]: Without dead ends: 1603 [2019-10-22 11:24:19,939 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-10-22 11:24:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-10-22 11:24:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-10-22 11:24:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-22 11:24:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-10-22 11:24:19,990 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-10-22 11:24:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,991 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-10-22 11:24:19,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-10-22 11:24:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-22 11:24:19,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,995 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-10-22 11:24:20,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:20,196 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:20,196 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-10-22 11:24:20,197 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:20,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1604567558] [2019-10-22 11:24:20,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/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-10-22 11:24:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:20,867 INFO L168 tionRefinementEngine]: Strategy WALRUS found a feasible trace [2019-10-22 11:24:20,867 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:21,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:21,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:21 BoogieIcfgContainer [2019-10-22 11:24:21,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:21,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:21,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:21,161 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:21,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:13" (3/4) ... [2019-10-22 11:24:21,163 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:24:21,280 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c2dd64b0-8d57-4128-9ce7-7616f7ada83a/bin/utaipan/witness.graphml [2019-10-22 11:24:21,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:21,283 INFO L168 Benchmark]: Toolchain (without parser) took 8993.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -297.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:21,284 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:21,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:21,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:21,284 INFO L168 Benchmark]: Boogie Preprocessor took 39.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:21,284 INFO L168 Benchmark]: RCFGBuilder took 723.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:21,285 INFO L168 Benchmark]: TraceAbstraction took 7663.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:21,285 INFO L168 Benchmark]: Witness Printer took 121.36 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:21,286 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.66 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 723.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7663.89 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -176.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 121.36 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 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: 7.6s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2513 SDtfs, 1104 SDslu, 1676 SDs, 0 SdLazy, 922 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s 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...