./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_1.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_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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 8f0681106713dda8f6af7535e98def966db59035 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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 8f0681106713dda8f6af7535e98def966db59035 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:01,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:01,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:01,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:01,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:01,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:01,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:01,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:01,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:01,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:01,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:01,388 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:01,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:01,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:01,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:01,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:01,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:01,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:01,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:01,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:01,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:01,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:01,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:01,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:01,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:01,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:01,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:01,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:01,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:01,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:01,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:01,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:01,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:01,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:01,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:01,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:01,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:01,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:01,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:01,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:01,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:01,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:01,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:01,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:01,422 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:01,422 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:01,422 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:01,422 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:01,422 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:01,422 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:01,423 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:01,423 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:01,423 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:01,423 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:01,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:01,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:01,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:01,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:01,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:01,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:01,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:01,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:01,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:01,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:01,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:01,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:01,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:01,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:01,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:01,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:01,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:01,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:01,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:01,428 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:01,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:01,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:01,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:01,429 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_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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 -> 8f0681106713dda8f6af7535e98def966db59035 [2019-10-22 11:21:01,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:01,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:01,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:01,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:01,468 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:01,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c [2019-10-22 11:21:01,527 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/85315327d/e09452283f2845a9a1cf28494c4866cc/FLAG855786fae [2019-10-22 11:21:01,918 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:01,919 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c [2019-10-22 11:21:01,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/85315327d/e09452283f2845a9a1cf28494c4866cc/FLAG855786fae [2019-10-22 11:21:02,295 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/85315327d/e09452283f2845a9a1cf28494c4866cc [2019-10-22 11:21:02,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:02,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:02,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:02,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:02,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8cd93bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02, skipping insertion in model container [2019-10-22 11:21:02,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,314 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:02,346 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:02,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:02,603 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:02,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:02,686 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:02,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02 WrapperNode [2019-10-22 11:21:02,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:02,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:02,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:02,694 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:21:02" (1/1) ... [2019-10-22 11:21:02,702 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:21:02" (1/1) ... [2019-10-22 11:21:02,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:02,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:02,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:02,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:02,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:02,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:02,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:02,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:02,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:02,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:02,926 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:21:03,407 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 11:21:03,407 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 11:21:03,409 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:03,409 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:03,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03 BoogieIcfgContainer [2019-10-22 11:21:03,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:03,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:03,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:03,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:03,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:02" (1/3) ... [2019-10-22 11:21:03,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a37f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:03, skipping insertion in model container [2019-10-22 11:21:03,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02" (2/3) ... [2019-10-22 11:21:03,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a37f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:03, skipping insertion in model container [2019-10-22 11:21:03,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03" (3/3) ... [2019-10-22 11:21:03,417 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.BV.c.cil-2a.c [2019-10-22 11:21:03,428 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:03,435 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:03,444 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:03,465 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:03,465 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:03,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:03,466 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:03,466 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:03,466 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:03,466 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:03,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-22 11:21:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:03,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,488 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:21:03,490 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582915, now seen corresponding path program 1 times [2019-10-22 11:21:03,505 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:03,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259466796] [2019-10-22 11:21:03,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:03,649 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:21:03,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259466796] [2019-10-22 11:21:03,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:03,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:03,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838195902] [2019-10-22 11:21:03,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:03,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:03,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:03,668 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-10-22 11:21:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:03,824 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-10-22 11:21:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:03,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:21:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:03,837 INFO L225 Difference]: With dead ends: 247 [2019-10-22 11:21:03,837 INFO L226 Difference]: Without dead ends: 112 [2019-10-22 11:21:03,840 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:21:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-22 11:21:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-22 11:21:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 11:21:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-10-22 11:21:03,879 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 23 [2019-10-22 11:21:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:03,879 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-10-22 11:21:03,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-10-22 11:21:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:03,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,881 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:03,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1463943324, now seen corresponding path program 1 times [2019-10-22 11:21:03,882 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:03,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902291010] [2019-10-22 11:21:03,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:03,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:03,939 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:21:03,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902291010] [2019-10-22 11:21:03,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:03,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:03,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493076684] [2019-10-22 11:21:03,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:03,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:03,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:03,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:03,948 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-10-22 11:21:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,077 INFO L93 Difference]: Finished difference Result 233 states and 355 transitions. [2019-10-22 11:21:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:21:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,079 INFO L225 Difference]: With dead ends: 233 [2019-10-22 11:21:04,079 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:21:04,080 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:21:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:21:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-10-22 11:21:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-22 11:21:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-10-22 11:21:04,090 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-10-22 11:21:04,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,090 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-10-22 11:21:04,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-10-22 11:21:04,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:21:04,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,092 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, 1] [2019-10-22 11:21:04,092 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1876827341, now seen corresponding path program 1 times [2019-10-22 11:21:04,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625917026] [2019-10-22 11:21:04,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,093 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,149 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:21:04,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625917026] [2019-10-22 11:21:04,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:04,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141100756] [2019-10-22 11:21:04,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,151 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-10-22 11:21:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,259 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2019-10-22 11:21:04,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 11:21:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,262 INFO L225 Difference]: With dead ends: 266 [2019-10-22 11:21:04,262 INFO L226 Difference]: Without dead ends: 148 [2019-10-22 11:21:04,263 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:21:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-22 11:21:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-10-22 11:21:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-22 11:21:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-10-22 11:21:04,272 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-10-22 11:21:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,273 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-10-22 11:21:04,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-10-22 11:21:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:21:04,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,274 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:21:04,274 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,275 INFO L82 PathProgramCache]: Analyzing trace with hash -708368503, now seen corresponding path program 1 times [2019-10-22 11:21:04,275 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964554977] [2019-10-22 11:21:04,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,339 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:21:04,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964554977] [2019-10-22 11:21:04,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:04,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558198245] [2019-10-22 11:21:04,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,341 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 3 states. [2019-10-22 11:21:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,521 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-10-22 11:21:04,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 11:21:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,523 INFO L225 Difference]: With dead ends: 330 [2019-10-22 11:21:04,523 INFO L226 Difference]: Without dead ends: 194 [2019-10-22 11:21:04,524 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:21:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-22 11:21:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2019-10-22 11:21:04,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-22 11:21:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2019-10-22 11:21:04,535 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 67 [2019-10-22 11:21:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,535 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2019-10-22 11:21:04,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2019-10-22 11:21:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:21:04,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,537 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:21:04,537 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1781160459, now seen corresponding path program 1 times [2019-10-22 11:21:04,538 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409910237] [2019-10-22 11:21:04,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,592 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:21:04,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409910237] [2019-10-22 11:21:04,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:04,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067160924] [2019-10-22 11:21:04,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,595 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand 3 states. [2019-10-22 11:21:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,766 INFO L93 Difference]: Finished difference Result 384 states and 549 transitions. [2019-10-22 11:21:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 11:21:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,768 INFO L225 Difference]: With dead ends: 384 [2019-10-22 11:21:04,768 INFO L226 Difference]: Without dead ends: 208 [2019-10-22 11:21:04,769 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:21:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-22 11:21:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-10-22 11:21:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-10-22 11:21:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2019-10-22 11:21:04,779 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 67 [2019-10-22 11:21:04,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,780 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2019-10-22 11:21:04,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2019-10-22 11:21:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 11:21:04,782 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,782 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, 1] [2019-10-22 11:21:04,782 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1647185185, now seen corresponding path program 1 times [2019-10-22 11:21:04,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255558170] [2019-10-22 11:21:04,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,838 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:21:04,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255558170] [2019-10-22 11:21:04,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:04,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843223819] [2019-10-22 11:21:04,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,840 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand 3 states. [2019-10-22 11:21:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,974 INFO L93 Difference]: Finished difference Result 423 states and 599 transitions. [2019-10-22 11:21:04,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 11:21:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,976 INFO L225 Difference]: With dead ends: 423 [2019-10-22 11:21:04,976 INFO L226 Difference]: Without dead ends: 228 [2019-10-22 11:21:04,977 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:21:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-22 11:21:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2019-10-22 11:21:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-22 11:21:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2019-10-22 11:21:04,999 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 83 [2019-10-22 11:21:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,000 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2019-10-22 11:21:05,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2019-10-22 11:21:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 11:21:05,001 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,002 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] [2019-10-22 11:21:05,002 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash -629532647, now seen corresponding path program 1 times [2019-10-22 11:21:05,002 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628383636] [2019-10-22 11:21:05,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,082 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:21:05,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628383636] [2019-10-22 11:21:05,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:05,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540754178] [2019-10-22 11:21:05,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:05,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,085 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand 3 states. [2019-10-22 11:21:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,121 INFO L93 Difference]: Finished difference Result 655 states and 906 transitions. [2019-10-22 11:21:05,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-22 11:21:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,123 INFO L225 Difference]: With dead ends: 655 [2019-10-22 11:21:05,123 INFO L226 Difference]: Without dead ends: 439 [2019-10-22 11:21:05,124 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:21:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-22 11:21:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-10-22 11:21:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-22 11:21:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 605 transitions. [2019-10-22 11:21:05,145 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 605 transitions. Word has length 103 [2019-10-22 11:21:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,145 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 605 transitions. [2019-10-22 11:21:05,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 605 transitions. [2019-10-22 11:21:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 11:21:05,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,150 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, 1] [2019-10-22 11:21:05,151 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,151 INFO L82 PathProgramCache]: Analyzing trace with hash -548026749, now seen corresponding path program 1 times [2019-10-22 11:21:05,151 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284294812] [2019-10-22 11:21:05,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,240 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:21:05,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284294812] [2019-10-22 11:21:05,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:05,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904023596] [2019-10-22 11:21:05,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:05,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:05,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,242 INFO L87 Difference]: Start difference. First operand 439 states and 605 transitions. Second operand 3 states. [2019-10-22 11:21:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,291 INFO L93 Difference]: Finished difference Result 655 states and 903 transitions. [2019-10-22 11:21:05,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 11:21:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,294 INFO L225 Difference]: With dead ends: 655 [2019-10-22 11:21:05,294 INFO L226 Difference]: Without dead ends: 653 [2019-10-22 11:21:05,295 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:21:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-22 11:21:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-10-22 11:21:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-22 11:21:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 901 transitions. [2019-10-22 11:21:05,323 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 901 transitions. Word has length 105 [2019-10-22 11:21:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,323 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 901 transitions. [2019-10-22 11:21:05,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 901 transitions. [2019-10-22 11:21:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-22 11:21:05,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,326 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,326 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash 51406530, now seen corresponding path program 1 times [2019-10-22 11:21:05,326 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192342107] [2019-10-22 11:21:05,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,327 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,342 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:21:05,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917080220] [2019-10-22 11:21:05,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:21:05,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 11:21:05,451 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 11:21:05,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192342107] [2019-10-22 11:21:05,467 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 11:21:05,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917080220] [2019-10-22 11:21:05,467 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:05,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321198393] [2019-10-22 11:21:05,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:05,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,469 INFO L87 Difference]: Start difference. First operand 653 states and 901 transitions. Second operand 3 states. [2019-10-22 11:21:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,597 INFO L93 Difference]: Finished difference Result 1377 states and 1926 transitions. [2019-10-22 11:21:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-22 11:21:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,600 INFO L225 Difference]: With dead ends: 1377 [2019-10-22 11:21:05,600 INFO L226 Difference]: Without dead ends: 733 [2019-10-22 11:21:05,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 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:21:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-22 11:21:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 722. [2019-10-22 11:21:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-22 11:21:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 985 transitions. [2019-10-22 11:21:05,616 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 985 transitions. Word has length 130 [2019-10-22 11:21:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,616 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 985 transitions. [2019-10-22 11:21:05,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 985 transitions. [2019-10-22 11:21:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-22 11:21:05,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,618 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:05,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:05,819 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash -837503083, now seen corresponding path program 1 times [2019-10-22 11:21:05,820 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:05,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564340187] [2019-10-22 11:21:05,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:05,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:05,831 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 11:21:05,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845677021] [2019-10-22 11:21:05,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:06,125 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:06,126 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:06,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:06,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:06 BoogieIcfgContainer [2019-10-22 11:21:06,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:06,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:06,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:06,406 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:06,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03" (3/4) ... [2019-10-22 11:21:06,411 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:21:06,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:06,413 INFO L168 Benchmark]: Toolchain (without parser) took 4113.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 948.5 MB in the beginning and 1.0 GB in the end (delta: -70.5 MB). Peak memory consumption was 136.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:06,413 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:06,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:06,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.94 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:06,414 INFO L168 Benchmark]: Boogie Preprocessor took 43.86 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:21:06,414 INFO L168 Benchmark]: RCFGBuilder took 632.36 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: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:06,415 INFO L168 Benchmark]: TraceAbstraction took 2994.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.9 MB). Peak memory consumption was 120.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:06,415 INFO L168 Benchmark]: Witness Printer took 4.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:06,417 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.94 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.86 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 632.36 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: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2994.61 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.9 MB). Peak memory consumption was 120.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 619]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 219. Possible FailurePath: [L628] 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] int s__version = __VERIFIER_nondet_int(); [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] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L28] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [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] int tmp___1 ; [L52] int tmp___2 ; [L53] int tmp___3 ; [L54] int tmp___4 ; [L55] int tmp___5 ; [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 ; [L63] int ag_Z = __VERIFIER_nondet_int(); [L64] unsigned int ag_V ; [L65] unsigned int ag_W ; [L66] int __retres62 ; [L69] ag_V = 2U [L70] ag_W = 5U [L71] s__state = 12292 [L72] blastFlag = 0 [L73] tmp = __VERIFIER_nondet_int() [L74] cb = 0 [L75] ret = -1 [L76] skip = 0 [L77] tmp___0 = 0 [L78] COND TRUE s__info_callback != 0 [L79] cb = s__info_callback [L87] s__in_handshake = s__in_handshake + 1 [L88] tmp___1 = __VERIFIER_nondet_int() [L89] COND FALSE !(tmp___1 & 12288) [L100] COND TRUE 1 [L102] state = s__state [L103] COND TRUE s__state == 12292 [L206] s__new_session = 1 [L207] s__state = 4096 [L208] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L213] s__server = 0 [L214] COND TRUE cb != 0 [L219] COND FALSE !((s__version & 65280) != 768) [L225] s__type = 4096 [L226] COND FALSE !(s__init_buf___0 == 0) [L245] tmp___4 = __VERIFIER_nondet_int() [L246] COND FALSE !(! tmp___4) [L252] tmp___5 = __VERIFIER_nondet_int() [L253] COND FALSE !(! tmp___5) [L259] s__state = 4368 [L260] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L261] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND TRUE s__state == 4368 [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND TRUE blastFlag == 0 [L268] blastFlag = 1 [L272] COND FALSE !(ret <= 0) [L277] s__state = 4384 [L278] s__init_num = 0 [L279] COND TRUE s__bbio != s__wbio [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND TRUE s__state == 4384 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L298] COND FALSE !(\read(s__hit)) [L301] s__state = 4400 [L303] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND TRUE s__state == 4400 [L307] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L310] ret = __VERIFIER_nondet_int() [L311] COND TRUE blastFlag == 2 [L312] blastFlag = 3 [L316] COND FALSE !(ret <= 0) [L322] s__state = 4416 [L323] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND TRUE s__state == 4416 [L327] ret = __VERIFIER_nondet_int() [L328] COND TRUE blastFlag == 3 [L329] blastFlag = 4 [L333] COND FALSE !(ret <= 0) [L338] s__state = 4432 [L339] s__init_num = 0 [L340] COND FALSE !(! tmp___6) [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND TRUE s__state == 4432 [L349] ret = __VERIFIER_nondet_int() [L350] COND FALSE !(blastFlag == 5) [L355] COND FALSE !(ret <= 0) [L360] s__state = 4448 [L361] ag_X = 44 [L362] ag_Y = 100 [L363] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND FALSE !(s__state == 4432) [L145] COND FALSE !(s__state == 4433) [L148] COND TRUE s__state == 4448 [L367] ret = __VERIFIER_nondet_int() [L368] COND TRUE blastFlag == 4 [L369] blastFlag = 5 [L373] COND FALSE !(ret <= 0) [L378] COND TRUE \read(s__s3__tmp__cert_req) [L379] s__state = ag_X * ag_Y + ag_Z [L383] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND TRUE s__state == 4432 [L349] ret = __VERIFIER_nondet_int() [L350] COND TRUE blastFlag == 5 [L619] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1540 SDtfs, 402 SDslu, 859 SDs, 0 SdLazy, 738 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 34 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 784 ConstructedInterpolants, 0 QuantifiedInterpolants, 105326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 867/867 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:21:08,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:08,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:08,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:08,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:08,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:08,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:08,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:08,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:08,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:08,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:08,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:08,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:08,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:08,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:08,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:08,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:08,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:08,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:08,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:08,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:08,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:08,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:08,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:08,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:08,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:08,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:08,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:08,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:08,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:08,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:08,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:08,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:08,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:08,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:08,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:08,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:08,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:08,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:08,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:08,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:08,456 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:08,470 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:08,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:08,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:08,480 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:08,480 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:08,480 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:08,481 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:08,481 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:08,481 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:08,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:08,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:08,482 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:08,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:08,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:08,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:08,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:08,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:08,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:08,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:08,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:08,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:08,489 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_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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 -> 8f0681106713dda8f6af7535e98def966db59035 [2019-10-22 11:21:08,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:08,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:08,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:08,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:08,539 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:08,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/../../sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c [2019-10-22 11:21:08,591 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/a3205e2d3/c4f8409df056412f863d8bd109016c2a/FLAG3a664a0bc [2019-10-22 11:21:09,012 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:09,018 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/sv-benchmarks/c/bitvector/s3_clnt_1.BV.c.cil-2a.c [2019-10-22 11:21:09,026 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/a3205e2d3/c4f8409df056412f863d8bd109016c2a/FLAG3a664a0bc [2019-10-22 11:21:09,038 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/data/a3205e2d3/c4f8409df056412f863d8bd109016c2a [2019-10-22 11:21:09,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:09,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:09,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:09,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:09,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:09,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f513c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09, skipping insertion in model container [2019-10-22 11:21:09,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,057 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:09,090 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:09,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:09,347 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:09,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:09,491 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:09,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09 WrapperNode [2019-10-22 11:21:09,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:09,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:09,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:09,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:09,498 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:21:09" (1/1) ... [2019-10-22 11:21:09,504 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:21:09" (1/1) ... [2019-10-22 11:21:09,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:09,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:09,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:09,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:09,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... [2019-10-22 11:21:09,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:09,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:09,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:09,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:09,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:09,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:09,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:09,701 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:21:10,097 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 11:21:10,097 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 11:21:10,098 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:10,099 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:10,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:10 BoogieIcfgContainer [2019-10-22 11:21:10,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:10,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:10,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:10,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:10,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:09" (1/3) ... [2019-10-22 11:21:10,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b73d238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:10, skipping insertion in model container [2019-10-22 11:21:10,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:09" (2/3) ... [2019-10-22 11:21:10,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b73d238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:10, skipping insertion in model container [2019-10-22 11:21:10,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:10" (3/3) ... [2019-10-22 11:21:10,106 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.BV.c.cil-2a.c [2019-10-22 11:21:10,115 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:10,121 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:10,131 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:10,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:10,152 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:10,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:10,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:10,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:10,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:10,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:10,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-22 11:21:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:21:10,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:10,175 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:21:10,177 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582915, now seen corresponding path program 1 times [2019-10-22 11:21:10,191 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:10,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1249447351] [2019-10-22 11:21:10,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:10,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:10,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:10,387 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:21:10,387 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:10,394 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:21:10,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1249447351] [2019-10-22 11:21:10,395 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:10,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:21:10,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242080561] [2019-10-22 11:21:10,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:10,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:10,414 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-10-22 11:21:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,599 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-10-22 11:21:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:10,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:21:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,611 INFO L225 Difference]: With dead ends: 247 [2019-10-22 11:21:10,611 INFO L226 Difference]: Without dead ends: 112 [2019-10-22 11:21:10,614 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:21:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-22 11:21:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-22 11:21:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-22 11:21:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2019-10-22 11:21:10,652 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 23 [2019-10-22 11:21:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:10,653 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2019-10-22 11:21:10,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2019-10-22 11:21:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:21:10,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:10,654 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:10,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:10,855 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1463943324, now seen corresponding path program 1 times [2019-10-22 11:21:10,857 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:10,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [991361819] [2019-10-22 11:21:10,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:10,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:10,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:10,994 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:21:10,995 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:11,002 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:21:11,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991361819] [2019-10-22 11:21:11,006 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:11,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:11,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290724407] [2019-10-22 11:21:11,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:11,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:11,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:11,010 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand 3 states. [2019-10-22 11:21:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:11,208 INFO L93 Difference]: Finished difference Result 233 states and 355 transitions. [2019-10-22 11:21:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:11,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:21:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:11,211 INFO L225 Difference]: With dead ends: 233 [2019-10-22 11:21:11,212 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:21:11,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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:21:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:21:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-10-22 11:21:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-22 11:21:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2019-10-22 11:21:11,229 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2019-10-22 11:21:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:11,229 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2019-10-22 11:21:11,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2019-10-22 11:21:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:21:11,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:11,231 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, 1] [2019-10-22 11:21:11,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:11,432 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1876827341, now seen corresponding path program 1 times [2019-10-22 11:21:11,433 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:11,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [951306446] [2019-10-22 11:21:11,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:11,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:11,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:11,555 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:21:11,555 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:11,562 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:21:11,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [951306446] [2019-10-22 11:21:11,563 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:11,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:11,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595167623] [2019-10-22 11:21:11,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:11,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:11,564 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand 3 states. [2019-10-22 11:21:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:11,733 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2019-10-22 11:21:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:11,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 11:21:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:11,736 INFO L225 Difference]: With dead ends: 266 [2019-10-22 11:21:11,736 INFO L226 Difference]: Without dead ends: 148 [2019-10-22 11:21:11,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:21:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-22 11:21:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-10-22 11:21:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-22 11:21:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2019-10-22 11:21:11,752 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2019-10-22 11:21:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:11,752 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2019-10-22 11:21:11,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2019-10-22 11:21:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:21:11,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:11,754 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:21:11,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:11,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:11,955 INFO L82 PathProgramCache]: Analyzing trace with hash -708368503, now seen corresponding path program 1 times [2019-10-22 11:21:11,956 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:11,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [151747677] [2019-10-22 11:21:11,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:12,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:12,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:12,071 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:21:12,072 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:12,090 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:21:12,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [151747677] [2019-10-22 11:21:12,091 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:12,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:12,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829519474] [2019-10-22 11:21:12,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:12,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:12,094 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand 4 states. [2019-10-22 11:21:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:12,164 INFO L93 Difference]: Finished difference Result 543 states and 801 transitions. [2019-10-22 11:21:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:12,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-10-22 11:21:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:12,167 INFO L225 Difference]: With dead ends: 543 [2019-10-22 11:21:12,167 INFO L226 Difference]: Without dead ends: 408 [2019-10-22 11:21:12,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 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:21:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-22 11:21:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-10-22 11:21:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-22 11:21:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 596 transitions. [2019-10-22 11:21:12,202 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 596 transitions. Word has length 67 [2019-10-22 11:21:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:12,202 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 596 transitions. [2019-10-22 11:21:12,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 596 transitions. [2019-10-22 11:21:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:12,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:12,206 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:12,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:12,406 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash -995531590, now seen corresponding path program 1 times [2019-10-22 11:21:12,407 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:12,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [697214688] [2019-10-22 11:21:12,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:12,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:12,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 11:21:12,508 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-22 11:21:12,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697214688] [2019-10-22 11:21:12,521 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:12,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:12,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602588069] [2019-10-22 11:21:12,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:12,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:12,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:12,523 INFO L87 Difference]: Start difference. First operand 408 states and 596 transitions. Second operand 3 states. [2019-10-22 11:21:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:12,559 INFO L93 Difference]: Finished difference Result 828 states and 1207 transitions. [2019-10-22 11:21:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:12,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 11:21:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:12,561 INFO L225 Difference]: With dead ends: 828 [2019-10-22 11:21:12,562 INFO L226 Difference]: Without dead ends: 429 [2019-10-22 11:21:12,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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:21:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-10-22 11:21:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-10-22 11:21:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-10-22 11:21:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 623 transitions. [2019-10-22 11:21:12,594 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 623 transitions. Word has length 92 [2019-10-22 11:21:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:12,595 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 623 transitions. [2019-10-22 11:21:12,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 623 transitions. [2019-10-22 11:21:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:12,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:12,597 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:12,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:12,798 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:12,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1727499016, now seen corresponding path program 1 times [2019-10-22 11:21:12,799 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:12,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [70782356] [2019-10-22 11:21:12,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:12,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:12,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-22 11:21:12,938 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-22 11:21:12,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [70782356] [2019-10-22 11:21:12,947 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:12,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:21:12,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204810691] [2019-10-22 11:21:12,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:12,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:12,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:12,949 INFO L87 Difference]: Start difference. First operand 429 states and 623 transitions. Second operand 3 states. [2019-10-22 11:21:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:12,976 INFO L93 Difference]: Finished difference Result 876 states and 1268 transitions. [2019-10-22 11:21:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:12,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 11:21:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:12,978 INFO L225 Difference]: With dead ends: 876 [2019-10-22 11:21:12,978 INFO L226 Difference]: Without dead ends: 456 [2019-10-22 11:21:12,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 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:21:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-22 11:21:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-10-22 11:21:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-22 11:21:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 657 transitions. [2019-10-22 11:21:12,992 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 657 transitions. Word has length 92 [2019-10-22 11:21:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:12,992 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 657 transitions. [2019-10-22 11:21:12,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 657 transitions. [2019-10-22 11:21:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-22 11:21:12,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:12,995 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:13,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:13,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:13,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:13,196 INFO L82 PathProgramCache]: Analyzing trace with hash 198697340, now seen corresponding path program 1 times [2019-10-22 11:21:13,196 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:13,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1655073046] [2019-10-22 11:21:13,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:13,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:13,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-22 11:21:13,335 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-22 11:21:13,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1655073046] [2019-10-22 11:21:13,352 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:13,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:13,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991808243] [2019-10-22 11:21:13,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:13,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:13,354 INFO L87 Difference]: Start difference. First operand 456 states and 657 transitions. Second operand 3 states. [2019-10-22 11:21:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:13,527 INFO L93 Difference]: Finished difference Result 948 states and 1392 transitions. [2019-10-22 11:21:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:13,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-10-22 11:21:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:13,535 INFO L225 Difference]: With dead ends: 948 [2019-10-22 11:21:13,535 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 11:21:13,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 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:21:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 11:21:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 519. [2019-10-22 11:21:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-22 11:21:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 735 transitions. [2019-10-22 11:21:13,551 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 735 transitions. Word has length 110 [2019-10-22 11:21:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:13,552 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 735 transitions. [2019-10-22 11:21:13,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 735 transitions. [2019-10-22 11:21:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-22 11:21:13,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:13,554 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:13,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:13,755 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2009981316, now seen corresponding path program 1 times [2019-10-22 11:21:13,756 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:13,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1658156471] [2019-10-22 11:21:13,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:13,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:13,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 11:21:13,879 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-22 11:21:13,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1658156471] [2019-10-22 11:21:13,897 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:13,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:13,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481845595] [2019-10-22 11:21:13,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:13,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:13,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:13,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:13,898 INFO L87 Difference]: Start difference. First operand 519 states and 735 transitions. Second operand 3 states. [2019-10-22 11:21:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:14,051 INFO L93 Difference]: Finished difference Result 1081 states and 1559 transitions. [2019-10-22 11:21:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:14,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-22 11:21:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:14,053 INFO L225 Difference]: With dead ends: 1081 [2019-10-22 11:21:14,054 INFO L226 Difference]: Without dead ends: 598 [2019-10-22 11:21:14,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 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:21:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-22 11:21:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 588. [2019-10-22 11:21:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-22 11:21:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 819 transitions. [2019-10-22 11:21:14,072 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 819 transitions. Word has length 130 [2019-10-22 11:21:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 819 transitions. [2019-10-22 11:21:14,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 819 transitions. [2019-10-22 11:21:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-22 11:21:14,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,077 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:14,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:14,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1304357395, now seen corresponding path program 1 times [2019-10-22 11:21:14,279 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:14,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1162928081] [2019-10-22 11:21:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:14,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:14,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-22 11:21:14,396 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-22 11:21:14,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1162928081] [2019-10-22 11:21:14,417 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:14,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:14,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123278382] [2019-10-22 11:21:14,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:14,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:14,418 INFO L87 Difference]: Start difference. First operand 588 states and 819 transitions. Second operand 4 states. [2019-10-22 11:21:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:14,651 INFO L93 Difference]: Finished difference Result 1340 states and 1949 transitions. [2019-10-22 11:21:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:14,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-22 11:21:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:14,655 INFO L225 Difference]: With dead ends: 1340 [2019-10-22 11:21:14,656 INFO L226 Difference]: Without dead ends: 788 [2019-10-22 11:21:14,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 298 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:21:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-22 11:21:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 768. [2019-10-22 11:21:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-10-22 11:21:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1056 transitions. [2019-10-22 11:21:14,679 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1056 transitions. Word has length 151 [2019-10-22 11:21:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:14,679 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1056 transitions. [2019-10-22 11:21:14,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1056 transitions. [2019-10-22 11:21:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-22 11:21:14,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,684 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:14,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:14,885 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash -837503083, now seen corresponding path program 1 times [2019-10-22 11:21:14,886 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:14,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1917589787] [2019-10-22 11:21:14,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/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:21:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:15,454 INFO L168 tionRefinementEngine]: Strategy WALRUS found a feasible trace [2019-10-22 11:21:15,455 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:15,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:15,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:15 BoogieIcfgContainer [2019-10-22 11:21:15,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:15,730 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:15,730 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:15,730 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:15,731 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:10" (3/4) ... [2019-10-22 11:21:15,733 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:15,853 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_dda81009-ca06-4135-bf0b-b7c7469f4a9b/bin/utaipan/witness.graphml [2019-10-22 11:21:15,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:15,855 INFO L168 Benchmark]: Toolchain (without parser) took 6813.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.8 MB). Free memory was 949.7 MB in the beginning and 1.3 GB in the end (delta: -320.8 MB). Peak memory consumption was 348.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:15,855 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:15,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:15,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.17 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:21:15,856 INFO L168 Benchmark]: Boogie Preprocessor took 34.01 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:21:15,856 INFO L168 Benchmark]: RCFGBuilder took 532.84 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:15,857 INFO L168 Benchmark]: TraceAbstraction took 5629.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 819.5 MB in the end (delta: 269.2 MB). Peak memory consumption was 333.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:15,857 INFO L168 Benchmark]: Witness Printer took 123.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 819.5 MB in the beginning and 1.3 GB in the end (delta: -451.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:15,858 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.01 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 532.84 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: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5629.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 819.5 MB in the end (delta: 269.2 MB). Peak memory consumption was 333.7 MB. Max. memory is 11.5 GB. * Witness Printer took 123.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 819.5 MB in the beginning and 1.3 GB in the end (delta: -451.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 619]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L628] 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] int s__version = __VERIFIER_nondet_int(); [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] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int(); [L28] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int(); [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] int tmp___1 ; [L52] int tmp___2 ; [L53] int tmp___3 ; [L54] int tmp___4 ; [L55] int tmp___5 ; [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 ; [L63] int ag_Z = __VERIFIER_nondet_int(); [L64] unsigned int ag_V ; [L65] unsigned int ag_W ; [L66] int __retres62 ; [L69] ag_V = 2U [L70] ag_W = 5U [L71] s__state = 12292 [L72] blastFlag = 0 [L73] tmp = __VERIFIER_nondet_int() [L74] cb = 0 [L75] ret = -1 [L76] skip = 0 [L77] tmp___0 = 0 [L78] COND TRUE s__info_callback != 0 [L79] cb = s__info_callback [L87] s__in_handshake = s__in_handshake + 1 [L88] tmp___1 = __VERIFIER_nondet_int() [L89] COND FALSE !(tmp___1 & 12288) [L100] COND TRUE 1 [L102] state = s__state [L103] COND TRUE s__state == 12292 [L206] s__new_session = 1 [L207] s__state = 4096 [L208] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L213] s__server = 0 [L214] COND TRUE cb != 0 [L219] COND FALSE !((s__version & 65280) != 768) [L225] s__type = 4096 [L226] COND FALSE !(s__init_buf___0 == 0) [L245] tmp___4 = __VERIFIER_nondet_int() [L246] COND FALSE !(! tmp___4) [L252] tmp___5 = __VERIFIER_nondet_int() [L253] COND FALSE !(! tmp___5) [L259] s__state = 4368 [L260] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L261] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND TRUE s__state == 4368 [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND TRUE blastFlag == 0 [L268] blastFlag = 1 [L272] COND FALSE !(ret <= 0) [L277] s__state = 4384 [L278] s__init_num = 0 [L279] COND TRUE s__bbio != s__wbio [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND TRUE s__state == 4384 [L287] ret = __VERIFIER_nondet_int() [L288] COND TRUE blastFlag == 1 [L289] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L298] COND FALSE !(\read(s__hit)) [L301] s__state = 4400 [L303] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND TRUE s__state == 4400 [L307] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L310] ret = __VERIFIER_nondet_int() [L311] COND TRUE blastFlag == 2 [L312] blastFlag = 3 [L316] COND FALSE !(ret <= 0) [L322] s__state = 4416 [L323] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND TRUE s__state == 4416 [L327] ret = __VERIFIER_nondet_int() [L328] COND TRUE blastFlag == 3 [L329] blastFlag = 4 [L333] COND FALSE !(ret <= 0) [L338] s__state = 4432 [L339] s__init_num = 0 [L340] COND FALSE !(! tmp___6) [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND TRUE s__state == 4432 [L349] ret = __VERIFIER_nondet_int() [L350] COND FALSE !(blastFlag == 5) [L355] COND FALSE !(ret <= 0) [L360] s__state = 4448 [L361] ag_X = 44 [L362] ag_Y = 100 [L363] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND FALSE !(s__state == 4432) [L145] COND FALSE !(s__state == 4433) [L148] COND TRUE s__state == 4448 [L367] ret = __VERIFIER_nondet_int() [L368] COND TRUE blastFlag == 4 [L369] blastFlag = 5 [L373] COND FALSE !(ret <= 0) [L378] COND TRUE \read(s__s3__tmp__cert_req) [L379] s__state = ag_X * ag_Y + ag_Z [L383] s__init_num = 0 [L577] COND FALSE !(! s__s3__tmp__reuse_message) [L606] skip = 0 [L100] COND TRUE 1 [L102] state = s__state [L103] COND FALSE !(s__state == 12292) [L106] COND FALSE !(s__state == 16384) [L109] COND FALSE !(s__state == 4096) [L112] COND FALSE !(s__state == 20480) [L115] COND FALSE !(s__state == 4099) [L118] COND FALSE !(s__state == 4368) [L121] COND FALSE !(s__state == 4369) [L124] COND FALSE !(s__state == 4384) [L127] COND FALSE !(s__state == 4385) [L130] COND FALSE !(s__state == 4400) [L133] COND FALSE !(s__state == 4401) [L136] COND FALSE !(s__state == 4416) [L139] COND FALSE !(s__state == 4417) [L142] COND TRUE s__state == 4432 [L349] ret = __VERIFIER_nondet_int() [L350] COND TRUE blastFlag == 5 [L619] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1564 SDtfs, 598 SDslu, 1118 SDs, 0 SdLazy, 724 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1484 GetRequests, 1473 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=768occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1484 ConstructedInterpolants, 0 QuantifiedInterpolants, 208012 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1170 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 1748/1748 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...