./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 19:34:13,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:34:13,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:34:13,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:34:13,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:34:13,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:34:13,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:34:13,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:34:13,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:34:13,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:34:13,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:34:13,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:34:13,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:34:13,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:34:13,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:34:13,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:34:13,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:34:13,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:34:13,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:34:13,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:34:13,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:34:13,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:34:13,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:34:13,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:34:13,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:34:13,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:34:13,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:34:13,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:34:13,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:34:13,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:34:13,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:34:13,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:34:13,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:34:13,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:34:13,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:34:13,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:34:13,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:34:13,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:34:13,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:34:13,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:34:13,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:34:13,908 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:34:13,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:34:13,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:34:13,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:34:13,919 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:34:13,919 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:34:13,919 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:34:13,919 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:34:13,920 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:34:13,920 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:34:13,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:34:13,921 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:34:13,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:34:13,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:34:13,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:34:13,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:34:13,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:34:13,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:34:13,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:34:13,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:34:13,924 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_cb305352-222b-441f-b338-1311a50751d8/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 -> 133c91eb4ca703e3ebf3582d43ed0be6dbefca67 [2019-12-07 19:34:14,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:34:14,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:34:14,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:34:14,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:34:14,036 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:34:14,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/../../sv-benchmarks/c/systemc/toy1.cil.c [2019-12-07 19:34:14,074 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/data/2af3b0287/821e73f9378f4707bb56209daa10a51f/FLAGb5252748a [2019-12-07 19:34:14,489 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:34:14,490 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/sv-benchmarks/c/systemc/toy1.cil.c [2019-12-07 19:34:14,496 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/data/2af3b0287/821e73f9378f4707bb56209daa10a51f/FLAGb5252748a [2019-12-07 19:34:14,505 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/data/2af3b0287/821e73f9378f4707bb56209daa10a51f [2019-12-07 19:34:14,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:34:14,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:34:14,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:14,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:34:14,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:34:14,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711c3e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14, skipping insertion in model container [2019-12-07 19:34:14,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:34:14,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:34:14,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:14,713 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:34:14,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:34:14,755 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:34:14,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14 WrapperNode [2019-12-07 19:34:14,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:34:14,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:14,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:34:14,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:34:14,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:34:14,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:34:14,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:34:14,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:34:14,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... [2019-12-07 19:34:14,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:34:14,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:34:14,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:34:14,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:34:14,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:34:14,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:34:14,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:34:15,689 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:34:15,690 INFO L287 CfgBuilder]: Removed 28 assume(true) statements. [2019-12-07 19:34:15,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:15 BoogieIcfgContainer [2019-12-07 19:34:15,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:34:15,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:34:15,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:34:15,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:34:15,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:34:14" (1/3) ... [2019-12-07 19:34:15,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@840e628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:15, skipping insertion in model container [2019-12-07 19:34:15,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:34:14" (2/3) ... [2019-12-07 19:34:15,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@840e628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:34:15, skipping insertion in model container [2019-12-07 19:34:15,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:15" (3/3) ... [2019-12-07 19:34:15,697 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-12-07 19:34:15,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:34:15,709 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:34:15,716 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 19:34:15,732 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:34:15,732 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:34:15,732 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:34:15,732 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:34:15,732 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:34:15,733 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:34:15,733 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:34:15,733 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:34:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-12-07 19:34:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:34:15,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:15,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:15,748 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash 771554450, now seen corresponding path program 1 times [2019-12-07 19:34:15,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:15,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440537872] [2019-12-07 19:34:15,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:15,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440537872] [2019-12-07 19:34:15,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:15,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:34:15,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132901959] [2019-12-07 19:34:15,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:15,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:15,907 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-12-07 19:34:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:15,956 INFO L93 Difference]: Finished difference Result 115 states and 185 transitions. [2019-12-07 19:34:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:15,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 19:34:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:15,966 INFO L225 Difference]: With dead ends: 115 [2019-12-07 19:34:15,966 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 19:34:15,968 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-12-07 19:34:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 19:34:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-12-07 19:34:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 19:34:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2019-12-07 19:34:15,997 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 14 [2019-12-07 19:34:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:15,998 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2019-12-07 19:34:15,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2019-12-07 19:34:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:34:15,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:15,999 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:15,999 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1883485327, now seen corresponding path program 1 times [2019-12-07 19:34:16,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:16,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739018056] [2019-12-07 19:34:16,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:16,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739018056] [2019-12-07 19:34:16,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:16,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:16,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084320993] [2019-12-07 19:34:16,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:16,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:16,058 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand 3 states. [2019-12-07 19:34:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:16,092 INFO L93 Difference]: Finished difference Result 122 states and 189 transitions. [2019-12-07 19:34:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:16,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 19:34:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:16,093 INFO L225 Difference]: With dead ends: 122 [2019-12-07 19:34:16,094 INFO L226 Difference]: Without dead ends: 84 [2019-12-07 19:34:16,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-07 19:34:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-12-07 19:34:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 19:34:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2019-12-07 19:34:16,102 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 22 [2019-12-07 19:34:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:16,103 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-12-07 19:34:16,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2019-12-07 19:34:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 19:34:16,104 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:16,104 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:16,104 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:16,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -21642274, now seen corresponding path program 1 times [2019-12-07 19:34:16,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:16,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466572138] [2019-12-07 19:34:16,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:16,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466572138] [2019-12-07 19:34:16,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:16,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:16,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599748159] [2019-12-07 19:34:16,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:34:16,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:16,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:34:16,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:16,169 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand 4 states. [2019-12-07 19:34:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:16,205 INFO L93 Difference]: Finished difference Result 216 states and 334 transitions. [2019-12-07 19:34:16,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:34:16,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 19:34:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:16,207 INFO L225 Difference]: With dead ends: 216 [2019-12-07 19:34:16,207 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 19:34:16,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:34:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 19:34:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 115. [2019-12-07 19:34:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 19:34:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2019-12-07 19:34:16,218 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 26 [2019-12-07 19:34:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2019-12-07 19:34:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:34:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2019-12-07 19:34:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 19:34:16,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:16,220 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:16,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash 433405894, now seen corresponding path program 1 times [2019-12-07 19:34:16,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:16,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761284270] [2019-12-07 19:34:16,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:16,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761284270] [2019-12-07 19:34:16,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:16,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:16,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544721582] [2019-12-07 19:34:16,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:16,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:16,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:16,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:16,260 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand 3 states. [2019-12-07 19:34:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:16,294 INFO L93 Difference]: Finished difference Result 249 states and 388 transitions. [2019-12-07 19:34:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:16,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 19:34:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:16,296 INFO L225 Difference]: With dead ends: 249 [2019-12-07 19:34:16,296 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 19:34:16,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 19:34:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-12-07 19:34:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 19:34:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2019-12-07 19:34:16,309 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 34 [2019-12-07 19:34:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:16,310 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2019-12-07 19:34:16,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2019-12-07 19:34:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:34:16,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:16,312 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:16,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:16,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1474793516, now seen corresponding path program 1 times [2019-12-07 19:34:16,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:16,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006353654] [2019-12-07 19:34:16,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 19:34:16,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006353654] [2019-12-07 19:34:16,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:34:16,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:34:16,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432643303] [2019-12-07 19:34:16,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:34:16,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:34:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:16,384 INFO L87 Difference]: Start difference. First operand 173 states and 262 transitions. Second operand 3 states. [2019-12-07 19:34:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:16,405 INFO L93 Difference]: Finished difference Result 179 states and 269 transitions. [2019-12-07 19:34:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:34:16,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 19:34:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:16,407 INFO L225 Difference]: With dead ends: 179 [2019-12-07 19:34:16,407 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 19:34:16,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:34:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 19:34:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-12-07 19:34:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 19:34:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 264 transitions. [2019-12-07 19:34:16,416 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 264 transitions. Word has length 48 [2019-12-07 19:34:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:16,416 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 264 transitions. [2019-12-07 19:34:16,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:34:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 264 transitions. [2019-12-07 19:34:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:34:16,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:16,418 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:16,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1474791914, now seen corresponding path program 1 times [2019-12-07 19:34:16,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:16,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830123422] [2019-12-07 19:34:16,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:16,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830123422] [2019-12-07 19:34:16,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22559316] [2019-12-07 19:34:16,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:34:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:16,645 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-07 19:34:16,650 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:16,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:16,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:16,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:16,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:16,875 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 19:34:17,081 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2019-12-07 19:34:17,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-12-07 19:34:17,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:34:17,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:17,181 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:17,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:34:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,960 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 40 [2019-12-07 19:34:17,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:17,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 19:34:17,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:34:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:18,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1237601562] [2019-12-07 19:34:18,131 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2019-12-07 19:34:18,131 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:18,135 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:34:18,139 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:34:18,140 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:34:19,636 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 226 [2019-12-07 19:34:21,911 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:34:22,145 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-12-07 19:34:22,274 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 19:34:22,486 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-07 19:34:22,806 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-07 19:34:23,121 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 19:34:23,343 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:34:23,558 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-12-07 19:34:23,770 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:34:23,967 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-12-07 19:34:24,575 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 129 [2019-12-07 19:34:24,876 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-07 19:34:25,252 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-07 19:34:25,510 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-12-07 19:34:25,791 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-12-07 19:34:26,195 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 19:34:26,380 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-07 19:34:26,573 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-12-07 19:34:26,829 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 83 [2019-12-07 19:34:27,066 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-12-07 19:34:27,297 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-12-07 19:34:27,886 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-12-07 19:34:29,274 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 219 DAG size of output: 133 [2019-12-07 19:34:29,967 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 134 [2019-12-07 19:34:31,201 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 221 DAG size of output: 136 [2019-12-07 19:34:32,590 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 229 DAG size of output: 136 [2019-12-07 19:34:33,122 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-12-07 19:34:33,389 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-12-07 19:34:33,391 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:34:33,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:33,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 13] total 26 [2019-12-07 19:34:33,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789696917] [2019-12-07 19:34:33,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 19:34:33,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:33,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 19:34:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2533, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 19:34:33,394 INFO L87 Difference]: Start difference. First operand 175 states and 264 transitions. Second operand 27 states. [2019-12-07 19:34:33,630 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 19:34:33,861 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-07 19:34:34,113 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2019-12-07 19:34:34,386 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2019-12-07 19:34:35,040 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-12-07 19:34:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:37,963 INFO L93 Difference]: Finished difference Result 1586 states and 2267 transitions. [2019-12-07 19:34:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-07 19:34:37,963 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-12-07 19:34:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:37,971 INFO L225 Difference]: With dead ends: 1586 [2019-12-07 19:34:37,972 INFO L226 Difference]: Without dead ends: 1405 [2019-12-07 19:34:37,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7598 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=2485, Invalid=16147, Unknown=0, NotChecked=0, Total=18632 [2019-12-07 19:34:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-07 19:34:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 463. [2019-12-07 19:34:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-12-07 19:34:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 704 transitions. [2019-12-07 19:34:38,016 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 704 transitions. Word has length 48 [2019-12-07 19:34:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:38,017 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 704 transitions. [2019-12-07 19:34:38,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 19:34:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 704 transitions. [2019-12-07 19:34:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:34:38,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:38,019 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:38,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:38,221 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1897896958, now seen corresponding path program 1 times [2019-12-07 19:34:38,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:38,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253701340] [2019-12-07 19:34:38,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:38,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253701340] [2019-12-07 19:34:38,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815380568] [2019-12-07 19:34:38,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:34:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:38,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 19:34:38,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 19:34:38,448 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:34:38,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [143202568] [2019-12-07 19:34:38,550 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2019-12-07 19:34:38,551 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:34:38,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:34:38,551 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:34:38,551 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:34:40,155 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 286 [2019-12-07 19:34:40,672 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:34:40,934 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-12-07 19:34:41,063 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 19:34:41,454 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-12-07 19:34:41,702 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-12-07 19:34:41,971 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-12-07 19:34:42,237 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-12-07 19:34:42,512 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-12-07 19:34:42,737 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-12-07 19:34:43,491 WARN L192 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 111 [2019-12-07 19:34:43,778 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-12-07 19:34:43,971 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-12-07 19:34:44,278 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-12-07 19:34:44,593 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 87 [2019-12-07 19:34:44,834 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 89 [2019-12-07 19:34:45,033 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 19:34:45,242 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-07 19:34:45,874 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 87 [2019-12-07 19:34:46,304 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-12-07 19:34:46,703 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 92 [2019-12-07 19:34:47,136 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2019-12-07 19:34:47,429 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 19:34:47,604 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:34:47,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:34:47,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 9] total 20 [2019-12-07 19:34:47,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244360149] [2019-12-07 19:34:47,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 19:34:47,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:34:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 19:34:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1352, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 19:34:47,606 INFO L87 Difference]: Start difference. First operand 463 states and 704 transitions. Second operand 20 states. [2019-12-07 19:34:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:34:48,467 INFO L93 Difference]: Finished difference Result 981 states and 1479 transitions. [2019-12-07 19:34:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:34:48,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2019-12-07 19:34:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:34:48,470 INFO L225 Difference]: With dead ends: 981 [2019-12-07 19:34:48,470 INFO L226 Difference]: Without dead ends: 443 [2019-12-07 19:34:48,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 136 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=528, Invalid=2124, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 19:34:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-07 19:34:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 335. [2019-12-07 19:34:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-12-07 19:34:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 458 transitions. [2019-12-07 19:34:48,484 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 458 transitions. Word has length 56 [2019-12-07 19:34:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:34:48,485 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 458 transitions. [2019-12-07 19:34:48,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 19:34:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 458 transitions. [2019-12-07 19:34:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 19:34:48,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:34:48,486 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:34:48,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:34:48,686 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:34:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:34:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 842491456, now seen corresponding path program 1 times [2019-12-07 19:34:48,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:34:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878173840] [2019-12-07 19:34:48,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:34:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:34:49,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878173840] [2019-12-07 19:34:49,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138323960] [2019-12-07 19:34:49,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:34:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:34:49,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 19:34:49,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:34:49,595 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-12-07 19:34:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 40 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:34:49,768 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:34:51,125 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 239 DAG size of output: 127 [2019-12-07 19:35:09,147 WARN L192 SmtUtils]: Spent 17.08 s on a formula simplification. DAG size of input: 1240 DAG size of output: 205 [2019-12-07 19:35:10,170 WARN L192 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 168 [2019-12-07 19:35:12,367 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 371 DAG size of output: 49 [2019-12-07 19:35:13,053 WARN L192 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 34 [2019-12-07 19:35:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:35:13,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1996690960] [2019-12-07 19:35:13,131 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2019-12-07 19:35:13,131 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:13,131 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:35:13,131 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:35:13,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:35:13,811 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 254 [2019-12-07 19:35:14,229 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 262 [2019-12-07 19:35:14,651 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 272 [2019-12-07 19:35:16,497 WARN L192 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 743 DAG size of output: 646 [2019-12-07 19:35:17,188 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 271 [2019-12-07 19:35:17,600 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 241 [2019-12-07 19:35:18,336 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 432 DAG size of output: 407 [2019-12-07 19:35:19,041 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 299 [2019-12-07 19:35:19,951 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 485 DAG size of output: 455 [2019-12-07 19:35:20,841 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:35:21,422 WARN L192 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-12-07 19:35:21,562 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 19:35:21,822 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 19:35:22,694 WARN L192 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-12-07 19:35:23,572 WARN L192 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 94 [2019-12-07 19:35:24,171 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-12-07 19:35:24,615 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 91 [2019-12-07 19:35:26,489 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 301 DAG size of output: 119 [2019-12-07 19:35:27,084 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2019-12-07 19:35:27,413 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-12-07 19:35:27,998 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 19:35:28,208 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 19:35:28,458 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:35:28,786 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:35:29,130 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 19:35:29,447 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-12-07 19:35:29,903 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:35:30,297 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-12-07 19:35:30,647 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2019-12-07 19:35:31,271 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2019-12-07 19:35:31,863 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2019-12-07 19:35:32,584 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 101 [2019-12-07 19:35:34,487 WARN L192 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 306 DAG size of output: 124 [2019-12-07 19:35:35,855 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 274 DAG size of output: 123 [2019-12-07 19:35:37,352 WARN L192 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 275 DAG size of output: 125 [2019-12-07 19:35:39,949 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 307 DAG size of output: 135 [2019-12-07 19:35:40,643 WARN L192 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2019-12-07 19:35:41,310 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-12-07 19:35:41,310 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:35:41,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:35:41,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 13] total 30 [2019-12-07 19:35:41,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708169736] [2019-12-07 19:35:41,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 19:35:41,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 19:35:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=3041, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 19:35:41,312 INFO L87 Difference]: Start difference. First operand 335 states and 458 transitions. Second operand 31 states. [2019-12-07 19:35:41,760 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-12-07 19:35:41,965 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-12-07 19:35:43,584 WARN L192 SmtUtils]: Spent 969.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 58 [2019-12-07 19:35:44,153 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 48 [2019-12-07 19:35:44,565 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-12-07 19:35:45,361 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 56 [2019-12-07 19:35:45,743 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 45 [2019-12-07 19:35:46,769 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 59 [2019-12-07 19:35:47,260 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 48 [2019-12-07 19:35:48,168 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 49 [2019-12-07 19:35:48,910 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 36 [2019-12-07 19:35:49,641 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 59 [2019-12-07 19:35:50,011 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 44 [2019-12-07 19:35:50,281 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 32 [2019-12-07 19:35:50,748 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 48 [2019-12-07 19:35:51,350 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 55 [2019-12-07 19:35:51,773 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 44 [2019-12-07 19:35:53,200 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-12-07 19:35:53,560 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 19:35:54,115 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2019-12-07 19:35:55,101 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-12-07 19:35:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:55,123 INFO L93 Difference]: Finished difference Result 1566 states and 2119 transitions. [2019-12-07 19:35:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-07 19:35:55,124 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-12-07 19:35:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:55,133 INFO L225 Difference]: With dead ends: 1566 [2019-12-07 19:35:55,133 INFO L226 Difference]: Without dead ends: 1257 [2019-12-07 19:35:55,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7414 ImplicationChecksByTransitivity, 54.9s TimeCoverageRelationStatistics Valid=2398, Invalid=15692, Unknown=0, NotChecked=0, Total=18090 [2019-12-07 19:35:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-12-07 19:35:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 336. [2019-12-07 19:35:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-07 19:35:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 464 transitions. [2019-12-07 19:35:55,174 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 464 transitions. Word has length 60 [2019-12-07 19:35:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:55,174 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 464 transitions. [2019-12-07 19:35:55,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 19:35:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 464 transitions. [2019-12-07 19:35:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:35:55,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:55,175 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:55,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:55,377 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash 45255601, now seen corresponding path program 1 times [2019-12-07 19:35:55,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:55,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433866440] [2019-12-07 19:35:55,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:35:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433866440] [2019-12-07 19:35:55,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312876727] [2019-12-07 19:35:55,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:35:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:55,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:35:55,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 19:35:55,556 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:55,602 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 19:35:55,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:35:55,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [8] total 14 [2019-12-07 19:35:55,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857166186] [2019-12-07 19:35:55,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:35:55,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:55,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:35:55,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:35:55,603 INFO L87 Difference]: Start difference. First operand 336 states and 464 transitions. Second operand 10 states. [2019-12-07 19:35:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:55,741 INFO L93 Difference]: Finished difference Result 768 states and 1053 transitions. [2019-12-07 19:35:55,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:35:55,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 19:35:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:55,743 INFO L225 Difference]: With dead ends: 768 [2019-12-07 19:35:55,743 INFO L226 Difference]: Without dead ends: 445 [2019-12-07 19:35:55,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:35:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-12-07 19:35:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 339. [2019-12-07 19:35:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-12-07 19:35:55,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 441 transitions. [2019-12-07 19:35:55,766 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 441 transitions. Word has length 67 [2019-12-07 19:35:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:55,766 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 441 transitions. [2019-12-07 19:35:55,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:35:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 441 transitions. [2019-12-07 19:35:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 19:35:55,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:55,767 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:55,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:55,968 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:55,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1159093283, now seen corresponding path program 1 times [2019-12-07 19:35:55,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:55,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155788495] [2019-12-07 19:35:55,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 19:35:55,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155788495] [2019-12-07 19:35:55,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:55,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:35:55,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372704719] [2019-12-07 19:35:55,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:35:55,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:55,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:35:55,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:55,991 INFO L87 Difference]: Start difference. First operand 339 states and 441 transitions. Second operand 3 states. [2019-12-07 19:35:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:56,024 INFO L93 Difference]: Finished difference Result 665 states and 868 transitions. [2019-12-07 19:35:56,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:35:56,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 19:35:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:56,026 INFO L225 Difference]: With dead ends: 665 [2019-12-07 19:35:56,026 INFO L226 Difference]: Without dead ends: 339 [2019-12-07 19:35:56,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:35:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-12-07 19:35:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 314. [2019-12-07 19:35:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 19:35:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 391 transitions. [2019-12-07 19:35:56,046 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 391 transitions. Word has length 67 [2019-12-07 19:35:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:56,047 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 391 transitions. [2019-12-07 19:35:56,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:35:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 391 transitions. [2019-12-07 19:35:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 19:35:56,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:56,048 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:56,048 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:56,048 INFO L82 PathProgramCache]: Analyzing trace with hash 528309666, now seen corresponding path program 1 times [2019-12-07 19:35:56,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:56,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321093324] [2019-12-07 19:35:56,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 19:35:56,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321093324] [2019-12-07 19:35:56,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:35:56,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:35:56,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625037642] [2019-12-07 19:35:56,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:35:56,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:35:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:35:56,074 INFO L87 Difference]: Start difference. First operand 314 states and 391 transitions. Second operand 4 states. [2019-12-07 19:35:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:56,098 INFO L93 Difference]: Finished difference Result 448 states and 554 transitions. [2019-12-07 19:35:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:35:56,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 19:35:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:56,100 INFO L225 Difference]: With dead ends: 448 [2019-12-07 19:35:56,100 INFO L226 Difference]: Without dead ends: 147 [2019-12-07 19:35:56,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:35:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-12-07 19:35:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-12-07 19:35:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-12-07 19:35:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2019-12-07 19:35:56,112 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 68 [2019-12-07 19:35:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:56,112 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2019-12-07 19:35:56,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:35:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2019-12-07 19:35:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 19:35:56,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:56,113 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:56,113 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1674543751, now seen corresponding path program 1 times [2019-12-07 19:35:56,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:56,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647810082] [2019-12-07 19:35:56,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:35:56,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647810082] [2019-12-07 19:35:56,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080508585] [2019-12-07 19:35:56,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:35:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:56,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:35:56,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 19:35:56,283 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 19:35:56,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:35:56,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [8] total 14 [2019-12-07 19:35:56,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469707183] [2019-12-07 19:35:56,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:35:56,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:35:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:35:56,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:35:56,342 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand 10 states. [2019-12-07 19:35:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:35:56,439 INFO L93 Difference]: Finished difference Result 290 states and 348 transitions. [2019-12-07 19:35:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:35:56,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-07 19:35:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:35:56,440 INFO L225 Difference]: With dead ends: 290 [2019-12-07 19:35:56,440 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 19:35:56,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:35:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 19:35:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-12-07 19:35:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-12-07 19:35:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2019-12-07 19:35:56,455 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 182 transitions. Word has length 69 [2019-12-07 19:35:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:35:56,455 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 182 transitions. [2019-12-07 19:35:56,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:35:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 182 transitions. [2019-12-07 19:35:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 19:35:56,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:35:56,455 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:35:56,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:35:56,657 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:35:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:35:56,657 INFO L82 PathProgramCache]: Analyzing trace with hash -742614597, now seen corresponding path program 1 times [2019-12-07 19:35:56,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:35:56,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968756301] [2019-12-07 19:35:56,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:35:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 49 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:35:56,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968756301] [2019-12-07 19:35:56,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696693830] [2019-12-07 19:35:56,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:35:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:35:56,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 19:35:56,867 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:35:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 19:35:56,983 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:35:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 19:35:57,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276588136] [2019-12-07 19:35:57,157 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2019-12-07 19:35:57,157 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:35:57,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:35:57,157 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:35:57,158 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:35:58,360 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 249 [2019-12-07 19:35:59,626 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 271 [2019-12-07 19:36:01,092 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 247 [2019-12-07 19:36:01,554 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 278 [2019-12-07 19:36:02,086 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 232 [2019-12-07 19:36:02,547 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 281 [2019-12-07 19:36:03,521 WARN L192 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 473 DAG size of output: 346 [2019-12-07 19:36:03,953 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 235 [2019-12-07 19:36:04,865 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 426 DAG size of output: 353 [2019-12-07 19:36:05,337 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 426 DAG size of output: 353 [2019-12-07 19:36:05,410 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:36:05,638 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2019-12-07 19:36:05,780 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 19:36:06,145 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-07 19:36:06,332 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 19:36:06,522 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-12-07 19:36:06,733 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-07 19:36:06,953 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-12-07 19:36:07,248 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-07 19:36:07,462 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-07 19:36:07,729 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-12-07 19:36:08,184 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-12-07 19:36:08,933 WARN L192 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2019-12-07 19:36:09,382 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 19:36:09,867 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-07 19:36:11,506 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2019-12-07 19:36:11,748 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-07 19:36:11,979 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-12-07 19:36:12,218 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-12-07 19:36:12,532 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 19:36:12,950 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 88 [2019-12-07 19:36:13,515 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 90 [2019-12-07 19:36:13,944 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 92 [2019-12-07 19:36:14,612 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-12-07 19:36:15,114 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-12-07 19:36:15,557 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:36:15,923 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-12-07 19:36:16,189 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-12-07 19:36:16,458 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-12-07 19:36:16,459 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:36:16,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:36:16,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 28 [2019-12-07 19:36:16,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816954968] [2019-12-07 19:36:16,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 19:36:16,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:36:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 19:36:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=2748, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 19:36:16,461 INFO L87 Difference]: Start difference. First operand 161 states and 182 transitions. Second operand 28 states. [2019-12-07 19:36:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:36:17,312 INFO L93 Difference]: Finished difference Result 383 states and 434 transitions. [2019-12-07 19:36:17,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:36:17,313 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 71 [2019-12-07 19:36:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:36:17,314 INFO L225 Difference]: With dead ends: 383 [2019-12-07 19:36:17,314 INFO L226 Difference]: Without dead ends: 222 [2019-12-07 19:36:17,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 168 SyntacticMatches, 13 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2524 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=751, Invalid=4799, Unknown=0, NotChecked=0, Total=5550 [2019-12-07 19:36:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-07 19:36:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 119. [2019-12-07 19:36:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 19:36:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2019-12-07 19:36:17,332 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 71 [2019-12-07 19:36:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:36:17,332 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2019-12-07 19:36:17,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 19:36:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2019-12-07 19:36:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 19:36:17,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:36:17,333 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:36:17,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:36:17,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:36:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:36:17,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1760242471, now seen corresponding path program 1 times [2019-12-07 19:36:17,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:36:17,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874763494] [2019-12-07 19:36:17,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:36:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:36:18,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874763494] [2019-12-07 19:36:18,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594535400] [2019-12-07 19:36:18,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/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-12-07 19:36:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:36:18,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-07 19:36:18,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:36:18,325 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 19:36:18,621 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-12-07 19:36:18,969 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-07 19:36:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:36:19,296 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:36:21,496 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 272 DAG size of output: 169 [2019-12-07 19:39:19,297 WARN L192 SmtUtils]: Spent 2.96 m on a formula simplification. DAG size of input: 129 DAG size of output: 28 [2019-12-07 19:39:19,860 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 30 [2019-12-07 19:39:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:39:19,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1697892597] [2019-12-07 19:39:19,950 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2019-12-07 19:39:19,950 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:39:19,950 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:39:19,951 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:39:19,951 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:39:21,191 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 251 [2019-12-07 19:39:21,594 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 258 [2019-12-07 19:39:21,979 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 263 [2019-12-07 19:39:22,354 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 265 [2019-12-07 19:39:24,904 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 239 [2019-12-07 19:39:25,470 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 269 [2019-12-07 19:39:26,308 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 513 DAG size of output: 354 [2019-12-07 19:39:27,586 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 443 DAG size of output: 412 [2019-12-07 19:39:28,057 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 443 DAG size of output: 412 [2019-12-07 19:39:28,135 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 19:39:28,427 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2019-12-07 19:39:28,595 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-12-07 19:39:29,065 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2019-12-07 19:39:29,582 WARN L192 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2019-12-07 19:39:29,911 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2019-12-07 19:39:30,160 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-12-07 19:39:30,393 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2019-12-07 19:39:30,787 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-07 19:39:31,147 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2019-12-07 19:39:31,536 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2019-12-07 19:39:31,880 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-07 19:39:32,240 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 19:39:32,717 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2019-12-07 19:39:33,261 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 87 [2019-12-07 19:39:33,723 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2019-12-07 19:39:34,023 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2019-12-07 19:39:34,423 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2019-12-07 19:39:35,019 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 19:39:35,885 WARN L192 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 89 [2019-12-07 19:39:36,418 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 91 [2019-12-07 19:39:36,885 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-12-07 19:39:37,569 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2019-12-07 19:39:38,689 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-12-07 19:39:39,240 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-12-07 19:39:39,526 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 19:39:39,898 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-12-07 19:39:40,521 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-12-07 19:39:41,246 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2019-12-07 19:39:41,247 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 19:39:41,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:39:41,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 53 [2019-12-07 19:39:41,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626953773] [2019-12-07 19:39:41,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-07 19:39:41,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:39:41,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-07 19:39:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=6190, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 19:39:41,253 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand 54 states. [2019-12-07 19:39:41,672 WARN L192 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-12-07 19:39:42,391 WARN L192 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 19:39:43,651 WARN L192 SmtUtils]: Spent 948.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 51 [2019-12-07 19:39:44,378 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 53 [2019-12-07 19:39:44,773 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 45 [2019-12-07 19:39:45,058 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 40 [2019-12-07 19:39:45,210 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 29 [2019-12-07 19:39:45,675 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-12-07 19:39:46,393 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 39 [2019-12-07 19:39:46,899 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-12-07 19:39:47,450 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-07 19:39:48,973 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-12-07 19:39:50,801 WARN L192 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 180 DAG size of output: 106 [2019-12-07 19:39:51,213 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-07 19:39:51,864 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-12-07 19:39:52,331 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 19:39:52,750 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-12-07 19:39:53,145 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-12-07 19:39:53,571 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-12-07 19:39:53,805 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-12-07 19:39:54,141 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-12-07 19:39:54,410 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-07 19:39:54,750 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-07 19:39:55,687 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-12-07 19:39:56,224 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-07 19:39:56,382 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-12-07 19:39:56,717 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 19:39:57,264 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-12-07 19:39:57,492 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-12-07 19:39:57,813 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-07 19:39:58,218 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 19:39:58,460 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-07 19:39:58,933 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-12-07 19:39:59,437 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 19:40:00,230 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 82 [2019-12-07 19:40:00,553 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-07 19:40:00,876 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 19:40:01,858 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 92 [2019-12-07 19:40:02,662 WARN L192 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 94 [2019-12-07 19:40:02,926 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-07 19:40:03,975 WARN L192 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 96 [2019-12-07 19:40:05,829 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 191 DAG size of output: 94 [2019-12-07 19:40:06,846 WARN L192 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 98 [2019-12-07 19:40:07,120 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 19:40:07,761 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-12-07 19:40:10,026 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 201 DAG size of output: 96 [2019-12-07 19:40:11,311 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 200 DAG size of output: 104 [2019-12-07 19:40:12,336 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-12-07 19:40:12,716 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 19:40:14,256 WARN L192 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 95 [2019-12-07 19:40:15,198 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-12-07 19:40:16,016 WARN L192 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 97 [2019-12-07 19:40:16,552 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 19:40:17,375 WARN L192 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 105 [2019-12-07 19:40:18,236 WARN L192 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 107 [2019-12-07 19:40:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:40:18,238 INFO L93 Difference]: Finished difference Result 487 states and 544 transitions. [2019-12-07 19:40:18,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-07 19:40:18,239 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 73 [2019-12-07 19:40:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:40:18,240 INFO L225 Difference]: With dead ends: 487 [2019-12-07 19:40:18,241 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 19:40:18,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 136 SyntacticMatches, 21 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11201 ImplicationChecksByTransitivity, 227.7s TimeCoverageRelationStatistics Valid=2895, Invalid=23187, Unknown=0, NotChecked=0, Total=26082 [2019-12-07 19:40:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 19:40:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 181. [2019-12-07 19:40:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 19:40:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 202 transitions. [2019-12-07 19:40:18,269 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 202 transitions. Word has length 73 [2019-12-07 19:40:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:40:18,270 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 202 transitions. [2019-12-07 19:40:18,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-07 19:40:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 202 transitions. [2019-12-07 19:40:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 19:40:18,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:40:18,270 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:40:18,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:40:18,471 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:40:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:40:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1267059621, now seen corresponding path program 1 times [2019-12-07 19:40:18,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:40:18,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174307247] [2019-12-07 19:40:18,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:40:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:40:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:40:18,542 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:40:18,542 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:40:18,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:40:18 BoogieIcfgContainer [2019-12-07 19:40:18,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:40:18,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:40:18,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:40:18,612 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:40:18,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:34:15" (3/4) ... [2019-12-07 19:40:18,613 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:40:18,680 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cb305352-222b-441f-b338-1311a50751d8/bin/utaipan/witness.graphml [2019-12-07 19:40:18,680 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:40:18,681 INFO L168 Benchmark]: Toolchain (without parser) took 364173.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:40:18,681 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:40:18,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:40:18,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:40:18,682 INFO L168 Benchmark]: Boogie Preprocessor took 24.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:40:18,682 INFO L168 Benchmark]: RCFGBuilder took 879.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 925.8 MB in the end (delta: 163.7 MB). Peak memory consumption was 163.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:40:18,682 INFO L168 Benchmark]: TraceAbstraction took 362919.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:40:18,683 INFO L168 Benchmark]: Witness Printer took 69.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:40:18,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 879.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 925.8 MB in the end (delta: 163.7 MB). Peak memory consumption was 163.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 362919.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 41.9 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 69.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L691] int __retres1 ; [L695] e_wl = 2 [L696] e_c = e_wl [L697] e_g = e_c [L698] e_f = e_g [L699] e_e = e_f [L700] wl_pc = 0 [L701] c1_pc = 0 [L702] c2_pc = 0 [L703] wb_pc = 0 [L704] wb_i = 1 [L705] c2_i = wb_i [L706] c1_i = c2_i [L707] wl_i = c1_i [L708] r_i = 0 [L709] c_req_up = 0 [L710] d = 0 [L711] c = 0 [L402] int kernel_st ; [L405] kernel_st = 0 [L406] COND FALSE !((int )c_req_up == 1) [L417] COND TRUE (int )wl_i == 1 [L418] wl_st = 0 [L422] COND TRUE (int )c1_i == 1 [L423] c1_st = 0 [L427] COND TRUE (int )c2_i == 1 [L428] c2_st = 0 [L432] COND TRUE (int )wb_i == 1 [L433] wb_st = 0 [L437] COND FALSE !((int )r_i == 1) [L440] r_st = 2 [L442] COND FALSE !((int )e_f == 0) [L447] COND FALSE !((int )e_g == 0) [L452] COND FALSE !((int )e_e == 0) [L457] COND FALSE !((int )e_c == 0) [L462] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L467] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L475] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L485] COND FALSE !((int )c1_pc == 1) [L494] COND FALSE !((int )c2_pc == 1) [L503] COND FALSE !((int )wb_pc == 1) [L512] COND FALSE !((int )e_c == 1) [L517] COND FALSE !((int )e_e == 1) [L522] COND FALSE !((int )e_f == 1) [L527] COND FALSE !((int )e_g == 1) [L532] COND FALSE !((int )e_c == 1) [L537] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L296] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L298] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp) [L325] wl_st = 1 [L53] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L56] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L70] wl_st = 2 [L71] wl_pc = 1 [L72] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND TRUE \read(tmp___0) [L340] c1_st = 1 [L139] COND TRUE (int )c1_pc == 0 [L150] COND TRUE 1 [L152] c1_st = 2 [L153] c1_pc = 1 [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND TRUE \read(tmp___1) [L355] c2_st = 1 [L184] COND TRUE (int )c2_pc == 0 [L195] COND TRUE 1 [L197] c2_st = 2 [L198] c2_pc = 1 [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp___2) [L370] wb_st = 1 [L229] COND TRUE (int )wb_pc == 0 [L240] COND TRUE 1 [L242] wb_st = 2 [L243] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L379] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L296] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L301] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L304] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L307] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L310] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L549] kernel_st = 2 [L550] COND FALSE !((int )c_req_up == 1) [L561] kernel_st = 3 [L562] COND FALSE !((int )e_f == 0) [L567] COND FALSE !((int )e_g == 0) [L572] COND FALSE !((int )e_e == 0) [L577] COND FALSE !((int )e_c == 0) [L582] COND TRUE (int )e_wl == 0 [L583] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L587] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L588] COND TRUE (int )e_wl == 1 [L589] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L605] COND TRUE (int )c1_pc == 1 [L606] COND FALSE !((int )e_f == 1) [L614] COND TRUE (int )c2_pc == 1 [L615] COND FALSE !((int )e_f == 1) [L623] COND TRUE (int )wb_pc == 1 [L624] COND FALSE !((int )e_g == 1) [L632] COND FALSE !((int )e_c == 1) [L637] COND FALSE !((int )e_e == 1) [L642] COND FALSE !((int )e_f == 1) [L647] COND FALSE !((int )e_g == 1) [L652] COND FALSE !((int )e_c == 1) [L657] COND TRUE (int )e_wl == 1 [L658] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L662] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L296] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L298] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp) [L325] wl_st = 1 [L53] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L59] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L62] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L77] COND TRUE 1 [L79] t = d [L80] data = d [L81] processed = 0 [L82] e_f = 1 [L83] COND TRUE (int )c1_pc == 1 [L84] COND TRUE (int )e_f == 1 [L85] c1_st = 0 [L92] COND TRUE (int )c2_pc == 1 [L93] COND TRUE (int )e_f == 1 [L94] c2_st = 0 [L101] e_f = 2 [L102] wl_st = 2 [L103] wl_pc = 2 [L104] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L334] COND TRUE (int )c1_st == 0 [L336] tmp___0 = __VERIFIER_nondet_int() [L338] COND TRUE \read(tmp___0) [L340] c1_st = 1 [L139] COND FALSE !((int )c1_pc == 0) [L142] COND TRUE (int )c1_pc == 1 [L157] COND TRUE ! processed [L158] data += 1 [L159] e_g = 1 [L160] COND TRUE (int )wb_pc == 1 [L161] COND TRUE (int )e_g == 1 [L162] wb_st = 0 [L169] e_g = 2 [L150] COND TRUE 1 [L152] c1_st = 2 [L153] c1_pc = 1 [L349] COND TRUE (int )c2_st == 0 [L351] tmp___1 = __VERIFIER_nondet_int() [L353] COND TRUE \read(tmp___1) [L355] c2_st = 1 [L184] COND FALSE !((int )c2_pc == 0) [L187] COND TRUE (int )c2_pc == 1 [L202] COND TRUE ! processed [L203] data += 1 [L204] e_g = 1 [L205] COND TRUE (int )wb_pc == 1 [L206] COND TRUE (int )e_g == 1 [L207] wb_st = 0 [L214] e_g = 2 [L195] COND TRUE 1 [L197] c2_st = 2 [L198] c2_pc = 1 [L364] COND TRUE (int )wb_st == 0 [L366] tmp___2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp___2) [L370] wb_st = 1 [L229] COND FALSE !((int )wb_pc == 0) [L232] COND TRUE (int )wb_pc == 1 [L247] c_t = data [L248] c_req_up = 1 [L249] processed = 1 [L240] COND TRUE 1 [L242] wb_st = 2 [L243] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L379] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L296] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L301] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L304] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L307] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L310] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L549] kernel_st = 2 [L550] COND TRUE (int )c_req_up == 1 [L551] COND TRUE c != c_t [L552] c = c_t [L553] e_c = 0 [L557] c_req_up = 0 [L561] kernel_st = 3 [L562] COND FALSE !((int )e_f == 0) [L567] COND FALSE !((int )e_g == 0) [L572] COND FALSE !((int )e_e == 0) [L577] COND TRUE (int )e_c == 0 [L578] e_c = 1 [L582] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L587] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L595] COND TRUE (int )wl_pc == 2 [L596] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND TRUE (int )c1_pc == 1 [L606] COND FALSE !((int )e_f == 1) [L614] COND TRUE (int )c2_pc == 1 [L615] COND FALSE !((int )e_f == 1) [L623] COND TRUE (int )wb_pc == 1 [L624] COND FALSE !((int )e_g == 1) [L632] COND TRUE (int )e_c == 1 [L633] r_st = 0 [L637] COND FALSE !((int )e_e == 1) [L642] COND FALSE !((int )e_f == 1) [L647] COND FALSE !((int )e_g == 1) [L652] COND TRUE (int )e_c == 1 [L653] e_c = 2 [L657] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L662] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L665] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L668] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L671] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L674] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L543] COND TRUE 1 [L546] kernel_st = 1 [L288] int tmp ; [L289] int tmp___0 ; [L290] int tmp___1 ; [L291] int tmp___2 ; [L292] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L296] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L301] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L304] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L307] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L310] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L319] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L334] COND FALSE !((int )c1_st == 0) [L349] COND FALSE !((int )c2_st == 0) [L364] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L379] COND TRUE (int )r_st == 0 [L381] tmp___3 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp___3) [L385] r_st = 1 [L261] d = c [L262] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L263] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L271] COND TRUE (int )wl_pc == 2 [L272] COND TRUE (int )e_e == 1 [L273] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L281] e_e = 2 [L282] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L296] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L298] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L319] COND TRUE (int )wl_st == 0 [L321] tmp = __VERIFIER_nondet_int() [L323] COND TRUE \read(tmp) [L325] wl_st = 1 [L53] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L59] COND TRUE (int )wl_pc == 2 [L108] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L109] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L112] COND TRUE d == t + 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L120] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L13] __VERIFIER_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 2 error locations. Result: UNSAFE, OverallTime: 362.8s, OverallIterations: 15, TraceHistogramMax: 6, AutomataDifference: 57.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1168 SDtfs, 6920 SDslu, 6805 SDs, 0 SdLazy, 6078 SolverSat, 1316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 937 SyntacticMatches, 57 SemanticMatches, 586 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30065 ImplicationChecksByTransitivity, 318.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=463occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 2483 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 209.3s InterpolantComputationTime, 1241 NumberOfCodeBlocks, 1241 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1583 ConstructedInterpolants, 0 QuantifiedInterpolants, 3070452 SizeOfPredicates, 156 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 806/1356 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...