./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.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_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:01:36,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:01:36,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:01:36,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:01:36,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:01:36,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:01:36,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:01:36,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:01:36,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:01:36,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:01:36,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:01:36,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:01:36,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:01:36,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:01:36,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:01:36,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:01:36,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:01:36,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:01:36,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:01:36,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:01:36,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:01:36,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:01:36,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:01:36,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:01:36,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:01:36,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:01:36,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:01:36,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:01:36,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:01:36,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:01:36,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:01:36,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:01:36,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:01:36,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:01:36,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:01:36,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:01:36,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:01:36,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:01:36,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:01:36,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:01:36,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:01:36,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:01:36,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:01:36,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:01:36,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:01:36,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:01:36,740 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:01:36,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:01:36,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:01:36,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:01:36,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:01:36,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:01:36,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:01:36,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:01:36,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:01:36,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:01:36,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:01:36,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:01:36,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:01:36,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:01:36,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:01:36,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:01:36,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:01:36,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:01:36,744 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:01:36,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer 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 -> Automizer 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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2019-12-07 19:01:36,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:01:36,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:01:36,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:01:36,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:01:36,853 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:01:36,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-12-07 19:01:36,892 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/data/6d9a91a6c/752d8b96cb1c475cb2fa54ac19ed3d05/FLAG0b47f564d [2019-12-07 19:01:37,216 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:01:37,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-12-07 19:01:37,222 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/data/6d9a91a6c/752d8b96cb1c475cb2fa54ac19ed3d05/FLAG0b47f564d [2019-12-07 19:01:37,655 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/data/6d9a91a6c/752d8b96cb1c475cb2fa54ac19ed3d05 [2019-12-07 19:01:37,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:01:37,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:01:37,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:37,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:01:37,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:01:37,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e0a5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37, skipping insertion in model container [2019-12-07 19:01:37,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:01:37,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:01:37,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:37,840 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:01:37,868 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:37,879 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:01:37,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37 WrapperNode [2019-12-07 19:01:37,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:37,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:01:37,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:01:37,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:01:37,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:01:37,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:01:37,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:01:37,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:01:37,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... [2019-12-07 19:01:37,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:01:37,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:01:37,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:01:37,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:01:37,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:01:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:01:37,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:01:38,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:01:38,202 INFO L287 CfgBuilder]: Removed 42 assume(true) statements. [2019-12-07 19:01:38,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:38 BoogieIcfgContainer [2019-12-07 19:01:38,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:01:38,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:01:38,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:01:38,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:01:38,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:01:37" (1/3) ... [2019-12-07 19:01:38,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61904249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:38, skipping insertion in model container [2019-12-07 19:01:38,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:37" (2/3) ... [2019-12-07 19:01:38,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61904249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:38, skipping insertion in model container [2019-12-07 19:01:38,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:38" (3/3) ... [2019-12-07 19:01:38,207 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-12-07 19:01:38,213 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:01:38,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:01:38,225 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 19:01:38,240 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:01:38,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:01:38,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:01:38,241 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:01:38,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:01:38,241 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:01:38,241 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:01:38,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:01:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 19:01:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 19:01:38,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,257 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-12-07 19:01:38,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673380235] [2019-12-07 19:01:38,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:38,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673380235] [2019-12-07 19:01:38,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:38,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285899202] [2019-12-07 19:01:38,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:38,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,387 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-12-07 19:01:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,435 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-12-07 19:01:38,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:38,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 19:01:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,445 INFO L225 Difference]: With dead ends: 214 [2019-12-07 19:01:38,445 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 19:01:38,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 19:01:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-12-07 19:01:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-07 19:01:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-12-07 19:01:38,479 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-12-07 19:01:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,479 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-12-07 19:01:38,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-12-07 19:01:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 19:01:38,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,481 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-12-07 19:01:38,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551891310] [2019-12-07 19:01:38,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:38,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551891310] [2019-12-07 19:01:38,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:38,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073935564] [2019-12-07 19:01:38,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:38,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,518 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-12-07 19:01:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,548 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-12-07 19:01:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:38,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 19:01:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,550 INFO L225 Difference]: With dead ends: 323 [2019-12-07 19:01:38,550 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 19:01:38,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 19:01:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-12-07 19:01:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 19:01:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-12-07 19:01:38,567 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-12-07 19:01:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,568 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-12-07 19:01:38,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-12-07 19:01:38,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 19:01:38,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,570 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,570 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-12-07 19:01:38,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847828083] [2019-12-07 19:01:38,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:38,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847828083] [2019-12-07 19:01:38,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:38,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106286347] [2019-12-07 19:01:38,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:38,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,602 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-12-07 19:01:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,629 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-12-07 19:01:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:38,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 19:01:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,631 INFO L225 Difference]: With dead ends: 526 [2019-12-07 19:01:38,631 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 19:01:38,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 19:01:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-12-07 19:01:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 19:01:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-12-07 19:01:38,650 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-12-07 19:01:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,650 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-12-07 19:01:38,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-12-07 19:01:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:38,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,653 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,653 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-12-07 19:01:38,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865267076] [2019-12-07 19:01:38,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,685 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 19:01:38,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865267076] [2019-12-07 19:01:38,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:38,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661158149] [2019-12-07 19:01:38,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:38,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,687 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-12-07 19:01:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,716 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-12-07 19:01:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:38,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 19:01:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,718 INFO L225 Difference]: With dead ends: 740 [2019-12-07 19:01:38,719 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 19:01:38,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 19:01:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-12-07 19:01:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 19:01:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-12-07 19:01:38,737 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-12-07 19:01:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,738 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-12-07 19:01:38,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-12-07 19:01:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 19:01:38,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,740 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-12-07 19:01:38,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293218475] [2019-12-07 19:01:38,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:38,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293218475] [2019-12-07 19:01:38,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:38,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113603162] [2019-12-07 19:01:38,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:38,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,766 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-12-07 19:01:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,795 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-12-07 19:01:38,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:38,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 19:01:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,798 INFO L225 Difference]: With dead ends: 914 [2019-12-07 19:01:38,798 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 19:01:38,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 19:01:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 19:01:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 19:01:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-12-07 19:01:38,814 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-12-07 19:01:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,814 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-12-07 19:01:38,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-12-07 19:01:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:01:38,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-12-07 19:01:38,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028701209] [2019-12-07 19:01:38,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:01:38,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028701209] [2019-12-07 19:01:38,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:38,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095459332] [2019-12-07 19:01:38,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:38,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:38,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,847 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-12-07 19:01:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,873 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-12-07 19:01:38,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:38,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 19:01:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,876 INFO L225 Difference]: With dead ends: 970 [2019-12-07 19:01:38,876 INFO L226 Difference]: Without dead ends: 553 [2019-12-07 19:01:38,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-12-07 19:01:38,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-12-07 19:01:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-07 19:01:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-12-07 19:01:38,891 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-12-07 19:01:38,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,891 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-12-07 19:01:38,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-12-07 19:01:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 19:01:38,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,893 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-12-07 19:01:38,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640796815] [2019-12-07 19:01:38,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:38,927 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 19:01:38,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640796815] [2019-12-07 19:01:38,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:38,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:01:38,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724543114] [2019-12-07 19:01:38,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:38,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:38,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:38,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:38,929 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-12-07 19:01:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:38,955 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-12-07 19:01:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:38,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 19:01:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:38,958 INFO L225 Difference]: With dead ends: 557 [2019-12-07 19:01:38,958 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 19:01:38,958 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 19:01:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 19:01:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-12-07 19:01:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-12-07 19:01:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-12-07 19:01:38,977 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-12-07 19:01:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:38,978 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-12-07 19:01:38,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-12-07 19:01:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 19:01:38,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:38,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:38,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-12-07 19:01:38,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:38,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257467209] [2019-12-07 19:01:38,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:39,039 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 19:01:39,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257467209] [2019-12-07 19:01:39,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918120124] [2019-12-07 19:01:39,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:39,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 19:01:39,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:39,129 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 19:01:39,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 19:01:39,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-12-07 19:01:39,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018847110] [2019-12-07 19:01:39,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:01:39,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:39,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:01:39,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:01:39,131 INFO L87 Difference]: Start difference. First operand 510 states and 646 transitions. Second operand 7 states. [2019-12-07 19:01:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:39,191 INFO L93 Difference]: Finished difference Result 1064 states and 1348 transitions. [2019-12-07 19:01:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:01:39,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 19:01:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:39,196 INFO L225 Difference]: With dead ends: 1064 [2019-12-07 19:01:39,196 INFO L226 Difference]: Without dead ends: 1062 [2019-12-07 19:01:39,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:01:39,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-12-07 19:01:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 761. [2019-12-07 19:01:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-07 19:01:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 971 transitions. [2019-12-07 19:01:39,236 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 971 transitions. Word has length 54 [2019-12-07 19:01:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:39,236 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 971 transitions. [2019-12-07 19:01:39,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:01:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 971 transitions. [2019-12-07 19:01:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 19:01:39,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:39,238 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:39,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:01:39,438 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash -797889608, now seen corresponding path program 2 times [2019-12-07 19:01:39,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:39,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130384212] [2019-12-07 19:01:39,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:39,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130384212] [2019-12-07 19:01:39,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:39,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:39,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759830131] [2019-12-07 19:01:39,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:39,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:39,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:39,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,470 INFO L87 Difference]: Start difference. First operand 761 states and 971 transitions. Second operand 3 states. [2019-12-07 19:01:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:39,502 INFO L93 Difference]: Finished difference Result 1240 states and 1589 transitions. [2019-12-07 19:01:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:39,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 19:01:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:39,506 INFO L225 Difference]: With dead ends: 1240 [2019-12-07 19:01:39,506 INFO L226 Difference]: Without dead ends: 705 [2019-12-07 19:01:39,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-07 19:01:39,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 685. [2019-12-07 19:01:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 19:01:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 860 transitions. [2019-12-07 19:01:39,529 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 860 transitions. Word has length 69 [2019-12-07 19:01:39,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:39,529 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 860 transitions. [2019-12-07 19:01:39,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:39,529 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 860 transitions. [2019-12-07 19:01:39,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 19:01:39,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:39,531 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:39,531 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:39,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash -5008021, now seen corresponding path program 1 times [2019-12-07 19:01:39,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:39,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816589773] [2019-12-07 19:01:39,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:39,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816589773] [2019-12-07 19:01:39,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:39,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:39,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532658100] [2019-12-07 19:01:39,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:39,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,554 INFO L87 Difference]: Start difference. First operand 685 states and 860 transitions. Second operand 3 states. [2019-12-07 19:01:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:39,591 INFO L93 Difference]: Finished difference Result 1271 states and 1598 transitions. [2019-12-07 19:01:39,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:39,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-07 19:01:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:39,594 INFO L225 Difference]: With dead ends: 1271 [2019-12-07 19:01:39,594 INFO L226 Difference]: Without dead ends: 703 [2019-12-07 19:01:39,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-12-07 19:01:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2019-12-07 19:01:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 19:01:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 840 transitions. [2019-12-07 19:01:39,616 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 840 transitions. Word has length 80 [2019-12-07 19:01:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:39,616 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 840 transitions. [2019-12-07 19:01:39,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 840 transitions. [2019-12-07 19:01:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 19:01:39,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:39,618 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:39,618 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash 184036267, now seen corresponding path program 1 times [2019-12-07 19:01:39,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:39,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890188505] [2019-12-07 19:01:39,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-07 19:01:39,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890188505] [2019-12-07 19:01:39,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:39,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:39,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273949070] [2019-12-07 19:01:39,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:39,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:39,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:39,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,635 INFO L87 Difference]: Start difference. First operand 685 states and 840 transitions. Second operand 3 states. [2019-12-07 19:01:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:39,653 INFO L93 Difference]: Finished difference Result 1147 states and 1413 transitions. [2019-12-07 19:01:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:39,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-07 19:01:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:39,655 INFO L225 Difference]: With dead ends: 1147 [2019-12-07 19:01:39,655 INFO L226 Difference]: Without dead ends: 574 [2019-12-07 19:01:39,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-12-07 19:01:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-12-07 19:01:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-07 19:01:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 706 transitions. [2019-12-07 19:01:39,674 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 706 transitions. Word has length 80 [2019-12-07 19:01:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:39,674 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 706 transitions. [2019-12-07 19:01:39,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 706 transitions. [2019-12-07 19:01:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 19:01:39,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:39,676 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:39,676 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1014536047, now seen corresponding path program 1 times [2019-12-07 19:01:39,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:39,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512463455] [2019-12-07 19:01:39,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 19:01:39,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512463455] [2019-12-07 19:01:39,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:39,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:39,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690090260] [2019-12-07 19:01:39,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:39,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:39,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,699 INFO L87 Difference]: Start difference. First operand 574 states and 706 transitions. Second operand 3 states. [2019-12-07 19:01:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:39,725 INFO L93 Difference]: Finished difference Result 812 states and 995 transitions. [2019-12-07 19:01:39,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:39,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 19:01:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:39,726 INFO L225 Difference]: With dead ends: 812 [2019-12-07 19:01:39,726 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:01:39,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:01:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:01:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:01:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:01:39,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-12-07 19:01:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:39,728 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:01:39,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:01:39,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:01:39,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:01:40,463 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:40,740 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:40,982 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:41,337 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:41,554 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:41,757 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-12-07 19:01:41,971 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:42,175 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:42,435 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:42,849 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:43,336 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-12-07 19:01:43,348 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-12-07 19:01:43,348 INFO L246 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-12-07 19:01:43,348 INFO L246 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-12-07 19:01:43,348 INFO L246 CegarLoopResult]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L242 CegarLoopResult]: At program point L300(lines 284 302) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L238(line 238) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-12-07 19:01:43,349 INFO L246 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L242 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= 1 ~q_free~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse0 (= ~c_num_read~0 0)) (.cse5 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse8 (<= 2 ~c_dr_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and (or (and .cse0 .cse9 (= 1 ~p_num_write~0) .cse3 .cse4) (let ((.cse10 (+ ~c_num_read~0 1))) (and (<= .cse10 ~p_num_write~0) .cse9 (<= ~p_num_write~0 .cse10) .cse4 .cse11))) .cse5 .cse6) (and (or (and .cse9 .cse8 .cse3 .cse4) (and .cse9 .cse8 .cse4 .cse11)) .cse6))) [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L246 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-12-07 19:01:43,350 INFO L242 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse2 (= 0 ~p_dw_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse3 (= 1 ~p_dw_pc~0) .cse4) (and .cse0 (= ~c_dr_pc~0 0) .cse2 .cse3 (= ~c_dr_st~0 0) .cse4 .cse5))) [2019-12-07 19:01:43,350 INFO L242 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-12-07 19:01:43,350 INFO L242 CegarLoopResult]: At program point L43-1(lines 31 45) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0)) [2019-12-07 19:01:43,350 INFO L242 CegarLoopResult]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_num_read~0 0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 .cse3 .cse10 .cse5 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse10 .cse5 .cse7 .cse11) (let ((.cse12 (+ ~c_num_read~0 1))) (and (<= .cse12 ~p_num_write~0) (= 0 ~q_free~0) .cse9 (<= ~p_num_write~0 .cse12) .cse5 .cse6 .cse7)))) [2019-12-07 19:01:43,351 INFO L246 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-12-07 19:01:43,351 INFO L246 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-12-07 19:01:43,351 INFO L242 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (= 0 ~q_free~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0))) [2019-12-07 19:01:43,351 INFO L242 CegarLoopResult]: At program point L44(lines 28 46) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-12-07 19:01:43,351 INFO L242 CegarLoopResult]: At program point L44-1(lines 28 46) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0)) [2019-12-07 19:01:43,351 INFO L249 CegarLoopResult]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-12-07 19:01:43,351 INFO L246 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-12-07 19:01:43,351 INFO L242 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,351 INFO L242 CegarLoopResult]: At program point L226-1(lines 213 228) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,351 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 19:01:43,351 INFO L249 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L227(lines 210 229) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L227-1(lines 210 229) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L62-1(lines 50 64) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-12-07 19:01:43,352 INFO L246 CegarLoopResult]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L63(lines 47 65) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L63-1(lines 47 65) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-12-07 19:01:43,352 INFO L242 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,353 INFO L242 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L242 CegarLoopResult]: At program point L346(lines 332 348) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_dr_i~0 1) (= 0 ~p_num_write~0)) [2019-12-07 19:01:43,353 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-12-07 19:01:43,353 INFO L242 CegarLoopResult]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,353 INFO L242 CegarLoopResult]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L242 CegarLoopResult]: At program point L82-2(lines 66 90) the Hoare annotation is: (let ((.cse1 (= 0 ~p_dw_pc~0)) (.cse0 (= 0 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse5 (= 1 ~c_dr_i~0))) (or (and (or (and (= ~c_num_read~0 0) .cse0 (= 1 ~p_num_write~0) .cse1 .cse2) (let ((.cse3 (+ ~c_num_read~0 1))) (and (<= .cse3 ~p_num_write~0) .cse0 (<= ~p_num_write~0 .cse3) .cse2 .cse4))) (= ~c_dr_st~0 0) .cse5) (and (let ((.cse6 (<= 2 ~c_dr_st~0))) (or (and .cse0 .cse6 .cse1 .cse2) (and .cse0 .cse6 .cse2 .cse4))) .cse5))) [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L242 CegarLoopResult]: At program point L82-5(lines 66 90) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L246 CegarLoopResult]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-12-07 19:01:43,354 INFO L242 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-12-07 19:01:43,355 INFO L246 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-12-07 19:01:43,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:01:43 BoogieIcfgContainer [2019-12-07 19:01:43,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:01:43,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:01:43,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:01:43,395 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:01:43,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:38" (3/4) ... [2019-12-07 19:01:43,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:01:43,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 19:01:43,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:01:43,468 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f173c08-6872-44da-ac80-46af2851126c/bin/uautomizer/witness.graphml [2019-12-07 19:01:43,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:01:43,470 INFO L168 Benchmark]: Toolchain (without parser) took 5811.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -221.4 MB). Peak memory consumption was 375.4 kB. Max. memory is 11.5 GB. [2019-12-07 19:01:43,470 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:01:43,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:43,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.36 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 19:01:43,470 INFO L168 Benchmark]: Boogie Preprocessor took 18.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:43,471 INFO L168 Benchmark]: RCFGBuilder took 275.11 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:43,471 INFO L168 Benchmark]: TraceAbstraction took 5190.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.1 MB). Peak memory consumption was 292.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:43,471 INFO L168 Benchmark]: Witness Printer took 74.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:43,472 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 275.11 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5190.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -84.1 MB). Peak memory consumption was 292.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.27 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: 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: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_dr_st == 0) && 1 == c_dr_i) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 1 == c_dr_i) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write) || (((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_dr_st == 0) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 1 == c_dr_i) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((c_num_read == 0 && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || ((((((c_num_read == 0 && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, HoareTripleCheckerStatistics: 1443 SDtfs, 1095 SDslu, 1141 SDs, 0 SdLazy, 117 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=761occurred in iteration=8, 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, 12 MinimizatonAttempts, 474 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 157 NumberOfFragments, 3057 HoareAnnotationTreeSize, 27 FomulaSimplifications, 3145 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 27 FomulaSimplificationsInter, 2018 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 92635 SizeOfPredicates, 2 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 119/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...