./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/vogal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/vogal-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/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 fb43643cd35c65185f84c332fba8bb38d564a0a2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-26 02:00:27,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:00:27,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:00:27,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:00:27,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:00:27,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:00:27,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:00:27,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:00:27,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:00:27,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:00:27,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:00:27,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:00:27,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:00:27,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:00:27,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:00:27,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:00:27,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:00:27,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:00:27,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:00:27,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:00:27,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:00:27,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:00:27,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:00:27,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:00:27,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:00:27,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:00:27,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:00:27,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:00:27,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:00:27,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:00:27,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:00:27,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:00:27,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:00:27,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:00:27,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:00:27,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:00:27,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:00:27,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:00:27,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:00:27,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:00:27,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:00:27,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:00:27,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:00:27,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:00:27,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:00:27,961 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:00:27,961 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:00:27,961 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:00:27,961 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:00:27,962 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:00:27,962 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:00:27,962 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:00:27,962 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:00:27,963 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:00:27,963 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:00:27,963 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:00:27,963 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:00:27,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:00:27,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:00:27,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:00:27,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:00:27,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:00:27,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:00:27,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:00:27,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:00:27,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:00:27,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:00:27,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:00:27,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:00:27,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:00:27,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:00:27,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:00:27,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:00:27,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:00:27,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:00:27,971 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:00:27,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:00:27,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:00:27,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:00:27,972 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/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/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 -> fb43643cd35c65185f84c332fba8bb38d564a0a2 [2019-11-26 02:00:28,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:00:28,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:00:28,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:00:28,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:00:28,116 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:00:28,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/../../sv-benchmarks/c/loops/vogal-2.i [2019-11-26 02:00:28,168 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/data/fd8f45641/ddf6ed426ecb40558ebf9d607811005e/FLAG51da4f514 [2019-11-26 02:00:28,503 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:00:28,503 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/sv-benchmarks/c/loops/vogal-2.i [2019-11-26 02:00:28,509 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/data/fd8f45641/ddf6ed426ecb40558ebf9d607811005e/FLAG51da4f514 [2019-11-26 02:00:28,882 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/data/fd8f45641/ddf6ed426ecb40558ebf9d607811005e [2019-11-26 02:00:28,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:00:28,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:00:28,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:00:28,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:00:28,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:00:28,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:00:28" (1/1) ... [2019-11-26 02:00:28,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae243be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:28, skipping insertion in model container [2019-11-26 02:00:28,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:00:28" (1/1) ... [2019-11-26 02:00:28,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:00:28,911 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:00:29,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:00:29,061 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:00:29,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:00:29,187 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:00:29,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29 WrapperNode [2019-11-26 02:00:29,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:00:29,189 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:00:29,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:00:29,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:00:29,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,204 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:00:29,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:00:29,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:00:29,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:00:29,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... [2019-11-26 02:00:29,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:00:29,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:00:29,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:00:29,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:00:29,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/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-11-26 02:00:29,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:00:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:00:29,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:00:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:00:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:00:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:00:29,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:00:29,730 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:00:29,730 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-26 02:00:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:00:29 BoogieIcfgContainer [2019-11-26 02:00:29,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:00:29,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:00:29,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:00:29,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:00:29,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:00:28" (1/3) ... [2019-11-26 02:00:29,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12da1a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:00:29, skipping insertion in model container [2019-11-26 02:00:29,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:00:29" (2/3) ... [2019-11-26 02:00:29,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12da1a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:00:29, skipping insertion in model container [2019-11-26 02:00:29,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:00:29" (3/3) ... [2019-11-26 02:00:29,738 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-2.i [2019-11-26 02:00:29,746 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:00:29,752 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:00:29,761 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:00:29,780 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:00:29,780 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:00:29,780 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:00:29,780 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:00:29,780 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:00:29,781 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:00:29,781 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:00:29,781 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:00:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-11-26 02:00:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:00:29,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:29,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:29,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:29,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1529699898, now seen corresponding path program 1 times [2019-11-26 02:00:29,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:29,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087542277] [2019-11-26 02:00:29,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:00:29,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087542277] [2019-11-26 02:00:29,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:00:29,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:00:29,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938664180] [2019-11-26 02:00:29,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:00:29,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:29,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:00:29,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:00:29,947 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2019-11-26 02:00:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:29,959 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2019-11-26 02:00:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:00:29,960 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-26 02:00:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:29,966 INFO L225 Difference]: With dead ends: 28 [2019-11-26 02:00:29,966 INFO L226 Difference]: Without dead ends: 14 [2019-11-26 02:00:29,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:00:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-26 02:00:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-26 02:00:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-26 02:00:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-26 02:00:29,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2019-11-26 02:00:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:29,993 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-26 02:00:29,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:00:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-11-26 02:00:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:00:29,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:29,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:29,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 708827924, now seen corresponding path program 1 times [2019-11-26 02:00:29,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:29,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785732225] [2019-11-26 02:00:29,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:00:30,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785732225] [2019-11-26 02:00:30,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:00:30,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:00:30,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930735058] [2019-11-26 02:00:30,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:00:30,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:30,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:00:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:00:30,064 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 3 states. [2019-11-26 02:00:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:30,130 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-11-26 02:00:30,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:00:30,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-26 02:00:30,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:30,132 INFO L225 Difference]: With dead ends: 36 [2019-11-26 02:00:30,132 INFO L226 Difference]: Without dead ends: 24 [2019-11-26 02:00:30,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:00:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-26 02:00:30,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-11-26 02:00:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-26 02:00:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-26 02:00:30,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 11 [2019-11-26 02:00:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:30,137 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-26 02:00:30,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:00:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2019-11-26 02:00:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:00:30,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:30,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:30,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash -325494678, now seen corresponding path program 1 times [2019-11-26 02:00:30,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:30,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030706387] [2019-11-26 02:00:30,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:00:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030706387] [2019-11-26 02:00:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041672643] [2019-11-26 02:00:30,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/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-11-26 02:00:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:30,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:00:30,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:00:30,325 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:00:30,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:00:30,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [3] total 10 [2019-11-26 02:00:30,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372335650] [2019-11-26 02:00:30,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:00:30,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:00:30,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:00:30,374 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 8 states. [2019-11-26 02:00:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:30,450 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-26 02:00:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:00:30,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-26 02:00:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:30,451 INFO L225 Difference]: With dead ends: 31 [2019-11-26 02:00:30,451 INFO L226 Difference]: Without dead ends: 27 [2019-11-26 02:00:30,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:00:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-26 02:00:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-11-26 02:00:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-26 02:00:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-11-26 02:00:30,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 12 [2019-11-26 02:00:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:30,457 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-11-26 02:00:30,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:00:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-11-26 02:00:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:00:30,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:30,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:30,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:30,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash -980107374, now seen corresponding path program 1 times [2019-11-26 02:00:30,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:30,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124281982] [2019-11-26 02:00:30,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:00:30,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124281982] [2019-11-26 02:00:30,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624390865] [2019-11-26 02:00:30,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/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-11-26 02:00:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:30,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:00:30,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:00:30,858 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:00:30,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:00:30,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [3] total 8 [2019-11-26 02:00:30,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159248130] [2019-11-26 02:00:30,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:00:30,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:00:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:00:30,882 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 6 states. [2019-11-26 02:00:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:30,957 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-26 02:00:30,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:00:30,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-26 02:00:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:30,959 INFO L225 Difference]: With dead ends: 52 [2019-11-26 02:00:30,960 INFO L226 Difference]: Without dead ends: 38 [2019-11-26 02:00:30,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:00:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-26 02:00:30,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2019-11-26 02:00:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-26 02:00:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-26 02:00:30,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 15 [2019-11-26 02:00:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:30,965 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-26 02:00:30,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:00:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-11-26 02:00:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:00:30,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:30,966 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:31,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:31,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash -142260125, now seen corresponding path program 1 times [2019-11-26 02:00:31,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:31,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539486982] [2019-11-26 02:00:31,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:00:31,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539486982] [2019-11-26 02:00:31,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3438294] [2019-11-26 02:00:31,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:31,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:00:31,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:31,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:00:31,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:31,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:00:31,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:00:31,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-26 02:00:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:00:31,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:00:31,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:00:31,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-11-26 02:00:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:00:31,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:31,569 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:00:31,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:00:31,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2019-11-26 02:00:31,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:31,589 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-11-26 02:00:31,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:00:31,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:7 [2019-11-26 02:00:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:00:31,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:00:31,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 8] total 15 [2019-11-26 02:00:31,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7225645] [2019-11-26 02:00:31,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:00:31,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:00:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:00:31,615 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 7 states. [2019-11-26 02:00:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:31,812 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-11-26 02:00:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:00:31,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-26 02:00:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:31,813 INFO L225 Difference]: With dead ends: 36 [2019-11-26 02:00:31,814 INFO L226 Difference]: Without dead ends: 22 [2019-11-26 02:00:31,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:00:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-26 02:00:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-26 02:00:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-26 02:00:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-11-26 02:00:31,818 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 16 [2019-11-26 02:00:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:31,819 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-11-26 02:00:31,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:00:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2019-11-26 02:00:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:00:31,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:31,820 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:32,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:32,032 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:32,032 INFO L82 PathProgramCache]: Analyzing trace with hash 733568695, now seen corresponding path program 1 times [2019-11-26 02:00:32,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:32,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643005557] [2019-11-26 02:00:32,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:00:32,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643005557] [2019-11-26 02:00:32,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505196207] [2019-11-26 02:00:32,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:32,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:00:32,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:32,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-26 02:00:32,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:32,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:00:32,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:00:32,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-26 02:00:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:00:32,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:32,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:00:32,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:00:32,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:00:32,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:00:32,407 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-11-26 02:00:32,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:32,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:00:32,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-11-26 02:00:32,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:00:32,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:32,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:00:32,432 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:00:32,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:00:32,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:00:32,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-11-26 02:00:32,437 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:00:32,452 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-11-26 02:00:32,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:00:32,452 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:85, output treesize:7 [2019-11-26 02:00:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:00:32,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [204463331] [2019-11-26 02:00:32,492 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:00:32,492 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:00:32,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:00:32,503 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:00:32,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:00:32,622 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:33,294 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:33,308 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:33,423 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:33,841 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:00:34,291 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-11-26 02:00:34,960 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:00:34,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:00:34,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 7] total 15 [2019-11-26 02:00:34,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234929934] [2019-11-26 02:00:34,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:00:34,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:34,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:00:34,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:00:34,962 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 15 states. [2019-11-26 02:00:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:35,292 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2019-11-26 02:00:35,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-26 02:00:35,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-11-26 02:00:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:35,295 INFO L225 Difference]: With dead ends: 89 [2019-11-26 02:00:35,295 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:00:35,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 02:00:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:00:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 25. [2019-11-26 02:00:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-26 02:00:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-26 02:00:35,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2019-11-26 02:00:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:35,302 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-26 02:00:35,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:00:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-26 02:00:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:00:35,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:35,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:35,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:35,517 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash -972454968, now seen corresponding path program 1 times [2019-11-26 02:00:35,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:35,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816044676] [2019-11-26 02:00:35,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 02:00:35,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816044676] [2019-11-26 02:00:35,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896071195] [2019-11-26 02:00:35,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:35,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:00:35,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:00:35,711 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-26 02:00:35,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1910832187] [2019-11-26 02:00:35,743 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:00:35,743 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:00:35,744 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:00:35,744 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:00:35,744 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:00:35,980 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:36,061 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:36,430 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:36,503 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:37,075 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:00:37,335 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-26 02:00:37,642 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-11-26 02:00:38,109 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-11-26 02:00:38,506 WARN L192 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-26 02:00:38,943 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-26 02:00:39,306 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-11-26 02:00:39,307 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:00:39,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:00:39,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2019-11-26 02:00:39,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687064712] [2019-11-26 02:00:39,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:00:39,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:00:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:00:39,308 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 9 states. [2019-11-26 02:00:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:39,832 INFO L93 Difference]: Finished difference Result 90 states and 137 transitions. [2019-11-26 02:00:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-26 02:00:39,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-26 02:00:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:39,833 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:00:39,833 INFO L226 Difference]: Without dead ends: 69 [2019-11-26 02:00:39,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2019-11-26 02:00:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-26 02:00:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 27. [2019-11-26 02:00:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-26 02:00:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-26 02:00:39,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2019-11-26 02:00:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:39,841 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-26 02:00:39,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:00:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-11-26 02:00:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:00:39,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:39,842 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:40,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:40,045 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1997619457, now seen corresponding path program 2 times [2019-11-26 02:00:40,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:40,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578478535] [2019-11-26 02:00:40,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:00:40,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578478535] [2019-11-26 02:00:40,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347711965] [2019-11-26 02:00:40,143 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:40,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 02:00:40,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:00:40,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-26 02:00:40,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:40,283 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-26 02:00:40,318 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:40,414 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-26 02:00:40,415 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-26 02:00:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:00:40,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1657521886] [2019-11-26 02:00:40,433 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:00:40,433 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:00:40,433 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:00:40,433 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:00:40,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:00:40,795 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:40,957 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:41,018 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:41,460 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:00:41,660 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-26 02:00:41,880 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-11-26 02:00:42,255 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-11-26 02:00:42,515 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-26 02:00:42,854 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-26 02:00:43,162 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-11-26 02:00:43,163 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:00:43,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:00:43,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2019-11-26 02:00:43,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316236027] [2019-11-26 02:00:43,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 02:00:43,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:43,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 02:00:43,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-11-26 02:00:43,165 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 19 states. [2019-11-26 02:00:44,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:44,206 INFO L93 Difference]: Finished difference Result 292 states and 346 transitions. [2019-11-26 02:00:44,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-26 02:00:44,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-11-26 02:00:44,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:44,210 INFO L225 Difference]: With dead ends: 292 [2019-11-26 02:00:44,210 INFO L226 Difference]: Without dead ends: 270 [2019-11-26 02:00:44,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=581, Invalid=2841, Unknown=0, NotChecked=0, Total=3422 [2019-11-26 02:00:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-26 02:00:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 42. [2019-11-26 02:00:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-26 02:00:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-11-26 02:00:44,239 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2019-11-26 02:00:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:44,239 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-11-26 02:00:44,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 02:00:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-11-26 02:00:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:00:44,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:44,240 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:44,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:44,444 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -752769783, now seen corresponding path program 1 times [2019-11-26 02:00:44,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:44,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891520257] [2019-11-26 02:00:44,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:00:44,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891520257] [2019-11-26 02:00:44,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676440451] [2019-11-26 02:00:44,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:44,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 02:00:44,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-26 02:00:44,654 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-26 02:00:44,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757214071] [2019-11-26 02:00:44,720 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-11-26 02:00:44,720 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:00:44,720 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:00:44,720 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:00:44,721 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:00:44,935 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:45,407 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:45,421 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:45,470 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:45,786 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:00:46,089 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-11-26 02:00:46,478 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:00:46,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:00:46,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 13 [2019-11-26 02:00:46,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689458778] [2019-11-26 02:00:46,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-26 02:00:46,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-26 02:00:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:00:46,480 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 13 states. [2019-11-26 02:00:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:48,160 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2019-11-26 02:00:48,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-26 02:00:48,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-26 02:00:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:48,161 INFO L225 Difference]: With dead ends: 188 [2019-11-26 02:00:48,161 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 02:00:48,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=468, Invalid=2502, Unknown=0, NotChecked=0, Total=2970 [2019-11-26 02:00:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 02:00:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 53. [2019-11-26 02:00:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-26 02:00:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-11-26 02:00:48,169 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 28 [2019-11-26 02:00:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:48,170 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-26 02:00:48,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-26 02:00:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-11-26 02:00:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:00:48,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:48,171 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:48,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:48,371 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 191677968, now seen corresponding path program 3 times [2019-11-26 02:00:48,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:48,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200486104] [2019-11-26 02:00:48,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-26 02:00:48,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200486104] [2019-11-26 02:00:48,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453779008] [2019-11-26 02:00:48,495 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:48,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-26 02:00:48,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:00:48,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-26 02:00:48,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-26 02:00:48,579 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:00:48,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1694944737] [2019-11-26 02:00:48,889 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:00:48,889 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:00:48,889 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:00:48,889 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:00:48,889 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:00:49,081 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:49,278 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:49,443 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:49,503 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:49,808 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:00:50,040 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-26 02:00:50,308 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-11-26 02:00:50,647 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-26 02:00:50,939 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-26 02:00:51,299 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-26 02:00:51,618 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-11-26 02:00:51,619 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:00:51,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:00:51,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 13] total 20 [2019-11-26 02:00:51,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116488324] [2019-11-26 02:00:51,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 02:00:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 02:00:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2019-11-26 02:00:51,621 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 21 states. [2019-11-26 02:00:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:52,698 INFO L93 Difference]: Finished difference Result 308 states and 360 transitions. [2019-11-26 02:00:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 02:00:52,699 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2019-11-26 02:00:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:52,700 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:00:52,701 INFO L226 Difference]: Without dead ends: 262 [2019-11-26 02:00:52,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=304, Invalid=1502, Unknown=0, NotChecked=0, Total=1806 [2019-11-26 02:00:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-26 02:00:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 58. [2019-11-26 02:00:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 02:00:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-11-26 02:00:52,715 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 33 [2019-11-26 02:00:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:52,715 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-11-26 02:00:52,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 02:00:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2019-11-26 02:00:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 02:00:52,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:52,717 INFO L410 BasicCegarLoop]: trace histogram [10, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:00:52,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:52,920 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:00:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:00:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1600268646, now seen corresponding path program 4 times [2019-11-26 02:00:52,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:00:52,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76628329] [2019-11-26 02:00:52,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:00:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-26 02:00:53,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76628329] [2019-11-26 02:00:53,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624168645] [2019-11-26 02:00:53,061 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:00:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:00:53,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-26 02:00:53,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:00:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-26 02:00:53,257 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:00:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-26 02:00:53,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [869163948] [2019-11-26 02:00:53,517 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-26 02:00:53,517 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:00:53,518 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:00:53,518 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:00:53,518 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:00:53,795 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:53,914 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:53,970 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-26 02:00:54,336 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:00:54,636 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-11-26 02:00:54,877 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-11-26 02:00:55,238 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-11-26 02:00:55,506 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-26 02:00:55,668 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-26 02:00:55,953 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-26 02:00:56,289 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-11-26 02:00:56,290 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:00:56,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:00:56,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 24 [2019-11-26 02:00:56,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324007214] [2019-11-26 02:00:56,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-26 02:00:56,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:00:56,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-26 02:00:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 02:00:56,292 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 24 states. [2019-11-26 02:00:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:00:59,935 INFO L93 Difference]: Finished difference Result 275 states and 358 transitions. [2019-11-26 02:00:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-11-26 02:00:59,936 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 38 [2019-11-26 02:00:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:00:59,938 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:00:59,938 INFO L226 Difference]: Without dead ends: 251 [2019-11-26 02:00:59,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1109, Invalid=10021, Unknown=0, NotChecked=0, Total=11130 [2019-11-26 02:00:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-26 02:00:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 66. [2019-11-26 02:00:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-26 02:00:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-11-26 02:00:59,960 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 38 [2019-11-26 02:00:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:00:59,961 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-11-26 02:00:59,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-26 02:00:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-11-26 02:00:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:00:59,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:00:59,962 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:00,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:00,168 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:01:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1961509338, now seen corresponding path program 5 times [2019-11-26 02:01:00,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:00,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963984154] [2019-11-26 02:01:00,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:01:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-26 02:01:00,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963984154] [2019-11-26 02:01:00,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555681371] [2019-11-26 02:01:00,392 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:00,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 02:01:00,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:01:00,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 02:01:00,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:01:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-26 02:01:00,698 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:01:00,830 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-26 02:01:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-26 02:01:00,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:01:00,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 8] total 19 [2019-11-26 02:01:00,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813523707] [2019-11-26 02:01:00,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:01:00,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:01:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:01:00,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:01:00,835 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 7 states. [2019-11-26 02:01:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:01:01,014 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2019-11-26 02:01:01,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:01:01,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-26 02:01:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:01:01,017 INFO L225 Difference]: With dead ends: 97 [2019-11-26 02:01:01,017 INFO L226 Difference]: Without dead ends: 78 [2019-11-26 02:01:01,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-11-26 02:01:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-26 02:01:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2019-11-26 02:01:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-26 02:01:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-11-26 02:01:01,039 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 42 [2019-11-26 02:01:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:01:01,040 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-11-26 02:01:01,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:01:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-11-26 02:01:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:01:01,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:01:01,043 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:01:01,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:01:01,247 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:01:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:01:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash -121823319, now seen corresponding path program 2 times [2019-11-26 02:01:01,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:01:01,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934630237] [2019-11-26 02:01:01,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:01:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:01:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:01:02,272 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:01:02,272 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:01:02,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:01:02 BoogieIcfgContainer [2019-11-26 02:01:02,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:01:02,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:01:02,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:01:02,341 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:01:02,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:00:29" (3/4) ... [2019-11-26 02:01:02,343 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:01:02,443 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2c699b4a-3cfb-4498-aafd-60f4f74e725f/bin/utaipan/witness.graphml [2019-11-26 02:01:02,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:01:02,444 INFO L168 Benchmark]: Toolchain (without parser) took 33559.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 506.5 MB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -552.0 MB). Peak memory consumption was 591.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:02,444 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:01:02,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:02,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:01:02,445 INFO L168 Benchmark]: Boogie Preprocessor took 25.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:01:02,445 INFO L168 Benchmark]: RCFGBuilder took 478.41 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:02,446 INFO L168 Benchmark]: TraceAbstraction took 32608.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 828.6 MB in the end (delta: 274.6 MB). Peak memory consumption was 601.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:01:02,449 INFO L168 Benchmark]: Witness Printer took 102.05 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 32.0 MB). Free memory was 828.6 MB in the beginning and 1.5 GB in the end (delta: -668.2 MB). Peak memory consumption was 497.4 kB. Max. memory is 11.5 GB. [2019-11-26 02:01:02,452 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -192.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.44 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 25.39 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 478.41 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: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32608.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 828.6 MB in the end (delta: 274.6 MB). Peak memory consumption was 601.7 MB. Max. memory is 11.5 GB. * Witness Printer took 102.05 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 32.0 MB). Free memory was 828.6 MB in the beginning and 1.5 GB in the end (delta: -668.2 MB). Peak memory consumption was 497.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] char string_entrada[10], vetor_vogais[]={'a','A','e','E','i','I','o','O','u','U','\0'}; [L16] unsigned int i,j,cont, tam_string, n_caracter; [L18] i=0 [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND TRUE i<10 [L19] string_entrada[i] = __VERIFIER_nondet_char() [L18] i++ [L18] COND FALSE !(i<10) [L21] string_entrada[10 -1]='\0' [L23] n_caracter = 0 [L24] EXPR string_entrada[n_caracter] [L24] COND TRUE string_entrada[n_caracter]!='\0' [L25] n_caracter++ [L24] EXPR string_entrada[n_caracter] [L24] COND FALSE !(string_entrada[n_caracter]!='\0') [L27] cont = 0 [L28] i=0 [L28] COND TRUE i