./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.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_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 d321e3b1b642bcfc9c94c4888bd187898cb1af58 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:26:11,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:26:11,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:26:11,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:26:11,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:26:11,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:26:11,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:26:11,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:26:11,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:26:11,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:26:11,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:26:11,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:26:11,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:26:11,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:26:11,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:26:11,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:26:11,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:26:11,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:26:11,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:26:11,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:26:11,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:26:11,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:26:11,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:26:11,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:26:11,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:26:11,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:26:11,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:26:11,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:26:11,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:26:11,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:26:11,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:26:11,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:26:11,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:26:11,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:26:11,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:26:11,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:26:11,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:26:11,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:26:11,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:26:11,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:26:11,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:26:11,361 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:26:11,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:26:11,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:26:11,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:26:11,374 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:26:11,374 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:26:11,375 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:26:11,376 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:26:11,376 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:26:11,376 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:26:11,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:26:11,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:26:11,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:26:11,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:26:11,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:26:11,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:26:11,379 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_cb142cd4-99d9-4574-928f-8045505a482e/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 -> d321e3b1b642bcfc9c94c4888bd187898cb1af58 [2019-12-07 20:26:11,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:26:11,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:26:11,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:26:11,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:26:11,499 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:26:11,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-12-07 20:26:11,535 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/data/2b18db160/45e8da959efe42438cdd9bcd0e533cda/FLAG9efda8533 [2019-12-07 20:26:11,974 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:26:11,975 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2019-12-07 20:26:11,980 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/data/2b18db160/45e8da959efe42438cdd9bcd0e533cda/FLAG9efda8533 [2019-12-07 20:26:11,989 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/data/2b18db160/45e8da959efe42438cdd9bcd0e533cda [2019-12-07 20:26:11,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:26:11,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:26:11,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:26:11,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:26:11,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:26:11,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:26:11" (1/1) ... [2019-12-07 20:26:11,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791e404e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:11, skipping insertion in model container [2019-12-07 20:26:11,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:26:11" (1/1) ... [2019-12-07 20:26:12,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:26:12,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:26:12,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:26:12,180 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:26:12,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:26:12,215 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:26:12,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12 WrapperNode [2019-12-07 20:26:12,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:26:12,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:26:12,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:26:12,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:26:12,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:26:12,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:26:12,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:26:12,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:26:12,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... [2019-12-07 20:26:12,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:26:12,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:26:12,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:26:12,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:26:12,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:12,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:26:12,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:26:12,766 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:26:12,766 INFO L287 CfgBuilder]: Removed 58 assume(true) statements. [2019-12-07 20:26:12,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:26:12 BoogieIcfgContainer [2019-12-07 20:26:12,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:26:12,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:26:12,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:26:12,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:26:12,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:26:11" (1/3) ... [2019-12-07 20:26:12,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e359cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:26:12, skipping insertion in model container [2019-12-07 20:26:12,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:26:12" (2/3) ... [2019-12-07 20:26:12,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e359cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:26:12, skipping insertion in model container [2019-12-07 20:26:12,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:26:12" (3/3) ... [2019-12-07 20:26:12,774 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2019-12-07 20:26:12,782 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:26:12,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:26:12,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 20:26:12,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:26:12,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:26:12,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:26:12,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:26:12,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:26:12,810 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:26:12,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:26:12,811 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:26:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-07 20:26:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:26:12,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:12,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:12,825 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1898821100, now seen corresponding path program 1 times [2019-12-07 20:26:12,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:12,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756179583] [2019-12-07 20:26:12,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:12,925 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 20:26:12,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756179583] [2019-12-07 20:26:12,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:12,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:26:12,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377298322] [2019-12-07 20:26:12,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:12,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:12,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:12,947 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-07 20:26:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:12,989 INFO L93 Difference]: Finished difference Result 119 states and 187 transitions. [2019-12-07 20:26:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:12,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:26:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:13,001 INFO L225 Difference]: With dead ends: 119 [2019-12-07 20:26:13,002 INFO L226 Difference]: Without dead ends: 73 [2019-12-07 20:26:13,005 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 20:26:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-07 20:26:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2019-12-07 20:26:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 20:26:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-12-07 20:26:13,040 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 18 [2019-12-07 20:26:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:13,040 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-12-07 20:26:13,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-12-07 20:26:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 20:26:13,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:13,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:13,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash -281150675, now seen corresponding path program 1 times [2019-12-07 20:26:13,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:13,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42436141] [2019-12-07 20:26:13,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:13,088 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 20:26:13,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42436141] [2019-12-07 20:26:13,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:13,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:26:13,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324185751] [2019-12-07 20:26:13,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:13,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:13,090 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 3 states. [2019-12-07 20:26:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:13,117 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2019-12-07 20:26:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:13,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 20:26:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:13,120 INFO L225 Difference]: With dead ends: 180 [2019-12-07 20:26:13,120 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 20:26:13,121 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 20:26:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 20:26:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2019-12-07 20:26:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-12-07 20:26:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2019-12-07 20:26:13,135 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 18 [2019-12-07 20:26:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:13,135 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2019-12-07 20:26:13,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2019-12-07 20:26:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:26:13,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:13,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:13,136 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash -356690393, now seen corresponding path program 1 times [2019-12-07 20:26:13,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:13,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410678529] [2019-12-07 20:26:13,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:13,177 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 20:26:13,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410678529] [2019-12-07 20:26:13,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:13,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:26:13,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956468279] [2019-12-07 20:26:13,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:13,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:13,179 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand 3 states. [2019-12-07 20:26:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:13,203 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2019-12-07 20:26:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:13,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 20:26:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:13,206 INFO L225 Difference]: With dead ends: 215 [2019-12-07 20:26:13,206 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 20:26:13,207 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 20:26:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 20:26:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-12-07 20:26:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 20:26:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2019-12-07 20:26:13,221 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 19 [2019-12-07 20:26:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:13,221 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2019-12-07 20:26:13,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2019-12-07 20:26:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:26:13,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:13,223 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:13,223 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash -454140208, now seen corresponding path program 1 times [2019-12-07 20:26:13,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:13,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561457354] [2019-12-07 20:26:13,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:13,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561457354] [2019-12-07 20:26:13,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:13,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:26:13,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753268050] [2019-12-07 20:26:13,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:26:13,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:13,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:26:13,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:26:13,270 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand 4 states. [2019-12-07 20:26:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:13,306 INFO L93 Difference]: Finished difference Result 395 states and 577 transitions. [2019-12-07 20:26:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:26:13,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 20:26:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:13,308 INFO L225 Difference]: With dead ends: 395 [2019-12-07 20:26:13,308 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 20:26:13,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:26:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 20:26:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 177. [2019-12-07 20:26:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-12-07 20:26:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2019-12-07 20:26:13,322 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 258 transitions. Word has length 26 [2019-12-07 20:26:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:13,322 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 258 transitions. [2019-12-07 20:26:13,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:26:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2019-12-07 20:26:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 20:26:13,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:13,324 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 20:26:13,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:13,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1175961084, now seen corresponding path program 1 times [2019-12-07 20:26:13,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:13,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445016877] [2019-12-07 20:26:13,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:13,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445016877] [2019-12-07 20:26:13,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:13,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:26:13,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442324469] [2019-12-07 20:26:13,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:26:13,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:26:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:26:13,358 INFO L87 Difference]: Start difference. First operand 177 states and 258 transitions. Second operand 4 states. [2019-12-07 20:26:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:13,380 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2019-12-07 20:26:13,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:26:13,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-07 20:26:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:13,381 INFO L225 Difference]: With dead ends: 216 [2019-12-07 20:26:13,381 INFO L226 Difference]: Without dead ends: 214 [2019-12-07 20:26:13,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:26:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-07 20:26:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 175. [2019-12-07 20:26:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 20:26:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2019-12-07 20:26:13,394 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 26 [2019-12-07 20:26:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:13,394 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2019-12-07 20:26:13,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:26:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2019-12-07 20:26:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 20:26:13,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:13,395 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:26:13,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2095066805, now seen corresponding path program 1 times [2019-12-07 20:26:13,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:13,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227848644] [2019-12-07 20:26:13,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:13,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227848644] [2019-12-07 20:26:13,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400582347] [2019-12-07 20:26:13,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:13,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:26:13,484 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:13,516 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:13,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [881821221] [2019-12-07 20:26:13,540 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2019-12-07 20:26:13,540 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:26:13,544 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:26:13,548 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:26:13,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:26:13,943 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:26:14,443 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-12-07 20:26:14,683 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 58 [2019-12-07 20:26:14,867 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 64 [2019-12-07 20:26:15,001 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-12-07 20:26:15,710 WARN L192 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 105 [2019-12-07 20:26:16,111 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 73 [2019-12-07 20:26:16,413 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 82 [2019-12-07 20:26:16,690 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 79 [2019-12-07 20:26:17,143 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 83 [2019-12-07 20:26:17,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:26:17,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [3, 4, 3] total 20 [2019-12-07 20:26:17,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703980536] [2019-12-07 20:26:17,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 20:26:17,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:17,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 20:26:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:26:17,196 INFO L87 Difference]: Start difference. First operand 175 states and 255 transitions. Second operand 16 states. [2019-12-07 20:26:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:17,695 INFO L93 Difference]: Finished difference Result 313 states and 463 transitions. [2019-12-07 20:26:17,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:26:17,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-12-07 20:26:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:17,697 INFO L225 Difference]: With dead ends: 313 [2019-12-07 20:26:17,697 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 20:26:17,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:26:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 20:26:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2019-12-07 20:26:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-07 20:26:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 197 transitions. [2019-12-07 20:26:17,708 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 197 transitions. Word has length 27 [2019-12-07 20:26:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:17,709 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 197 transitions. [2019-12-07 20:26:17,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 20:26:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 197 transitions. [2019-12-07 20:26:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 20:26:17,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:17,710 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, 1, 1, 1, 1, 1] [2019-12-07 20:26:17,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:17,911 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:17,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2790896, now seen corresponding path program 1 times [2019-12-07 20:26:17,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:17,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871513862] [2019-12-07 20:26:17,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:17,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871513862] [2019-12-07 20:26:17,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:17,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:17,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696058300] [2019-12-07 20:26:17,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:17,969 INFO L87 Difference]: Start difference. First operand 139 states and 197 transitions. Second operand 3 states. [2019-12-07 20:26:17,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:17,989 INFO L93 Difference]: Finished difference Result 248 states and 359 transitions. [2019-12-07 20:26:17,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:17,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 20:26:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:17,991 INFO L225 Difference]: With dead ends: 248 [2019-12-07 20:26:17,991 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 20:26:17,991 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 20:26:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 20:26:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2019-12-07 20:26:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 20:26:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 183 transitions. [2019-12-07 20:26:18,003 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 183 transitions. Word has length 39 [2019-12-07 20:26:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:18,003 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 183 transitions. [2019-12-07 20:26:18,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 183 transitions. [2019-12-07 20:26:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 20:26:18,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:18,005 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, 1, 1, 1, 1, 1] [2019-12-07 20:26:18,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:18,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1173813423, now seen corresponding path program 1 times [2019-12-07 20:26:18,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:18,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150722872] [2019-12-07 20:26:18,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:18,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150722872] [2019-12-07 20:26:18,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896752824] [2019-12-07 20:26:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:18,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:26:18,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:26:18,106 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:26:18,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:26:18,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 5 [2019-12-07 20:26:18,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658477795] [2019-12-07 20:26:18,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:18,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:26:18,112 INFO L87 Difference]: Start difference. First operand 135 states and 183 transitions. Second operand 3 states. [2019-12-07 20:26:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:18,132 INFO L93 Difference]: Finished difference Result 287 states and 397 transitions. [2019-12-07 20:26:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 20:26:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:18,133 INFO L225 Difference]: With dead ends: 287 [2019-12-07 20:26:18,133 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 20:26:18,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:26:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 20:26:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-12-07 20:26:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 20:26:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 243 transitions. [2019-12-07 20:26:18,142 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 243 transitions. Word has length 39 [2019-12-07 20:26:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:18,142 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 243 transitions. [2019-12-07 20:26:18,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 243 transitions. [2019-12-07 20:26:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 20:26:18,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:18,143 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 20:26:18,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:18,344 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1095468772, now seen corresponding path program 1 times [2019-12-07 20:26:18,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:18,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827324500] [2019-12-07 20:26:18,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:18,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827324500] [2019-12-07 20:26:18,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51190829] [2019-12-07 20:26:18,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:18,488 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 20:26:18,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:18,499 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:18,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:26:18,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 7 [2019-12-07 20:26:18,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091735530] [2019-12-07 20:26:18,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:26:18,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:26:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:26:18,508 INFO L87 Difference]: Start difference. First operand 182 states and 243 transitions. Second operand 5 states. [2019-12-07 20:26:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:18,538 INFO L93 Difference]: Finished difference Result 357 states and 482 transitions. [2019-12-07 20:26:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:26:18,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 20:26:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:18,539 INFO L225 Difference]: With dead ends: 357 [2019-12-07 20:26:18,539 INFO L226 Difference]: Without dead ends: 207 [2019-12-07 20:26:18,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:26:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-07 20:26:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 137. [2019-12-07 20:26:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-12-07 20:26:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2019-12-07 20:26:18,546 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 40 [2019-12-07 20:26:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:18,547 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2019-12-07 20:26:18,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:26:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2019-12-07 20:26:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 20:26:18,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:18,548 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1] [2019-12-07 20:26:18,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:18,748 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1536780824, now seen corresponding path program 1 times [2019-12-07 20:26:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:18,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883791547] [2019-12-07 20:26:18,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:18,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:26:18,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883791547] [2019-12-07 20:26:18,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709462301] [2019-12-07 20:26:18,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:18,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 20:26:18,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:26:18,902 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:26:18,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:26:18,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 5 [2019-12-07 20:26:18,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762520448] [2019-12-07 20:26:18,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:26:18,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:18,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:26:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:26:18,911 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand 4 states. [2019-12-07 20:26:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:18,959 INFO L93 Difference]: Finished difference Result 360 states and 481 transitions. [2019-12-07 20:26:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:26:18,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 20:26:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:18,962 INFO L225 Difference]: With dead ends: 360 [2019-12-07 20:26:18,962 INFO L226 Difference]: Without dead ends: 264 [2019-12-07 20:26:18,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:26:18,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-07 20:26:18,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 163. [2019-12-07 20:26:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 20:26:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 214 transitions. [2019-12-07 20:26:18,974 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 214 transitions. Word has length 50 [2019-12-07 20:26:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:18,974 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 214 transitions. [2019-12-07 20:26:18,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:26:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2019-12-07 20:26:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 20:26:18,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:18,975 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1] [2019-12-07 20:26:19,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:19,177 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1767021799, now seen corresponding path program 1 times [2019-12-07 20:26:19,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:19,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396480386] [2019-12-07 20:26:19,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:26:19,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396480386] [2019-12-07 20:26:19,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:19,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:19,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113480654] [2019-12-07 20:26:19,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:19,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:19,219 INFO L87 Difference]: Start difference. First operand 163 states and 214 transitions. Second operand 3 states. [2019-12-07 20:26:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:19,239 INFO L93 Difference]: Finished difference Result 286 states and 383 transitions. [2019-12-07 20:26:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:19,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 20:26:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:19,241 INFO L225 Difference]: With dead ends: 286 [2019-12-07 20:26:19,241 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 20:26:19,242 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 20:26:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 20:26:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 113. [2019-12-07 20:26:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 20:26:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2019-12-07 20:26:19,251 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 50 [2019-12-07 20:26:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:19,252 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2019-12-07 20:26:19,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2019-12-07 20:26:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 20:26:19,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:19,252 INFO L410 BasicCegarLoop]: trace histogram [4, 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 20:26:19,253 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1328574261, now seen corresponding path program 1 times [2019-12-07 20:26:19,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:19,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010235746] [2019-12-07 20:26:19,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:26:19,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010235746] [2019-12-07 20:26:19,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526244936] [2019-12-07 20:26:19,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:19,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 20:26:19,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:26:19,354 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:26:19,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [706091204] [2019-12-07 20:26:19,367 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2019-12-07 20:26:19,367 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:26:19,368 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:26:19,368 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:26:19,368 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:26:21,342 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:26:21,541 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-12-07 20:26:22,116 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-07 20:26:22,314 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-12-07 20:26:22,578 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-12-07 20:26:22,887 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 68 [2019-12-07 20:26:23,154 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-12-07 20:26:23,458 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-12-07 20:26:23,735 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-12-07 20:26:24,021 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2019-12-07 20:26:24,222 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-12-07 20:26:24,613 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2019-12-07 20:26:24,825 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 70 [2019-12-07 20:26:25,052 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-12-07 20:26:25,360 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-12-07 20:26:25,928 WARN L192 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 74 [2019-12-07 20:26:26,482 WARN L192 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2019-12-07 20:26:26,821 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-12-07 20:26:27,066 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-12-07 20:26:27,293 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 80 [2019-12-07 20:26:27,530 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-12-07 20:26:27,531 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:26:27,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:26:27,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 6 [2019-12-07 20:26:27,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122121804] [2019-12-07 20:26:27,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:26:27,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:27,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:26:27,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-07 20:26:27,533 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand 7 states. [2019-12-07 20:26:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:27,575 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2019-12-07 20:26:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:26:27,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 20:26:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:27,577 INFO L225 Difference]: With dead ends: 373 [2019-12-07 20:26:27,577 INFO L226 Difference]: Without dead ends: 371 [2019-12-07 20:26:27,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 121 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-12-07 20:26:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-07 20:26:27,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 213. [2019-12-07 20:26:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-07 20:26:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 268 transitions. [2019-12-07 20:26:27,588 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 268 transitions. Word has length 51 [2019-12-07 20:26:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:27,588 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 268 transitions. [2019-12-07 20:26:27,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:26:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 268 transitions. [2019-12-07 20:26:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 20:26:27,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:27,589 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 20:26:27,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:27,790 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2139029226, now seen corresponding path program 1 times [2019-12-07 20:26:27,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:27,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111354236] [2019-12-07 20:26:27,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:27,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111354236] [2019-12-07 20:26:27,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771797624] [2019-12-07 20:26:27,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:27,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 20:26:28,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:26:28,029 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:26:28,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:26:28,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [12] total 18 [2019-12-07 20:26:28,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113424850] [2019-12-07 20:26:28,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:26:28,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:26:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:26:28,093 INFO L87 Difference]: Start difference. First operand 213 states and 268 transitions. Second operand 9 states. [2019-12-07 20:26:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:28,198 INFO L93 Difference]: Finished difference Result 530 states and 670 transitions. [2019-12-07 20:26:28,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 20:26:28,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-07 20:26:28,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:28,200 INFO L225 Difference]: With dead ends: 530 [2019-12-07 20:26:28,201 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 20:26:28,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:26:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 20:26:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-12-07 20:26:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-12-07 20:26:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 360 transitions. [2019-12-07 20:26:28,219 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 360 transitions. Word has length 51 [2019-12-07 20:26:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:28,219 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 360 transitions. [2019-12-07 20:26:28,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:26:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 360 transitions. [2019-12-07 20:26:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 20:26:28,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:28,220 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 20:26:28,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:28,421 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:28,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1618297602, now seen corresponding path program 1 times [2019-12-07 20:26:28,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:28,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107162064] [2019-12-07 20:26:28,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:26:28,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107162064] [2019-12-07 20:26:28,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394421521] [2019-12-07 20:26:28,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/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 20:26:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:28,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 20:26:28,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:26:28,548 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:26:28,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:26:28,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 7] total 14 [2019-12-07 20:26:28,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16669832] [2019-12-07 20:26:28,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:26:28,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:28,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:26:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:26:28,600 INFO L87 Difference]: Start difference. First operand 283 states and 360 transitions. Second operand 6 states. [2019-12-07 20:26:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:28,652 INFO L93 Difference]: Finished difference Result 641 states and 817 transitions. [2019-12-07 20:26:28,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:26:28,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-07 20:26:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:28,654 INFO L225 Difference]: With dead ends: 641 [2019-12-07 20:26:28,654 INFO L226 Difference]: Without dead ends: 398 [2019-12-07 20:26:28,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:26:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-12-07 20:26:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 262. [2019-12-07 20:26:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 20:26:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 323 transitions. [2019-12-07 20:26:28,670 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 323 transitions. Word has length 52 [2019-12-07 20:26:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:28,670 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 323 transitions. [2019-12-07 20:26:28,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:26:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 323 transitions. [2019-12-07 20:26:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 20:26:28,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:28,670 INFO L410 BasicCegarLoop]: trace histogram [4, 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 20:26:28,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:28,871 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1989896099, now seen corresponding path program 2 times [2019-12-07 20:26:28,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:28,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985917923] [2019-12-07 20:26:28,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:26:28,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985917923] [2019-12-07 20:26:28,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:26:28,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:26:28,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260717989] [2019-12-07 20:26:28,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:26:28,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:26:28,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:26:28,886 INFO L87 Difference]: Start difference. First operand 262 states and 323 transitions. Second operand 3 states. [2019-12-07 20:26:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:28,906 INFO L93 Difference]: Finished difference Result 495 states and 613 transitions. [2019-12-07 20:26:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:26:28,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 20:26:28,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:28,907 INFO L225 Difference]: With dead ends: 495 [2019-12-07 20:26:28,907 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 20:26:28,908 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 20:26:28,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 20:26:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-12-07 20:26:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 20:26:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 319 transitions. [2019-12-07 20:26:28,923 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 319 transitions. Word has length 54 [2019-12-07 20:26:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:28,923 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 319 transitions. [2019-12-07 20:26:28,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:26:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 319 transitions. [2019-12-07 20:26:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 20:26:28,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:28,924 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1] [2019-12-07 20:26:28,924 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1233923597, now seen corresponding path program 1 times [2019-12-07 20:26:28,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:28,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92515757] [2019-12-07 20:26:28,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:29,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92515757] [2019-12-07 20:26:29,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514696471] [2019-12-07 20:26:29,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:29,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 20:26:29,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:29,210 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:26:29,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1073743406] [2019-12-07 20:26:29,321 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2019-12-07 20:26:29,321 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:26:29,321 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 20:26:29,322 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 20:26:29,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 20:26:31,356 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 20:26:31,597 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-12-07 20:26:32,292 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-12-07 20:26:32,532 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-12-07 20:26:32,818 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-12-07 20:26:33,059 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 82 [2019-12-07 20:26:33,500 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 97 [2019-12-07 20:26:34,020 WARN L192 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2019-12-07 20:26:34,595 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-12-07 20:26:35,195 WARN L192 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 112 [2019-12-07 20:26:35,512 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2019-12-07 20:26:35,806 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-12-07 20:26:36,297 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 84 [2019-12-07 20:26:36,667 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2019-12-07 20:26:37,017 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-12-07 20:26:37,446 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-12-07 20:26:37,837 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 76 [2019-12-07 20:26:38,132 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-12-07 20:26:38,435 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-12-07 20:26:38,715 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-12-07 20:26:39,024 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-12-07 20:26:39,024 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 20:26:39,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:26:39,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 7] total 23 [2019-12-07 20:26:39,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89654997] [2019-12-07 20:26:39,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 20:26:39,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 20:26:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1854, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 20:26:39,026 INFO L87 Difference]: Start difference. First operand 262 states and 319 transitions. Second operand 24 states. [2019-12-07 20:26:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:40,924 INFO L93 Difference]: Finished difference Result 929 states and 1151 transitions. [2019-12-07 20:26:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 20:26:40,924 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2019-12-07 20:26:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:40,927 INFO L225 Difference]: With dead ends: 929 [2019-12-07 20:26:40,927 INFO L226 Difference]: Without dead ends: 716 [2019-12-07 20:26:40,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3242 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1738, Invalid=7004, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 20:26:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-12-07 20:26:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 552. [2019-12-07 20:26:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-12-07 20:26:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 683 transitions. [2019-12-07 20:26:40,965 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 683 transitions. Word has length 56 [2019-12-07 20:26:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:40,965 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 683 transitions. [2019-12-07 20:26:40,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 20:26:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 683 transitions. [2019-12-07 20:26:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 20:26:40,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:26:40,966 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2019-12-07 20:26:41,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:41,166 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:26:41,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:26:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1005489206, now seen corresponding path program 1 times [2019-12-07 20:26:41,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:26:41,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443991848] [2019-12-07 20:26:41,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:26:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:26:41,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443991848] [2019-12-07 20:26:41,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876019797] [2019-12-07 20:26:41,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:26:41,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 20:26:41,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:26:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:26:41,323 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:26:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:26:41,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:26:41,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 16 [2019-12-07 20:26:41,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710676373] [2019-12-07 20:26:41,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:26:41,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:26:41,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:26:41,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:26:41,365 INFO L87 Difference]: Start difference. First operand 552 states and 683 transitions. Second operand 6 states. [2019-12-07 20:26:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:26:41,403 INFO L93 Difference]: Finished difference Result 703 states and 869 transitions. [2019-12-07 20:26:41,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:26:41,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 20:26:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:26:41,403 INFO L225 Difference]: With dead ends: 703 [2019-12-07 20:26:41,403 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:26:41,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 20:26:41,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:26:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:26:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:26:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:26:41,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-12-07 20:26:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:26:41,405 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:26:41,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:26:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:26:41,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:26:41,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:26:41,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:26:41,745 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 233 [2019-12-07 20:26:42,276 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2019-12-07 20:26:43,604 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 227 DAG size of output: 148 [2019-12-07 20:26:43,771 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-07 20:26:44,127 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 108 [2019-12-07 20:26:45,872 WARN L192 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 227 DAG size of output: 128 [2019-12-07 20:26:47,651 WARN L192 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 199 DAG size of output: 139 [2019-12-07 20:26:47,868 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2019-12-07 20:26:48,088 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2019-12-07 20:26:48,412 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-12-07 20:26:48,414 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 20:26:48,414 INFO L246 CegarLoopResult]: For program point L118(lines 118 126) no Hoare annotation was computed. [2019-12-07 20:26:48,415 INFO L242 CegarLoopResult]: At program point L85(lines 73 87) the Hoare annotation is: (and (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (= ~q_read_ev~0 2) (= ~q_ev~0 0) (= 0 ~q_req_up~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= 0 ~q_buf_0~0) (= 0 ~p_dw_st~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (= ~c_num_read~0 0) (= ~q_write_ev~0 2) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= 1 ~q_free~0) (= ~c_dr_pc~0 0) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) [2019-12-07 20:26:48,415 INFO L242 CegarLoopResult]: At program point L85-1(lines 73 87) the Hoare annotation is: (let ((.cse4 (= 0 ~q_free~0))) (let ((.cse6 (not (= ~q_read_ev~0 1))) (.cse2 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse9 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse0 (not (= ~q_write_ev~0 0))) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse5 (= 0 ~p_dw_st~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 1 ~p_dw_pc~0)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse14 (or (not .cse4) (not (= 1 ~q_req_up~0))))) (or (let ((.cse1 (+ ~c_num_read~0 1))) (and .cse0 (<= .cse1 ~p_num_write~0) .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 (<= ~p_num_write~0 .cse1) .cse8 .cse9 .cse10)) (and .cse11 .cse3 .cse6 .cse7 .cse12 .cse8 .cse10 .cse13 .cse14 .cse0 .cse15 .cse2 .cse16 .cse9) (and .cse0 .cse15 .cse11 .cse3 .cse7 .cse5 .cse16 .cse12 .cse8 .cse10 .cse13 .cse14)))) [2019-12-07 20:26:48,415 INFO L249 CegarLoopResult]: At program point L432(lines 395 437) the Hoare annotation is: true [2019-12-07 20:26:48,415 INFO L249 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-12-07 20:26:48,415 INFO L246 CegarLoopResult]: For program point L334(lines 334 338) no Hoare annotation was computed. [2019-12-07 20:26:48,415 INFO L246 CegarLoopResult]: For program point L334-1(lines 329 369) no Hoare annotation was computed. [2019-12-07 20:26:48,415 INFO L246 CegarLoopResult]: For program point L121(lines 121 125) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L55(lines 55 64) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L55-3(lines 55 64) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L55-5(lines 55 64) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L171(lines 170 201) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L188(lines 188 200) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L56(lines 56 61) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L56-1(lines 56 61) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L242 CegarLoopResult]: At program point L370(lines 322 375) the Hoare annotation is: (let ((.cse18 (= 0 ~p_dw_st~0)) (.cse19 (+ ~c_num_read~0 1)) (.cse16 (= 0 ~q_free~0)) (.cse14 (= 1 ~q_req_up~0))) (let ((.cse10 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse13 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not .cse16) (not .cse14))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 0))) (.cse15 (<= .cse19 ~p_num_write~0)) (.cse1 (not (= ~q_read_ev~0 0))) (.cse11 (not .cse18)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_dr_pc~0 1)) (.cse17 (<= ~p_num_write~0 .cse19)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse9 .cse0 (= ~q_read_ev~0 2) (= ~q_write_ev~0 2) .cse11 .cse14 .cse3 (= 1 ~q_free~0) (= ~c_dr_st~0 2) .cse4 .cse5) (and .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse16 .cse11 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12) (and .cse8 .cse15 .cse1 .cse16 .cse11 .cse2 .cse3 .cse17 .cse12 .cse4 .cse5 .cse6)))) [2019-12-07 20:26:48,416 INFO L246 CegarLoopResult]: For program point L172-1(lines 172 182) no Hoare annotation was computed. [2019-12-07 20:26:48,416 INFO L242 CegarLoopResult]: At program point L354(lines 329 369) the Hoare annotation is: (let ((.cse15 (= 1 ~q_req_up~0))) (let ((.cse13 (= ~c_dr_st~0 0)) (.cse39 (+ ~c_num_read~0 1)) (.cse5 (= 0 ~p_dw_st~0)) (.cse22 (= 0 ~q_free~0)) (.cse38 (not .cse15))) (let ((.cse27 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse25 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse19 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse14 (= 1 ~c_dr_i~0)) (.cse16 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse23 (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse17 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse24 (= ~a_t~0 0)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (or (not .cse22) .cse38)) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse30 (= ~q_read_ev~0 2)) (.cse31 (= 0 ~p_dw_pc~0)) (.cse21 (= 1 ULTIMATE.start_eval_~tmp___1~0)) (.cse32 (= ~c_num_read~0 0)) (.cse33 (= ~q_write_ev~0 2)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse35 (= 1 ~q_free~0)) (.cse37 (= ~c_dr_st~0 2)) (.cse36 (= 0 ~p_num_write~0)) (.cse1 (not (= ~q_read_ev~0 0))) (.cse28 (not .cse5)) (.cse3 (not (= ~q_read_ev~0 1))) (.cse2 (not (= 0 ULTIMATE.start_eval_~tmp___1~0))) (.cse10 (not (= ~q_write_ev~0 0))) (.cse26 (<= .cse39 ~p_num_write~0)) (.cse4 (= ~c_dr_pc~0 1)) (.cse29 (<= ~p_num_write~0 .cse39)) (.cse12 (not .cse13)) (.cse20 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= 0 ~c_last_read~0) (<= ~p_dw_i~0 1) (<= 1 ~p_dw_i~0) (<= ULTIMATE.start_eval_~tmp~2 2147483647) .cse13 (<= ~c_num_read~0 0) .cse14 .cse15 .cse16 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse17 (<= ~q_read_ev~0 2) (<= ULTIMATE.start_eval_~tmp___0~2 2147483647) .cse18 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 0 ~q_ev~0) (<= ~q_buf_0~0 2147483647) (<= 2 ~q_write_ev~0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 0 ~c_num_read~0) .cse19 (<= 2 ~q_read_ev~0) (<= ~q_ev~0 0) (not (= ULTIMATE.start_eval_~tmp~2 0)) .cse20 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~2 2147483648)) .cse6 (<= ~c_dr_pc~0 0) (<= 0 ~c_dr_pc~0) .cse7 .cse21 (<= ULTIMATE.start_activate_threads_~tmp~1 0) .cse22 (= 2 ~p_dw_st~0) .cse23 (<= ~q_write_ev~0 2) (= 1 ~p_num_write~0) (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)) .cse24 .cse25 (<= ~c_last_read~0 0)) (and .cse26 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse27 .cse22 .cse28 .cse29 .cse25) (and .cse27 .cse1 (or (and .cse10 .cse11 .cse0 .cse2 .cse4 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse4 .cse12 .cse20 .cse6 .cse7 .cse8 .cse9)) .cse3 .cse25) (and (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) .cse30 (= ~q_ev~0 0) (= 0 ~q_req_up~0) .cse19 .cse5 .cse31 .cse20 (= 0 ~p_last_write~0) .cse6 .cse13 .cse14 .cse32 .cse33 .cse16 .cse23 .cse17 .cse34 .cse24 .cse35 (= ~c_dr_pc~0 0) .cse18 (= ~p_dw_i~0 1) .cse36) (and .cse11 .cse0 .cse30 .cse33 .cse15 .cse2 .cse4 .cse12 .cse35 .cse37 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse30 .cse4 .cse5 .cse31 .cse6 .cse38 .cse21 .cse32 .cse33 .cse34 .cse35 .cse37 .cse36) (and .cse1 .cse22 .cse28 .cse3 (or (and .cse10 .cse26 .cse2 .cse29 .cse4 .cse12 .cse6 .cse7 .cse8) (and .cse10 .cse26 .cse4 .cse29 .cse12 .cse20 .cse6 .cse7 .cse8))))))) [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L189(lines 189 195) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L74(lines 74 83) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L74-3(lines 74 83) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L74-5(lines 74 83) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L242 CegarLoopResult]: At program point L339(lines 329 369) the Hoare annotation is: (let ((.cse37 (= 1 ~q_req_up~0))) (let ((.cse16 (= ~c_dr_st~0 0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse44 (+ ~c_num_read~0 1)) (.cse38 (= 0 ~q_free~0)) (.cse43 (not .cse37))) (let ((.cse9 (or (not .cse38) .cse43)) (.cse15 (<= ULTIMATE.start_eval_~tmp~2 2147483647)) (.cse17 (= 1 ~c_dr_i~0)) (.cse19 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse20 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse23 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse25 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse26 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse27 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse31 (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse32 (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648))) (.cse34 (= ~a_t~0 0)) (.cse35 (= ~p_dw_i~0 1)) (.cse13 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse39 (<= .cse44 ~p_num_write~0)) (.cse1 (not (= ~q_read_ev~0 0))) (.cse3 (not (= ~q_read_ev~0 1))) (.cse8 (not (= ~q_write_ev~0 1))) (.cse10 (not (= ~q_write_ev~0 0))) (.cse40 (not .cse5)) (.cse41 (<= ~p_num_write~0 .cse44)) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (not (= 0 ULTIMATE.start_eval_~tmp___1~0))) (.cse12 (not .cse16)) (.cse7 (= 1 ~p_dw_pc~0)) (.cse24 (= ~q_read_ev~0 2)) (.cse4 (= ~c_dr_pc~0 1)) (.cse28 (= 0 ~p_dw_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse29 (= 1 ULTIMATE.start_eval_~tmp___1~0)) (.cse30 (= ~c_num_read~0 0)) (.cse18 (= ~q_write_ev~0 2)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= 1 ~q_free~0)) (.cse42 (= ~c_dr_st~0 2)) (.cse36 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~c_dr_pc~0 0) .cse22 .cse23 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) .cse24 (= ~q_ev~0 0) .cse25 (= 0 ~q_req_up~0) .cse26 (= 0 ~q_buf_0~0) .cse5 .cse27 .cse28 .cse6 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse15 (= ~c_last_read~0 0) .cse16 .cse17 .cse19 .cse37 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse20 .cse22 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse23 (<= 0 ~q_ev~0) .cse24 (<= ~q_buf_0~0 2147483647) (<= 2 ~q_write_ev~0) .cse25 .cse26 (<= ~q_ev~0 0) (not (= ULTIMATE.start_eval_~tmp~2 0)) .cse27 .cse6 (<= ~c_dr_pc~0 0) (<= 0 ~c_dr_pc~0) .cse7 .cse30 (<= ULTIMATE.start_activate_threads_~tmp~1 0) .cse38 (= 2 ~p_dw_st~0) .cse31 (<= ~q_write_ev~0 2) (= 1 ~p_num_write~0) .cse32 .cse34 .cse35 .cse14) (and .cse39 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse13 .cse38 .cse40 .cse41 .cse14) (and .cse39 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 .cse38 .cse40 .cse41 .cse12) (and .cse11 .cse0 .cse24 .cse18 .cse37 .cse2 .cse4 .cse12 .cse21 .cse42 .cse6 .cse7) (and .cse24 .cse4 .cse5 .cse28 .cse6 .cse43 .cse29 .cse30 .cse18 .cse33 .cse21 .cse42 .cse36))))) [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L75-1(lines 75 80) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-12-07 20:26:48,417 INFO L246 CegarLoopResult]: For program point L159(lines 159 167) no Hoare annotation was computed. [2019-12-07 20:26:48,418 INFO L242 CegarLoopResult]: At program point L11-1(lines 158 206) the Hoare annotation is: (let ((.cse12 (= 0 ~p_dw_st~0))) (let ((.cse9 (= 1 ULTIMATE.start_eval_~tmp___1~0)) (.cse8 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_write_ev~0 2)) (.cse5 (not .cse12)) (.cse13 (= 1 ~q_req_up~0)) (.cse1 (not (= 0 ULTIMATE.start_eval_~tmp___1~0))) (.cse6 (= 1 ~q_free~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~p_dw_pc~0))) (or (and .cse0 (not (= ~q_read_ev~0 0)) .cse1 (not (= ~q_read_ev~0 1)) .cse2 .cse3 (not (= ~q_write_ev~0 1)) (not (= ~q_write_ev~0 0)) .cse4 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 (= ~c_num_read~0 0) .cse10 .cse11 (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse6 .cse7 (= 0 ~p_dw_pc~0) .cse2 (not .cse13) (= 0 ~p_num_write~0)) (and (<= ULTIMATE.start_eval_~tmp~2 2147483647) (= ~c_last_read~0 0) (= ~c_dr_st~0 1) (<= ~c_num_read~0 0) (= 1 ~c_dr_i~0) .cse13 (not (= 0 ULTIMATE.start_eval_~tmp___0~2)) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (<= 0 (+ ~q_buf_0~0 2147483648)) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (<= ULTIMATE.start_eval_~tmp___0~2 2147483647) (= ~c_dr_pc~0 0) (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) .cse10 (<= ~q_buf_0~0 2147483647) (= ~q_ev~0 0) (<= 2 ~q_write_ev~0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 0 ~c_num_read~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (not (= ULTIMATE.start_eval_~tmp~2 0)) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (<= 0 (+ ULTIMATE.start_eval_~tmp___0~2 2147483648)) .cse2 .cse3 .cse9 (<= ULTIMATE.start_activate_threads_~tmp~1 0) (= 0 ~q_free~0) (= 2 ~p_dw_st~0) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (<= ~q_write_ev~0 2) (= 1 ~p_num_write~0) (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)) (= ~a_t~0 0) (= ~p_dw_i~0 1) .cse8) (and .cse4 .cse0 .cse10 .cse11 .cse5 .cse13 .cse1 .cse6 .cse7 .cse2 .cse3)))) [2019-12-07 20:26:48,418 INFO L246 CegarLoopResult]: For program point L358(lines 358 365) no Hoare annotation was computed. [2019-12-07 20:26:48,418 INFO L242 CegarLoopResult]: At program point L409-1(lines 279 431) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 0)) (.cse15 (= 0 ~q_free~0))) (let ((.cse11 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse13 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (not (= ~q_read_ev~0 0))) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_dr_pc~0 1)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse8 (or (not .cse15) (not (= 1 ~q_req_up~0)))) (.cse9 (not (= ~q_write_ev~0 0))) (.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (not .cse17)) (.cse16 (= 0 ~p_dw_st~0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~c_num_read~0 1))) (and (<= .cse14 ~p_num_write~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse11 .cse15 (not .cse16) (<= ~p_num_write~0 .cse14) .cse13)) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (= ~q_read_ev~0 2) (= ~q_ev~0 0) (= 0 ~q_req_up~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= 0 ~q_buf_0~0) .cse16 .cse4 (= 0 ~p_dw_pc~0) .cse5 .cse17 (= 1 ~c_dr_i~0) (= ~c_num_read~0 0) (= ~q_write_ev~0 2) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= 1 ~q_free~0) (= ~c_dr_pc~0 0) (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0))))) [2019-12-07 20:26:48,418 INFO L246 CegarLoopResult]: For program point L343(lines 343 350) no Hoare annotation was computed. [2019-12-07 20:26:48,418 INFO L246 CegarLoopResult]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-12-07 20:26:48,418 INFO L242 CegarLoopResult]: At program point L162(lines 162 166) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (not (= ~q_read_ev~0 0)) (not (= 0 ULTIMATE.start_eval_~tmp___1~0)) (not (= ~q_read_ev~0 1)) (= ~c_dr_pc~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (not (= ~q_write_ev~0 1)) (not (= ~q_write_ev~0 0)) (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= 0 ~q_free~0) (not (= 0 ~p_dw_st~0)) (<= ~p_num_write~0 .cse0) (not (= ~c_dr_st~0 0)) (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0))) [2019-12-07 20:26:48,419 INFO L242 CegarLoopResult]: At program point L129-1(lines 117 152) the Hoare annotation is: (let ((.cse1 (not (= 0 ~p_dw_st~0))) (.cse0 (not (= 0 ULTIMATE.start_eval_~tmp___1~0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (= ~c_num_read~0 0) (= ~q_read_ev~0 2) (= ~q_write_ev~0 2) .cse0 .cse1 .cse2 (= 1 ~q_free~0) (= ~c_dr_st~0 2) .cse3 .cse4 (not (= 1 ~q_req_up~0)) (= 0 ~p_num_write~0)) (let ((.cse5 (+ ~c_num_read~0 1))) (and (not (= ~q_write_ev~0 0)) (<= .cse5 ~p_num_write~0) (not (= ~q_read_ev~0 0)) (= 0 ~q_free~0) .cse1 .cse0 (not (= ~q_read_ev~0 1)) .cse2 (<= ~p_num_write~0 .cse5) (not (= ~c_dr_st~0 0)) .cse4 (not (= ~q_write_ev~0 1)))) (and (let ((.cse6 (<= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (<= 0 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse8 (<= ~a_t~0 0)) (.cse9 (<= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse10 (<= 1 ~p_dw_st~0)) (.cse11 (<= 0 ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse12 (<= 1 ULTIMATE.start_eval_~tmp___1~0)) (.cse13 (<= 1 ~c_dr_i~0)) (.cse14 (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse15 (<= |ULTIMATE.start_is_do_write_p_triggered_#res| 0)) (.cse16 (<= 0 ULTIMATE.start_activate_threads_~tmp___0~1)) (.cse17 (<= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse18 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse19 (<= 0 ~c_dr_st~0)) (.cse20 (<= 0 ~a_t~0)) (.cse21 (<= 2 ~q_read_ev~0)) (.cse22 (<= ~q_ev~0 0)) (.cse23 (<= ~c_dr_pc~0 0)) (.cse24 (<= 0 ~c_dr_pc~0)) (.cse25 (<= ~c_dr_i~0 1)) (.cse26 (<= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse27 (<= 0 ~c_last_read~0)) (.cse28 (<= ~p_dw_i~0 1)) (.cse29 (<= 1 ~p_dw_i~0)) (.cse30 (<= ~c_dr_st~0 0)) (.cse31 (<= 1 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse32 (<= ~c_num_read~0 0)) (.cse33 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse34 (<= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse35 (<= ~q_read_ev~0 2)) (.cse36 (<= 0 ~q_ev~0)) (.cse37 (<= 2 ~q_write_ev~0)) (.cse38 (<= 0 ULTIMATE.start_activate_threads_~tmp~1)) (.cse39 (<= 0 ~c_num_read~0)) (.cse40 (<= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse41 (<= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse42 (<= ~q_write_ev~0 2)) (.cse43 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse44 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse45 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse46 (<= ~p_dw_st~0 1)) (.cse47 (<= ~c_last_read~0 0))) (or (and (<= 1 ~p_num_write~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 0 (+ ~p_last_write~0 2147483648)) (<= ~q_req_up~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= 0 ~q_free~0) .cse34 (<= ~p_num_write~0 1) .cse35 .cse36 .cse37 .cse38 .cse39 (<= ~p_last_write~0 2147483647) .cse40 .cse41 (<= 1 ~q_req_up~0) .cse42 (<= ~q_free~0 0) .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ~q_free~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= ~p_num_write~0 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= ~q_free~0 1) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= 0 ~p_last_write~0) .cse33 (<= 0 ~p_num_write~0) .cse34 .cse35 (<= ~q_req_up~0 0) (<= ~q_buf_0~0 0) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= 0 ~q_req_up~0) .cse45 .cse46 .cse47))) (<= ULTIMATE.start_eval_~tmp~2 2147483647) (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)) (not (= ULTIMATE.start_eval_~tmp~2 0)) .cse3 .cse4))) [2019-12-07 20:26:48,419 INFO L246 CegarLoopResult]: For program point L130(lines 129 147) no Hoare annotation was computed. [2019-12-07 20:26:48,419 INFO L242 CegarLoopResult]: At program point L131(lines 117 152) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (<= ULTIMATE.start_eval_~tmp~2 2147483647) (= ~c_last_read~0 0) (= 1 ~p_dw_st~0) .cse0 (= 1 ~c_dr_i~0) (= ~q_write_ev~0 2) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= 1 ~q_free~0) (= ~c_dr_pc~0 0) (= ULTIMATE.start_activate_threads_~tmp___0~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (= ~q_read_ev~0 2) (= ~q_ev~0 0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|) (= 0 ~q_req_up~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= 0 ~q_buf_0~0) (not (= ULTIMATE.start_eval_~tmp~2 0)) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= 0 ~p_dw_pc~0) .cse1 (= 1 ULTIMATE.start_eval_~tmp___1~0) (= ~c_num_read~0 0) (= ULTIMATE.start_activate_threads_~tmp~1 |ULTIMATE.start_is_do_write_p_triggered_#res|) (<= 0 (+ ULTIMATE.start_eval_~tmp~2 2147483648)) (= ~a_t~0 0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (and (not (= ~q_write_ev~0 0)) (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (not (= ~q_read_ev~0 0)) (not (= 0 ULTIMATE.start_eval_~tmp___1~0)) (not (= 0 ~p_dw_st~0)) (not (= ~q_read_ev~0 1)) (= ~c_dr_pc~0 1) (not .cse0) .cse1 (not (= ~q_write_ev~0 1)) (or (not (= 0 ~q_free~0)) (not (= 1 ~q_req_up~0)))))) [2019-12-07 20:26:48,419 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-12-07 20:26:48,419 INFO L242 CegarLoopResult]: At program point L66(lines 54 68) the Hoare annotation is: (and (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (= ~q_read_ev~0 2) (= ~q_ev~0 0) (= 0 ~q_req_up~0) (= 0 ~p_dw_st~0) (= 0 ~p_dw_pc~0) (= 0 ~p_last_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) (= ~c_num_read~0 0) (= ~q_write_ev~0 2) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= 1 ~q_free~0) (= ~c_dr_pc~0 0) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) [2019-12-07 20:26:48,419 INFO L242 CegarLoopResult]: At program point L66-1(lines 54 68) the Hoare annotation is: (let ((.cse3 (= 0 ~q_free~0))) (let ((.cse5 (not (= ~q_read_ev~0 1))) (.cse8 (<= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse0 (not (= ~q_write_ev~0 0))) (.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (not (= ~q_read_ev~0 0))) (.cse12 (not (= ~c_dr_st~0 0))) (.cse4 (= 0 ~p_dw_st~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= 1 ~p_dw_pc~0)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse14 (or (not .cse3) (not (= 1 ~q_req_up~0))))) (or (let ((.cse1 (+ ~c_num_read~0 1))) (and .cse0 (<= .cse1 ~p_num_write~0) (<= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse2 .cse3 (not .cse4) .cse5 .cse6 (<= ~p_num_write~0 .cse1) .cse7 .cse8 .cse9)) (and .cse0 .cse10 .cse11 .cse2 .cse5 .cse6 .cse12 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse0 .cse10 .cse11 .cse2 .cse12 (or (and .cse6 .cse4 .cse7) (and (<= 1 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) .cse6 .cse7)) .cse9 .cse13 .cse14)))) [2019-12-07 20:26:48,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:26:48 BoogieIcfgContainer [2019-12-07 20:26:48,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:26:48,458 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:26:48,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:26:48,458 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:26:48,459 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:26:12" (3/4) ... [2019-12-07 20:26:48,461 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:26:48,471 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2019-12-07 20:26:48,472 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 20:26:48,472 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 20:26:48,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && tmp == \result) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && 0 == kernel_st) && p_dw_i == 1) && 0 == p_num_write [2019-12-07 20:26:48,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(c_dr_st == 0)) && 0 <= __retres1) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0))) || (((((((((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && __retres1 == \result) && tmp == \result) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && 0 == kernel_st) && p_dw_i == 1) && 0 == p_num_write) [2019-12-07 20:26:48,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && tmp <= 2147483647) && c_dr_st == 0) && c_num_read <= 0) && 1 == c_dr_i) && 1 == q_req_up) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && 1 == kernel_st) && q_read_ev <= 2) && tmp___0 <= 2147483647) && tmp___0 == \result) && tmp___1 == \result) && 0 <= q_ev) && q_buf_0 <= 2147483647) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && 2 <= q_read_ev) && q_ev <= 0) && !(tmp == 0)) && __retres1 == 0) && 0 <= tmp___0 + 2147483648) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && 1 == p_dw_pc) && 1 == tmp___1) && tmp <= 0) && 0 == q_free) && 2 == p_dw_st) && tmp == \result) && q_write_ev <= 2) && 1 == p_num_write) && 0 <= tmp + 2147483648) && a_t == 0) && 0 <= __retres1) && c_last_read <= 0)) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((__retres1 <= 0 && !(q_read_ev == 0)) && ((((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(0 == tmp___1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) || (((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && !(c_dr_st == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))))) && !(q_read_ev == 1)) && 0 <= __retres1)) || (((((((((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && __retres1 == \result) && 0 == p_dw_st) && 0 == p_dw_pc) && __retres1 == 0) && 0 == p_last_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && __retres1 == \result) && tmp == \result) && 1 == kernel_st) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && p_dw_i == 1) && 0 == p_num_write)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && 1 == q_req_up) && !(0 == tmp___1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && 1 == q_free) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0))) || ((((((((((((q_read_ev == 2 && c_dr_pc == 1) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 1 == tmp___1) && c_num_read == 0) && q_write_ev == 2) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && 0 == p_num_write)) || ((((!(q_read_ev == 0) && 0 == q_free) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && (((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) || ((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)))) [2019-12-07 20:26:48,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0)) || (((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(c_dr_st == 0)) && 0 <= __retres1)) || ((((((((((((((((((((((((((((tmp <= 2147483647 && c_dr_st == 0) && 1 == c_dr_i) && q_write_ev == 2) && __retres1 == \result) && 1 == kernel_st) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_ev == 0) && __retres1 == \result) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == tmp___1) && c_num_read == 0) && tmp == \result) && 0 <= tmp + 2147483648) && c_last_read == p_last_write) && a_t == 0) && p_dw_i == 1) && 0 == p_num_write)) || ((((((((((((((((((((((((((((((((((tmp <= 2147483647 && c_last_read == 0) && c_dr_st == 0) && 1 == c_dr_i) && __retres1 == \result) && 1 == q_req_up) && 0 <= q_buf_0 + 2147483648) && 1 == kernel_st) && tmp___0 == \result) && __retres1 == 1) && tmp___1 == \result) && 0 <= q_ev) && q_read_ev == 2) && q_buf_0 <= 2147483647) && 2 <= q_write_ev) && __retres1 == \result) && __retres1 == \result) && q_ev <= 0) && !(tmp == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && 1 == p_dw_pc) && c_num_read == 0) && tmp <= 0) && 0 == q_free) && 2 == p_dw_st) && tmp == \result) && q_write_ev <= 2) && 1 == p_num_write) && 0 <= tmp + 2147483648) && a_t == 0) && p_dw_i == 1) && 0 <= __retres1)) || (((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && 1 == q_req_up) && !(0 == tmp___1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && 1 == q_free) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((q_read_ev == 2 && c_dr_pc == 1) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 1 == tmp___1) && c_num_read == 0) && q_write_ev == 2) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && 0 == p_num_write) [2019-12-07 20:26:48,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((c_num_read == 0 && q_read_ev == 2) && q_write_ev == 2) && !(0 == tmp___1)) && !(0 == p_dw_st)) && c_dr_pc == 1) && 1 == q_free) && c_dr_st == 2) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 0 == p_num_write) || (((((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && !(q_read_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1))) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((1 <= p_num_write && \result <= 1) && 0 <= \result) && a_t <= 0) && tmp___1 <= 1) && 1 <= p_dw_st) && 0 <= __retres1) && 1 <= tmp___1) && 1 <= c_dr_i) && __retres1 <= 0) && \result <= 0) && 0 <= tmp___0) && 0 <= p_last_write + 2147483648) && q_req_up <= 1) && \result <= 0) && kernel_st <= 1) && 0 <= c_dr_st) && 0 <= a_t) && 2 <= q_read_ev) && q_ev <= 0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_dr_i <= 1) && tmp___0 <= 0) && 0 <= c_last_read) && p_dw_i <= 1) && 1 <= p_dw_i) && c_dr_st <= 0) && 1 <= \result) && c_num_read <= 0) && __retres1 <= 1) && 0 <= q_free) && __retres1 <= 0) && p_num_write <= 1) && q_read_ev <= 2) && 0 <= q_ev) && 2 <= q_write_ev) && 0 <= tmp) && 0 <= c_num_read) && p_last_write <= 2147483647) && tmp <= 0) && 0 <= \result) && 1 <= q_req_up) && q_write_ev <= 2) && q_free <= 0) && 1 <= kernel_st) && 1 <= __retres1) && 0 <= __retres1) && p_dw_st <= 1) && c_last_read <= 0) || (((((((((((((((((((((((((((((((((((((((((((((((((\result <= 1 && 0 <= \result) && a_t <= 0) && tmp___1 <= 1) && 1 <= p_dw_st) && 1 <= q_free) && 0 <= __retres1) && 1 <= tmp___1) && 1 <= c_dr_i) && __retres1 <= 0) && \result <= 0) && 0 <= tmp___0) && \result <= 0) && kernel_st <= 1) && p_num_write <= 0) && 0 <= c_dr_st) && 0 <= a_t) && 2 <= q_read_ev) && q_ev <= 0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_dr_i <= 1) && q_free <= 1) && tmp___0 <= 0) && 0 <= c_last_read) && p_dw_i <= 1) && 1 <= p_dw_i) && c_dr_st <= 0) && 1 <= \result) && c_num_read <= 0) && 0 <= p_last_write) && __retres1 <= 1) && 0 <= p_num_write) && __retres1 <= 0) && q_read_ev <= 2) && q_req_up <= 0) && q_buf_0 <= 0) && 0 <= q_ev) && 2 <= q_write_ev) && 0 <= tmp) && 0 <= c_num_read) && tmp <= 0) && 0 <= \result) && q_write_ev <= 2) && 1 <= kernel_st) && 1 <= __retres1) && 0 <= q_req_up) && 0 <= __retres1) && p_dw_st <= 1) && c_last_read <= 0)) && tmp <= 2147483647) && 0 <= tmp + 2147483648) && !(tmp == 0)) && 0 == p_dw_pc) && p_last_write == q_buf_0) [2019-12-07 20:26:48,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((tmp <= 2147483647 && c_last_read == 0) && 1 == p_dw_st) && c_dr_st == 0) && 1 == c_dr_i) && q_write_ev == 2) && __retres1 == \result) && 1 == kernel_st) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_ev == 0) && __retres1 == \result) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && !(tmp == 0)) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == tmp___1) && c_num_read == 0) && tmp == \result) && 0 <= tmp + 2147483648) && a_t == 0) && p_dw_i == 1) && 0 == p_num_write) || (((((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) [2019-12-07 20:26:48,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(0 == p_dw_st)) && 1 == q_free) && !(c_dr_st == 0)) && 0 <= __retres1) || (((((((((((1 == tmp___1 && c_num_read == 0) && q_read_ev == 2) && q_write_ev == 2) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && !(c_dr_st == 0)) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 0 == p_num_write)) || ((((((((((((((((((((((((((((((((((((tmp <= 2147483647 && c_last_read == 0) && c_dr_st == 1) && c_num_read <= 0) && 1 == c_dr_i) && 1 == q_req_up) && !(0 == tmp___0)) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && 1 == kernel_st) && tmp___0 <= 2147483647) && c_dr_pc == 0) && tmp___0 == \result) && tmp___1 == \result) && q_read_ev == 2) && q_buf_0 <= 2147483647) && q_ev == 0) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && !(tmp == 0)) && __retres1 == 0) && 0 <= tmp___0 + 2147483648) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == tmp___1) && tmp <= 0) && 0 == q_free) && 2 == p_dw_st) && tmp == \result) && q_write_ev <= 2) && 1 == p_num_write) && 0 <= tmp + 2147483648) && a_t == 0) && p_dw_i == 1) && 0 <= __retres1)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && !(0 == p_dw_st)) && 1 == q_req_up) && !(0 == tmp___1)) && 1 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) [2019-12-07 20:26:48,525 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cb142cd4-99d9-4574-928f-8045505a482e/bin/utaipan/witness.graphml [2019-12-07 20:26:48,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:26:48,526 INFO L168 Benchmark]: Toolchain (without parser) took 36534.80 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 546.8 MB). Free memory was 942.4 MB in the beginning and 1.5 GB in the end (delta: -528.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:48,527 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:26:48,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:48,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:48,527 INFO L168 Benchmark]: Boogie Preprocessor took 19.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:26:48,527 INFO L168 Benchmark]: RCFGBuilder took 502.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:48,528 INFO L168 Benchmark]: TraceAbstraction took 35689.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.9 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -448.1 MB). Peak memory consumption was 657.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:48,528 INFO L168 Benchmark]: Witness Printer took 67.23 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:26:48,529 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35689.86 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.9 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -448.1 MB). Peak memory consumption was 657.6 MB. Max. memory is 11.5 GB. * Witness Printer took 67.23 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(c_dr_st == 0)) && 0 <= __retres1) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0))) || (((((((((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && __retres1 == \result) && tmp == \result) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && 0 == kernel_st) && p_dw_i == 1) && 0 == p_num_write) - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && tmp <= 2147483647) && c_dr_st == 0) && c_num_read <= 0) && 1 == c_dr_i) && 1 == q_req_up) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && 1 == kernel_st) && q_read_ev <= 2) && tmp___0 <= 2147483647) && tmp___0 == \result) && tmp___1 == \result) && 0 <= q_ev) && q_buf_0 <= 2147483647) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && 2 <= q_read_ev) && q_ev <= 0) && !(tmp == 0)) && __retres1 == 0) && 0 <= tmp___0 + 2147483648) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && 1 == p_dw_pc) && 1 == tmp___1) && tmp <= 0) && 0 == q_free) && 2 == p_dw_st) && tmp == \result) && q_write_ev <= 2) && 1 == p_num_write) && 0 <= tmp + 2147483648) && a_t == 0) && 0 <= __retres1) && c_last_read <= 0)) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((__retres1 <= 0 && !(q_read_ev == 0)) && ((((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(0 == tmp___1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) || (((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && !(c_dr_st == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))))) && !(q_read_ev == 1)) && 0 <= __retres1)) || (((((((((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && __retres1 == \result) && 0 == p_dw_st) && 0 == p_dw_pc) && __retres1 == 0) && 0 == p_last_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && __retres1 == \result) && tmp == \result) && 1 == kernel_st) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && p_dw_i == 1) && 0 == p_num_write)) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && 1 == q_req_up) && !(0 == tmp___1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && 1 == q_free) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0))) || ((((((((((((q_read_ev == 2 && c_dr_pc == 1) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 1 == tmp___1) && c_num_read == 0) && q_write_ev == 2) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && 0 == p_num_write)) || ((((!(q_read_ev == 0) && 0 == q_free) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && (((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && !(0 == tmp___1)) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) || ((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)))) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && __retres1 <= 0) && !(q_read_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 0 <= __retres1) && 1 == p_dw_pc) || (((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(c_dr_st == 0)) && 0 <= __retres1)) || (((((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(q_read_ev == 0)) && c_dr_pc == 1) && 0 == p_dw_st) && !(c_dr_st == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(0 == p_dw_st)) && 1 == q_free) && !(c_dr_st == 0)) && 0 <= __retres1) || (((((((((((1 == tmp___1 && c_num_read == 0) && q_read_ev == 2) && q_write_ev == 2) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && !(c_dr_st == 0)) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 0 == p_num_write)) || ((((((((((((((((((((((((((((((((((((tmp <= 2147483647 && c_last_read == 0) && c_dr_st == 1) && c_num_read <= 0) && 1 == c_dr_i) && 1 == q_req_up) && !(0 == tmp___0)) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && 1 == kernel_st) && tmp___0 <= 2147483647) && c_dr_pc == 0) && tmp___0 == \result) && tmp___1 == \result) && q_read_ev == 2) && q_buf_0 <= 2147483647) && q_ev == 0) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && !(tmp == 0)) && __retres1 == 0) && 0 <= tmp___0 + 2147483648) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == tmp___1) && tmp <= 0) && 0 == q_free) && 2 == p_dw_st) && tmp == \result) && q_write_ev <= 2) && 1 == p_num_write) && 0 <= tmp + 2147483648) && a_t == 0) && p_dw_i == 1) && 0 <= __retres1)) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && !(0 == p_dw_st)) && 1 == q_req_up) && !(0 == tmp___1)) && 1 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && tmp == \result) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && 0 == kernel_st) && p_dw_i == 1) && 0 == p_num_write - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0)) || (((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(c_dr_st == 0)) && 0 <= __retres1)) || ((((((((((((((((((((((((((((tmp <= 2147483647 && c_dr_st == 0) && 1 == c_dr_i) && q_write_ev == 2) && __retres1 == \result) && 1 == kernel_st) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_ev == 0) && __retres1 == \result) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && 0 == p_dw_st) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == tmp___1) && c_num_read == 0) && tmp == \result) && 0 <= tmp + 2147483648) && c_last_read == p_last_write) && a_t == 0) && p_dw_i == 1) && 0 == p_num_write)) || ((((((((((((((((((((((((((((((((((tmp <= 2147483647 && c_last_read == 0) && c_dr_st == 0) && 1 == c_dr_i) && __retres1 == \result) && 1 == q_req_up) && 0 <= q_buf_0 + 2147483648) && 1 == kernel_st) && tmp___0 == \result) && __retres1 == 1) && tmp___1 == \result) && 0 <= q_ev) && q_read_ev == 2) && q_buf_0 <= 2147483647) && 2 <= q_write_ev) && __retres1 == \result) && __retres1 == \result) && q_ev <= 0) && !(tmp == 0)) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && 1 == p_dw_pc) && c_num_read == 0) && tmp <= 0) && 0 == q_free) && 2 == p_dw_st) && tmp == \result) && q_write_ev <= 2) && 1 == p_num_write) && 0 <= tmp + 2147483648) && a_t == 0) && p_dw_i == 1) && 0 <= __retres1)) || (((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && 1 == q_req_up) && !(0 == tmp___1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && 1 == q_free) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((q_read_ev == 2 && c_dr_pc == 1) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 1 == tmp___1) && c_num_read == 0) && q_write_ev == 2) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && 0 == p_num_write) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read == 0 && q_read_ev == 2) && q_write_ev == 2) && !(0 == tmp___1)) && !(0 == p_dw_st)) && c_dr_pc == 1) && 1 == q_free) && c_dr_st == 2) && 0 == p_dw_pc) && p_last_write == q_buf_0) && !(1 == q_req_up)) && 0 == p_num_write) || (((((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && !(q_read_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1))) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((1 <= p_num_write && \result <= 1) && 0 <= \result) && a_t <= 0) && tmp___1 <= 1) && 1 <= p_dw_st) && 0 <= __retres1) && 1 <= tmp___1) && 1 <= c_dr_i) && __retres1 <= 0) && \result <= 0) && 0 <= tmp___0) && 0 <= p_last_write + 2147483648) && q_req_up <= 1) && \result <= 0) && kernel_st <= 1) && 0 <= c_dr_st) && 0 <= a_t) && 2 <= q_read_ev) && q_ev <= 0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_dr_i <= 1) && tmp___0 <= 0) && 0 <= c_last_read) && p_dw_i <= 1) && 1 <= p_dw_i) && c_dr_st <= 0) && 1 <= \result) && c_num_read <= 0) && __retres1 <= 1) && 0 <= q_free) && __retres1 <= 0) && p_num_write <= 1) && q_read_ev <= 2) && 0 <= q_ev) && 2 <= q_write_ev) && 0 <= tmp) && 0 <= c_num_read) && p_last_write <= 2147483647) && tmp <= 0) && 0 <= \result) && 1 <= q_req_up) && q_write_ev <= 2) && q_free <= 0) && 1 <= kernel_st) && 1 <= __retres1) && 0 <= __retres1) && p_dw_st <= 1) && c_last_read <= 0) || (((((((((((((((((((((((((((((((((((((((((((((((((\result <= 1 && 0 <= \result) && a_t <= 0) && tmp___1 <= 1) && 1 <= p_dw_st) && 1 <= q_free) && 0 <= __retres1) && 1 <= tmp___1) && 1 <= c_dr_i) && __retres1 <= 0) && \result <= 0) && 0 <= tmp___0) && \result <= 0) && kernel_st <= 1) && p_num_write <= 0) && 0 <= c_dr_st) && 0 <= a_t) && 2 <= q_read_ev) && q_ev <= 0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_dr_i <= 1) && q_free <= 1) && tmp___0 <= 0) && 0 <= c_last_read) && p_dw_i <= 1) && 1 <= p_dw_i) && c_dr_st <= 0) && 1 <= \result) && c_num_read <= 0) && 0 <= p_last_write) && __retres1 <= 1) && 0 <= p_num_write) && __retres1 <= 0) && q_read_ev <= 2) && q_req_up <= 0) && q_buf_0 <= 0) && 0 <= q_ev) && 2 <= q_write_ev) && 0 <= tmp) && 0 <= c_num_read) && tmp <= 0) && 0 <= \result) && q_write_ev <= 2) && 1 <= kernel_st) && 1 <= __retres1) && 0 <= q_req_up) && 0 <= __retres1) && p_dw_st <= 1) && c_last_read <= 0)) && tmp <= 2147483647) && 0 <= tmp + 2147483648) && !(tmp == 0)) && 0 == p_dw_pc) && p_last_write == q_buf_0) - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 <= 0) && !(0 == p_dw_st)) && !(c_dr_st == 0)) && 0 <= __retres1) || ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_read_ev == 2) && q_write_ev == 2) && !(0 == p_dw_st)) && 1 == q_req_up) && c_dr_pc == 1) && 1 == q_free) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && 0 <= __retres1)) || ((((((((((((p_num_write <= c_num_read && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && 0 == p_dw_st) && __retres1 == 0) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(c_dr_st == 0))) || (((((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && !(q_read_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((!(q_write_ev == 0) && c_num_read + 1 <= p_num_write) && __retres1 <= 0) && !(q_read_ev == 0)) && 0 == q_free) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 0 <= __retres1) && 1 == p_dw_pc) || (((((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(q_read_ev == 0)) && !(q_read_ev == 1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 0 <= __retres1) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up)))) || ((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(q_read_ev == 0)) && !(c_dr_st == 0)) && (((c_dr_pc == 1 && 0 == p_dw_st) && p_last_write == q_buf_0) || ((1 <= __retres1 && c_dr_pc == 1) && p_last_write == q_buf_0))) && 1 == p_dw_pc) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == __retres1 && q_read_ev == 2) && q_ev == 0) && 0 == q_req_up) && 0 == p_dw_st) && 0 == p_dw_pc) && 0 == p_last_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == 2) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && 0 == kernel_st) && p_dw_i == 1) && 0 == p_num_write - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((((c_num_read + 1 <= p_num_write && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(q_read_ev == 1)) && c_dr_pc == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && !(q_write_ev == 1)) && !(q_write_ev == 0)) && __retres1 <= 0) && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0)) && 0 <= __retres1 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((tmp <= 2147483647 && c_last_read == 0) && 1 == p_dw_st) && c_dr_st == 0) && 1 == c_dr_i) && q_write_ev == 2) && __retres1 == \result) && 1 == kernel_st) && 1 == q_free) && c_dr_pc == 0) && tmp___0 == \result) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_ev == 0) && __retres1 == \result) && 0 == q_req_up) && __retres1 == \result) && 0 == q_buf_0) && !(tmp == 0)) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == tmp___1) && c_num_read == 0) && tmp == \result) && 0 <= tmp + 2147483648) && a_t == 0) && p_dw_i == 1) && 0 == p_num_write) || (((((((((((!(q_write_ev == 0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && !(q_read_ev == 0)) && !(0 == tmp___1)) && !(0 == p_dw_st)) && !(q_read_ev == 1)) && c_dr_pc == 1) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && (!(0 == q_free) || !(1 == q_req_up))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 2 error locations. Result: SAFE, OverallTime: 28.7s, OverallIterations: 17, TraceHistogramMax: 4, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, HoareTripleCheckerStatistics: 1105 SDtfs, 2013 SDslu, 1960 SDs, 0 SdLazy, 1353 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1108 GetRequests, 875 SyntacticMatches, 22 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3973 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=16, 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, 17 MinimizatonAttempts, 924 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 95 NumberOfFragments, 2867 HoareAnnotationTreeSize, 14 FomulaSimplifications, 82096 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 49839 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1096 NumberOfCodeBlocks, 1096 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1484 ConstructedInterpolants, 0 QuantifiedInterpolants, 259312 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1995 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 35 InterpolantComputations, 18 PerfectInterpolantSequences, 485/605 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 404, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 25, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 31, TOOLS_POST_TIME[ms]: 32, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 31, TOOLS_QUANTIFIERELIM_TIME[ms]: 24, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 5, FLUID_QUERY_TIME[ms]: 3, FLUID_QUERIES: 61, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 164, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 116, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 5, DOMAIN_ISBOTTOM_APPLICATIONS: 25, DOMAIN_ISBOTTOM_TIME[ms]: 45, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 128, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 128, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 13, DAG_COMPRESSION_PROCESSED_NODES: 381, DAG_COMPRESSION_RETAINED_NODES: 61, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...