./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:20:56,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:56,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:56,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:56,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:56,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:56,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:56,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:56,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:56,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:56,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:56,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:56,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:56,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:56,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:56,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:56,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:56,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:56,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:56,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:56,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:56,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:56,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:56,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:56,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:56,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:56,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:56,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:56,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:56,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:56,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:56,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:56,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:56,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:56,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:56,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:56,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:56,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:56,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:56,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:56,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:56,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:20:56,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:56,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:56,672 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:56,672 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:56,672 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:56,672 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:56,672 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:56,672 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:56,673 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:56,673 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:56,673 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:56,673 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:56,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:56,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:56,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:56,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:56,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:56,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:56,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:56,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:56,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:56,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:56,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:56,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:56,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:56,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:56,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:56,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:56,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:56,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:56,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:56,677 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:56,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:56,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:56,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:56,678 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2019-10-22 11:20:56,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:56,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:56,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:56,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:56,733 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:56,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-10-22 11:20:56,785 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/0d756ec53/9b83f288b868499dbc5f5fc1090abdf0/FLAG170492378 [2019-10-22 11:20:57,160 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:57,161 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-10-22 11:20:57,167 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/0d756ec53/9b83f288b868499dbc5f5fc1090abdf0/FLAG170492378 [2019-10-22 11:20:57,560 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/0d756ec53/9b83f288b868499dbc5f5fc1090abdf0 [2019-10-22 11:20:57,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:57,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:57,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:57,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:57,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f62072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,576 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:57,598 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:57,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,808 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:57,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,928 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:57,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57 WrapperNode [2019-10-22 11:20:57,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:57,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:57,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:57,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:57,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:57,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:57,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:57,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:58,349 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:58,349 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-10-22 11:20:58,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58 BoogieIcfgContainer [2019-10-22 11:20:58,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:58,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:58,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:58,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:58,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:57" (1/3) ... [2019-10-22 11:20:58,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344ff712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (2/3) ... [2019-10-22 11:20:58,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344ff712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58" (3/3) ... [2019-10-22 11:20:58,357 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-22 11:20:58,366 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:58,372 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:20:58,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:20:58,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:58,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:58,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:58,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:58,423 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:58,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:58,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:58,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-22 11:20:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:20:58,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-10-22 11:20:58,495 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737737029] [2019-10-22 11:20:58,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737737029] [2019-10-22 11:20:58,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:58,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747917332] [2019-10-22 11:20:58,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,693 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-10-22 11:20:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:58,800 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-10-22 11:20:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:58,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 11:20:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:58,814 INFO L225 Difference]: With dead ends: 214 [2019-10-22 11:20:58,814 INFO L226 Difference]: Without dead ends: 135 [2019-10-22 11:20:58,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-22 11:20:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-10-22 11:20:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:20:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-10-22 11:20:58,860 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-10-22 11:20:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:58,861 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-10-22 11:20:58,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-10-22 11:20:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:20:58,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:58,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:58,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:58,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-10-22 11:20:58,864 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:58,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955542817] [2019-10-22 11:20:58,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:58,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:58,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955542817] [2019-10-22 11:20:58,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:58,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:58,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029613263] [2019-10-22 11:20:58,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:58,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:58,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:58,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:58,917 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-10-22 11:20:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,003 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-10-22 11:20:59,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:20:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,011 INFO L225 Difference]: With dead ends: 323 [2019-10-22 11:20:59,011 INFO L226 Difference]: Without dead ends: 215 [2019-10-22 11:20:59,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-22 11:20:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-10-22 11:20:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-22 11:20:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-10-22 11:20:59,058 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-10-22 11:20:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,059 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-10-22 11:20:59,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-10-22 11:20:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:20:59,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-10-22 11:20:59,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158145348] [2019-10-22 11:20:59,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158145348] [2019-10-22 11:20:59,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:59,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906244092] [2019-10-22 11:20:59,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,139 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-10-22 11:20:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,179 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-10-22 11:20:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:20:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,183 INFO L225 Difference]: With dead ends: 526 [2019-10-22 11:20:59,183 INFO L226 Difference]: Without dead ends: 321 [2019-10-22 11:20:59,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-22 11:20:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-10-22 11:20:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-22 11:20:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-10-22 11:20:59,229 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-10-22 11:20:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,230 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-10-22 11:20:59,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-10-22 11:20:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:20:59,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,232 INFO L380 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-10-22 11:20:59,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-10-22 11:20:59,233 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054776819] [2019-10-22 11:20:59,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054776819] [2019-10-22 11:20:59,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:59,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21628405] [2019-10-22 11:20:59,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,321 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-10-22 11:20:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,385 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-10-22 11:20:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-22 11:20:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,388 INFO L225 Difference]: With dead ends: 740 [2019-10-22 11:20:59,388 INFO L226 Difference]: Without dead ends: 449 [2019-10-22 11:20:59,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-22 11:20:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-22 11:20:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-22 11:20:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-10-22 11:20:59,416 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-10-22 11:20:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,416 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-10-22 11:20:59,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-10-22 11:20:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 11:20:59,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:20:59,427 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-10-22 11:20:59,427 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337896113] [2019-10-22 11:20:59,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337896113] [2019-10-22 11:20:59,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:59,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300568139] [2019-10-22 11:20:59,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,462 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-10-22 11:20:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,502 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-10-22 11:20:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-22 11:20:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,505 INFO L225 Difference]: With dead ends: 914 [2019-10-22 11:20:59,505 INFO L226 Difference]: Without dead ends: 555 [2019-10-22 11:20:59,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-22 11:20:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-22 11:20:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-22 11:20:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-10-22 11:20:59,531 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-10-22 11:20:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,531 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-10-22 11:20:59,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-10-22 11:20:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:20:59,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,533 INFO L380 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-10-22 11:20:59,533 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-10-22 11:20:59,534 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660563876] [2019-10-22 11:20:59,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:20:59,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660563876] [2019-10-22 11:20:59,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:20:59,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001591161] [2019-10-22 11:20:59,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:20:59,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:20:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,573 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-10-22 11:20:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,609 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-10-22 11:20:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:20:59,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-22 11:20:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,612 INFO L225 Difference]: With dead ends: 970 [2019-10-22 11:20:59,612 INFO L226 Difference]: Without dead ends: 553 [2019-10-22 11:20:59,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:20:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-22 11:20:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-10-22 11:20:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-22 11:20:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-10-22 11:20:59,637 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-10-22 11:20:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,638 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-10-22 11:20:59,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:20:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-10-22 11:20:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:20:59,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,640 INFO L380 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-10-22 11:20:59,640 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-10-22 11:20:59,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513961280] [2019-10-22 11:20:59,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513961280] [2019-10-22 11:20:59,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:20:59,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:20:59,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642365710] [2019-10-22 11:20:59,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:20:59,692 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:20:59,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:20:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:20:59,693 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-10-22 11:20:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:20:59,730 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-10-22 11:20:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:20:59,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 11:20:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:20:59,732 INFO L225 Difference]: With dead ends: 557 [2019-10-22 11:20:59,733 INFO L226 Difference]: Without dead ends: 555 [2019-10-22 11:20:59,733 INFO L600 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-10-22 11:20:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-22 11:20:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-10-22 11:20:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-22 11:20:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-10-22 11:20:59,762 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-10-22 11:20:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:20:59,763 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-10-22 11:20:59,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:20:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-10-22 11:20:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:20:59,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:20:59,764 INFO L380 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-10-22 11:20:59,764 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:20:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:20:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-10-22 11:20:59,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:20:59,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436691534] [2019-10-22 11:20:59,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:20:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:20:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:20:59,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436691534] [2019-10-22 11:20:59,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747809938] [2019-10-22 11:20:59,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:20:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:20:59,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 11:20:59,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:00,046 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:00,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2000539493] [2019-10-22 11:21:00,084 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 55 [2019-10-22 11:21:00,138 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:21:00,141 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:21:00,441 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:00,442 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:21:00,447 INFO L168 Benchmark]: Toolchain (without parser) took 2882.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.5 MB in the beginning and 873.7 MB in the end (delta: 70.8 MB). Peak memory consumption was 212.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,447 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,449 INFO L168 Benchmark]: Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:00,449 INFO L168 Benchmark]: RCFGBuilder took 361.20 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: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,450 INFO L168 Benchmark]: TraceAbstraction took 2093.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 873.7 MB in the end (delta: 223.5 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:00,452 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.72 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 23.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 361.20 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: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2093.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 873.7 MB in the end (delta: 223.5 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:02,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:02,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:02,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:02,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:02,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:02,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:02,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:02,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:02,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:02,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:02,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:02,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:02,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:02,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:02,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:02,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:02,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:02,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:02,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:02,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:02,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:02,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:02,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:02,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:02,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:02,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:02,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:02,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:02,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:02,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:02,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:02,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:02,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:02,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:02,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:02,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:02,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:02,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:02,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:02,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:02,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:02,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:02,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:02,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:02,401 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:02,401 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:02,401 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:02,401 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:02,401 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:02,401 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:02,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:02,402 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:02,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:02,403 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:02,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:02,404 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:02,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:02,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:02,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:02,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:02,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:02,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:02,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:02,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:02,405 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:02,405 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:02,405 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:02,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:02,406 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:02,406 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2019-10-22 11:21:02,432 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:02,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:02,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:02,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:02,455 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:02,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-10-22 11:21:02,501 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/b8657b186/f81558a985a647d7b98938b26023b622/FLAG54454b76f [2019-10-22 11:21:02,913 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:02,913 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-10-22 11:21:02,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/b8657b186/f81558a985a647d7b98938b26023b622/FLAG54454b76f [2019-10-22 11:21:02,948 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/data/b8657b186/f81558a985a647d7b98938b26023b622 [2019-10-22 11:21:02,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:02,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:02,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:02,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:02,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:02,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313b155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:02, skipping insertion in model container [2019-10-22 11:21:02,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:02" (1/1) ... [2019-10-22 11:21:02,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:03,001 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:03,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:03,213 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:03,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:03,270 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:03,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03 WrapperNode [2019-10-22 11:21:03,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:03,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:03,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:03,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:03,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:03,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:03,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:03,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:03,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... [2019-10-22 11:21:03,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:03,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:03,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:03,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:03,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:03,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:03,801 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:03,802 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-10-22 11:21:03,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03 BoogieIcfgContainer [2019-10-22 11:21:03,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:03,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:03,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:03,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:03,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:02" (1/3) ... [2019-10-22 11:21:03,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8f45b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:03, skipping insertion in model container [2019-10-22 11:21:03,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:03" (2/3) ... [2019-10-22 11:21:03,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8f45b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:03, skipping insertion in model container [2019-10-22 11:21:03,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03" (3/3) ... [2019-10-22 11:21:03,811 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-22 11:21:03,827 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:03,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:21:03,854 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:21:03,881 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:03,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:03,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:03,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:03,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:03,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:03,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:03,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-10-22 11:21:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:21:03,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:03,912 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:03,913 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-10-22 11:21:03,927 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:03,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [258658996] [2019-10-22 11:21:03,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,066 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [258658996] [2019-10-22 11:21:04,075 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:04,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40048802] [2019-10-22 11:21:04,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,095 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-10-22 11:21:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,171 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-10-22 11:21:04,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 11:21:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,184 INFO L225 Difference]: With dead ends: 214 [2019-10-22 11:21:04,185 INFO L226 Difference]: Without dead ends: 135 [2019-10-22 11:21:04,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-22 11:21:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-10-22 11:21:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:21:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-10-22 11:21:04,244 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-10-22 11:21:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,245 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-10-22 11:21:04,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-10-22 11:21:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:21:04,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,247 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,450 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,450 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-10-22 11:21:04,451 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:04,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1757343877] [2019-10-22 11:21:04,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,563 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1757343877] [2019-10-22 11:21:04,577 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:04,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380111234] [2019-10-22 11:21:04,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:04,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,580 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-10-22 11:21:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:04,667 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-10-22 11:21:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:04,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:21:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:04,670 INFO L225 Difference]: With dead ends: 323 [2019-10-22 11:21:04,670 INFO L226 Difference]: Without dead ends: 215 [2019-10-22 11:21:04,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-22 11:21:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-10-22 11:21:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-22 11:21:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-10-22 11:21:04,700 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-10-22 11:21:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,701 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-10-22 11:21:04,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-10-22 11:21:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:21:04,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,704 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:04,904 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,905 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-10-22 11:21:04,906 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:04,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2020330717] [2019-10-22 11:21:04,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:04,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:04,996 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:05,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2020330717] [2019-10-22 11:21:05,004 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:05,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120265403] [2019-10-22 11:21:05,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:05,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:05,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:05,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,006 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-10-22 11:21:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,097 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-10-22 11:21:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 11:21:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,100 INFO L225 Difference]: With dead ends: 526 [2019-10-22 11:21:05,100 INFO L226 Difference]: Without dead ends: 321 [2019-10-22 11:21:05,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-22 11:21:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-10-22 11:21:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-22 11:21:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-10-22 11:21:05,166 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-10-22 11:21:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,167 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-10-22 11:21:05,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-10-22 11:21:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:21:05,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,180 INFO L380 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-10-22 11:21:05,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:05,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-10-22 11:21:05,382 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:05,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2082223749] [2019-10-22 11:21:05,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:05,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:21:05,472 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:21:05,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2082223749] [2019-10-22 11:21:05,487 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:05,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199715691] [2019-10-22 11:21:05,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:05,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:05,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:05,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:05,489 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 4 states. [2019-10-22 11:21:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,554 INFO L93 Difference]: Finished difference Result 485 states and 668 transitions. [2019-10-22 11:21:05,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:05,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-10-22 11:21:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,556 INFO L225 Difference]: With dead ends: 485 [2019-10-22 11:21:05,556 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 11:21:05,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 11:21:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2019-10-22 11:21:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-22 11:21:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 406 transitions. [2019-10-22 11:21:05,597 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 406 transitions. Word has length 48 [2019-10-22 11:21:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,598 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 406 transitions. [2019-10-22 11:21:05,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 406 transitions. [2019-10-22 11:21:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-22 11:21:05,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,601 INFO L380 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-10-22 11:21:05,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:05,802 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1376095916, now seen corresponding path program 1 times [2019-10-22 11:21:05,802 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:05,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1161766384] [2019-10-22 11:21:05,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:05,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:21:05,871 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 11:21:05,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1161766384] [2019-10-22 11:21:05,877 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:05,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:05,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722329944] [2019-10-22 11:21:05,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:05,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:05,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:05,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,879 INFO L87 Difference]: Start difference. First operand 297 states and 406 transitions. Second operand 3 states. [2019-10-22 11:21:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,925 INFO L93 Difference]: Finished difference Result 498 states and 678 transitions. [2019-10-22 11:21:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:05,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-22 11:21:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,927 INFO L225 Difference]: With dead ends: 498 [2019-10-22 11:21:05,927 INFO L226 Difference]: Without dead ends: 315 [2019-10-22 11:21:05,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-22 11:21:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-10-22 11:21:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-22 11:21:05,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 385 transitions. [2019-10-22 11:21:05,953 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 385 transitions. Word has length 48 [2019-10-22 11:21:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:05,954 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 385 transitions. [2019-10-22 11:21:05,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 385 transitions. [2019-10-22 11:21:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 11:21:05,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:05,956 INFO L380 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, 1] [2019-10-22 11:21:06,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:06,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash -158527241, now seen corresponding path program 1 times [2019-10-22 11:21:06,157 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:06,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1008451147] [2019-10-22 11:21:06,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:06,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,232 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1008451147] [2019-10-22 11:21:06,247 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:06,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801599432] [2019-10-22 11:21:06,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:06,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:06,254 INFO L87 Difference]: Start difference. First operand 289 states and 385 transitions. Second operand 4 states. [2019-10-22 11:21:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:06,348 INFO L93 Difference]: Finished difference Result 900 states and 1195 transitions. [2019-10-22 11:21:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:06,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-10-22 11:21:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:06,352 INFO L225 Difference]: With dead ends: 900 [2019-10-22 11:21:06,352 INFO L226 Difference]: Without dead ends: 617 [2019-10-22 11:21:06,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-22 11:21:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 445. [2019-10-22 11:21:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-22 11:21:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 576 transitions. [2019-10-22 11:21:06,394 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 576 transitions. Word has length 49 [2019-10-22 11:21:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:06,395 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 576 transitions. [2019-10-22 11:21:06,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 576 transitions. [2019-10-22 11:21:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 11:21:06,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,397 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:06,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:06,598 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-10-22 11:21:06,599 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:06,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [493970893] [2019-10-22 11:21:06,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:06,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,692 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:06,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [493970893] [2019-10-22 11:21:06,697 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:06,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488936273] [2019-10-22 11:21:06,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:06,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:06,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:06,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:06,699 INFO L87 Difference]: Start difference. First operand 445 states and 576 transitions. Second operand 3 states. [2019-10-22 11:21:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:06,755 INFO L93 Difference]: Finished difference Result 906 states and 1166 transitions. [2019-10-22 11:21:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:06,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-22 11:21:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:06,758 INFO L225 Difference]: With dead ends: 906 [2019-10-22 11:21:06,758 INFO L226 Difference]: Without dead ends: 551 [2019-10-22 11:21:06,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-22 11:21:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-22 11:21:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-22 11:21:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 700 transitions. [2019-10-22 11:21:06,800 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 700 transitions. Word has length 52 [2019-10-22 11:21:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:06,801 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 700 transitions. [2019-10-22 11:21:06,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 700 transitions. [2019-10-22 11:21:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:21:06,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,802 INFO L380 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-10-22 11:21:07,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:07,004 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-10-22 11:21:07,004 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:07,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1283237314] [2019-10-22 11:21:07,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:07,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:07,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:21:07,088 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:07,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:21:07,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1283237314] [2019-10-22 11:21:07,100 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:07,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:07,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714936878] [2019-10-22 11:21:07,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:07,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:07,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:07,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:07,101 INFO L87 Difference]: Start difference. First operand 551 states and 700 transitions. Second operand 3 states. [2019-10-22 11:21:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:07,152 INFO L93 Difference]: Finished difference Result 962 states and 1227 transitions. [2019-10-22 11:21:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:07,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-22 11:21:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:07,154 INFO L225 Difference]: With dead ends: 962 [2019-10-22 11:21:07,154 INFO L226 Difference]: Without dead ends: 549 [2019-10-22 11:21:07,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-22 11:21:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 508. [2019-10-22 11:21:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-22 11:21:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 631 transitions. [2019-10-22 11:21:07,195 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 631 transitions. Word has length 53 [2019-10-22 11:21:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:07,195 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 631 transitions. [2019-10-22 11:21:07,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 631 transitions. [2019-10-22 11:21:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:21:07,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:07,197 INFO L380 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-10-22 11:21:07,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:07,398 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:07,398 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-10-22 11:21:07,399 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:07,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1767581345] [2019-10-22 11:21:07,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:07,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:21:07,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:07,479 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:07,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1767581345] [2019-10-22 11:21:07,482 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:07,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-10-22 11:21:07,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717281234] [2019-10-22 11:21:07,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:07,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:07,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:07,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:07,483 INFO L87 Difference]: Start difference. First operand 508 states and 631 transitions. Second operand 5 states. [2019-10-22 11:21:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:07,637 INFO L93 Difference]: Finished difference Result 1405 states and 1743 transitions. [2019-10-22 11:21:07,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:07,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-22 11:21:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:07,649 INFO L225 Difference]: With dead ends: 1405 [2019-10-22 11:21:07,649 INFO L226 Difference]: Without dead ends: 1037 [2019-10-22 11:21:07,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-10-22 11:21:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 532. [2019-10-22 11:21:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-10-22 11:21:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 651 transitions. [2019-10-22 11:21:07,704 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 651 transitions. Word has length 53 [2019-10-22 11:21:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:07,704 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 651 transitions. [2019-10-22 11:21:07,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 651 transitions. [2019-10-22 11:21:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:21:07,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:07,706 INFO L380 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-10-22 11:21:07,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:07,906 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:07,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -45733464, now seen corresponding path program 1 times [2019-10-22 11:21:07,907 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:07,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1364216702] [2019-10-22 11:21:07,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:07,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:21:07,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:07,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:07,997 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364216702] [2019-10-22 11:21:08,001 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-10-22 11:21:08,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208760834] [2019-10-22 11:21:08,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:08,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:08,002 INFO L87 Difference]: Start difference. First operand 532 states and 651 transitions. Second operand 5 states. [2019-10-22 11:21:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,129 INFO L93 Difference]: Finished difference Result 1181 states and 1443 transitions. [2019-10-22 11:21:08,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:08,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-22 11:21:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,133 INFO L225 Difference]: With dead ends: 1181 [2019-10-22 11:21:08,133 INFO L226 Difference]: Without dead ends: 696 [2019-10-22 11:21:08,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:08,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-10-22 11:21:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 427. [2019-10-22 11:21:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-22 11:21:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 510 transitions. [2019-10-22 11:21:08,176 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 510 transitions. Word has length 53 [2019-10-22 11:21:08,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,177 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 510 transitions. [2019-10-22 11:21:08,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 510 transitions. [2019-10-22 11:21:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 11:21:08,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,178 INFO L380 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-10-22 11:21:08,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:08,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -179687388, now seen corresponding path program 1 times [2019-10-22 11:21:08,380 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:08,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [653658111] [2019-10-22 11:21:08,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:21:08,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,471 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [653658111] [2019-10-22 11:21:08,482 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:08,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:21:08,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175818485] [2019-10-22 11:21:08,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:08,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:08,483 INFO L87 Difference]: Start difference. First operand 427 states and 510 transitions. Second operand 4 states. [2019-10-22 11:21:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,541 INFO L93 Difference]: Finished difference Result 471 states and 562 transitions. [2019-10-22 11:21:08,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:08,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 11:21:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,543 INFO L225 Difference]: With dead ends: 471 [2019-10-22 11:21:08,543 INFO L226 Difference]: Without dead ends: 469 [2019-10-22 11:21:08,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 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-10-22 11:21:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-22 11:21:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 425. [2019-10-22 11:21:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-22 11:21:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 507 transitions. [2019-10-22 11:21:08,582 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 507 transitions. Word has length 53 [2019-10-22 11:21:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:08,582 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 507 transitions. [2019-10-22 11:21:08,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 507 transitions. [2019-10-22 11:21:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 11:21:08,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:08,583 INFO L380 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-10-22 11:21:08,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:08,784 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2019-10-22 11:21:08,785 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:08,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [675113780] [2019-10-22 11:21:08,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 11:21:08,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,899 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:08,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [675113780] [2019-10-22 11:21:08,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420137192] [2019-10-22 11:21:08,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:21:08,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:09,023 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:09,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:21:09,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5, 4] total 7 [2019-10-22 11:21:09,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543281852] [2019-10-22 11:21:09,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:21:09,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:21:09,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:09,039 INFO L87 Difference]: Start difference. First operand 425 states and 507 transitions. Second operand 7 states. [2019-10-22 11:21:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,212 INFO L93 Difference]: Finished difference Result 918 states and 1098 transitions. [2019-10-22 11:21:09,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:09,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-10-22 11:21:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,215 INFO L225 Difference]: With dead ends: 918 [2019-10-22 11:21:09,215 INFO L226 Difference]: Without dead ends: 916 [2019-10-22 11:21:09,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2019-10-22 11:21:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 673. [2019-10-22 11:21:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-10-22 11:21:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 806 transitions. [2019-10-22 11:21:09,300 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 806 transitions. Word has length 54 [2019-10-22 11:21:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,300 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 806 transitions. [2019-10-22 11:21:09,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:21:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 806 transitions. [2019-10-22 11:21:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-22 11:21:09,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,302 INFO L380 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-10-22 11:21:09,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:09,703 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:09,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2019-10-22 11:21:09,704 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:09,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2121584675] [2019-10-22 11:21:09,704 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:09,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:21:09,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:21:09,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:09,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:09,807 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:09,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121584675] [2019-10-22 11:21:09,812 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:09,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:21:09,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654375956] [2019-10-22 11:21:09,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:09,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:09,813 INFO L87 Difference]: Start difference. First operand 673 states and 806 transitions. Second operand 3 states. [2019-10-22 11:21:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:09,885 INFO L93 Difference]: Finished difference Result 1101 states and 1322 transitions. [2019-10-22 11:21:09,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:09,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-22 11:21:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:09,888 INFO L225 Difference]: With dead ends: 1101 [2019-10-22 11:21:09,888 INFO L226 Difference]: Without dead ends: 627 [2019-10-22 11:21:09,889 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-22 11:21:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 607. [2019-10-22 11:21:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-22 11:21:09,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 721 transitions. [2019-10-22 11:21:09,941 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 721 transitions. Word has length 69 [2019-10-22 11:21:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,941 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 721 transitions. [2019-10-22 11:21:09,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 721 transitions. [2019-10-22 11:21:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-22 11:21:09,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,943 INFO L380 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, 1] [2019-10-22 11:21:10,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:10,143 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1099928721, now seen corresponding path program 1 times [2019-10-22 11:21:10,144 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:10,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1649848210] [2019-10-22 11:21:10,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:10,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:21:10,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:21:10,231 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 11:21:10,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1649848210] [2019-10-22 11:21:10,244 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:10,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:10,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355169520] [2019-10-22 11:21:10,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:10,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:10,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:10,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:10,246 INFO L87 Difference]: Start difference. First operand 607 states and 721 transitions. Second operand 4 states. [2019-10-22 11:21:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,310 INFO L93 Difference]: Finished difference Result 1056 states and 1247 transitions. [2019-10-22 11:21:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:10,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-10-22 11:21:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,313 INFO L225 Difference]: With dead ends: 1056 [2019-10-22 11:21:10,313 INFO L226 Difference]: Without dead ends: 635 [2019-10-22 11:21:10,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-22 11:21:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 595. [2019-10-22 11:21:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-22 11:21:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 701 transitions. [2019-10-22 11:21:10,367 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 701 transitions. Word has length 81 [2019-10-22 11:21:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:10,367 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 701 transitions. [2019-10-22 11:21:10,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 701 transitions. [2019-10-22 11:21:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 11:21:10,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:10,369 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:10,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:10,570 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1775882856, now seen corresponding path program 1 times [2019-10-22 11:21:10,570 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:10,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1011203760] [2019-10-22 11:21:10,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:10,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:10,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:21:10,653 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:21:10,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1011203760] [2019-10-22 11:21:10,662 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:10,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:21:10,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850661138] [2019-10-22 11:21:10,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:10,662 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:10,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:10,663 INFO L87 Difference]: Start difference. First operand 595 states and 701 transitions. Second operand 4 states. [2019-10-22 11:21:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,720 INFO L93 Difference]: Finished difference Result 840 states and 987 transitions. [2019-10-22 11:21:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:10,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-22 11:21:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,721 INFO L225 Difference]: With dead ends: 840 [2019-10-22 11:21:10,721 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:10,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:10,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2019-10-22 11:21:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:10,723 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:10,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:10,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:10,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:10,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:21:11,132 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-10-22 11:21:12,800 WARN L191 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-22 11:21:13,004 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2019-10-22 11:21:13,396 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-10-22 11:21:13,753 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-10-22 11:21:14,306 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-10-22 11:21:15,022 WARN L191 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:15,217 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-22 11:21:15,921 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:16,675 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:16,867 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-10-22 11:21:17,154 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-10-22 11:21:17,876 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:18,534 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:18,679 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-10-22 11:21:18,976 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-10-22 11:21:19,095 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-10-22 11:21:19,778 WARN L191 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:20,470 WARN L191 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:20,689 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-22 11:21:21,325 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:22,007 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:22,655 WARN L191 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-10-22 11:21:22,671 INFO L443 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-10-22 11:21:22,672 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-10-22 11:21:22,672 INFO L443 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-10-22 11:21:22,672 INFO L439 ceAbstractionStarter]: At program point L300(lines 284 302) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse16 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse16 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse18 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and (and .cse5 .cse7 .cse16 .cse9) .cse11) (and .cse17 .cse18 (and (and .cse7 .cse16 .cse9) .cse19) .cse20) (and (and (and (and (and .cse4 .cse7 .cse16 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse17 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse18 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,672 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:21:22,672 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-10-22 11:21:22,672 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-10-22 11:21:22,673 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L439 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse20 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse10 (= (_ bv0 32) ~c_dr_pc~0)) (.cse17 (bvadd ~p_num_write~0 (_ bv4294967295 32)))) (let ((.cse1 (= .cse17 (_ bv0 32))) (.cse0 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse18 (and .cse4 .cse20 .cse10)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse19 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse21 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= (_ bv0 32) ~c_num_read~0)) (.cse22 (= ~p_num_write~0 (_ bv0 32))) (.cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse16 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= ~q_buf_0~0 ~p_last_write~0)) (.cse12 (= ~q_free~0 (_ bv0 32))) (.cse15 (= (_ bv1 32) ~c_dr_pc~0)) (.cse6 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse13 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse6 (or (and .cse1 .cse9 .cse2 .cse4 .cse5 .cse7 .cse11 .cse8 .cse12 .cse15) (and (and .cse16 .cse4 .cse15) .cse8 (= .cse17 ~c_num_read~0) .cse12)) .cse13) (and .cse0 .cse9 .cse18 .cse2 .cse3 .cse7 .cse11 .cse14) (and .cse0 .cse3 (and .cse18 .cse16) .cse14) (and (and .cse19 .cse4 .cse20 .cse10) .cse11) (and .cse19 .cse21 .cse4 .cse5 .cse6 .cse10 .cse22 .cse11 .cse8 .cse13) (and (= (_ bv2 32) ~c_dr_st~0) .cse19 .cse21 .cse4 .cse5 .cse6 .cse22 .cse11 .cse8 .cse13 .cse15) (and (let ((.cse23 (and .cse4 .cse20 .cse15))) (or (and (and (and .cse23 .cse9 .cse2 .cse3 .cse7 .cse11) .cse8) .cse12) (and (and (and (and .cse23 .cse16) .cse3) .cse8) .cse12))) .cse6 .cse13)))) [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-10-22 11:21:22,674 INFO L439 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse9 (= (_ bv2 32) ~q_write_ev~0)) (.cse11 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse10 (= (_ bv0 32) ~c_dr_pc~0))) (let ((.cse1 (and .cse9 .cse11 .cse10)) (.cse3 (and .cse9 .cse11 (= (_ bv1 32) ~c_dr_pc~0))) (.cse0 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (= (_ bv0 32) ~c_num_read~0)) (.cse6 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse7 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~q_buf_0~0 ~p_last_write~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0))) (or (and (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1) (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32)) (and .cse0 .cse1) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (and .cse1 .cse2) (and (and (and .cse3 .cse2) .cse4) .cse5 .cse6 .cse7 .cse8) (and .cse6 (and (and .cse4 (and .cse3 .cse0)) (= ~p_num_write~0 ~c_num_read~0)) .cse8) (and .cse9 .cse5 .cse6 .cse10 .cse7 .cse2 .cse4 .cse8)))) [2019-10-22 11:21:22,675 INFO L439 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse12 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse13 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse7 (= (_ bv0 32) ~c_dr_pc~0))) (let ((.cse2 (and .cse13 .cse7)) (.cse6 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse10 (= (_ bv2 32) ~q_read_ev~0)) (.cse1 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= .cse12 (_ bv0 32))) (.cse5 (= (_ bv0 32) ~c_num_read~0)) (.cse3 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse8 (= ~q_buf_0~0 ~p_last_write~0)) (.cse9 (= ~q_free~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2) (and (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1) .cse3 .cse2 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (and .cse4 .cse0 .cse5 .cse6 .cse7 .cse1 .cse8 .cse9 .cse10) (and .cse6 .cse10 (let ((.cse11 (and .cse13 (= (_ bv1 32) ~c_dr_pc~0)))) (or (and (and .cse0 .cse11 .cse1) .cse4 .cse5 .cse8 .cse9) (and (and .cse3 .cse0 .cse11) .cse8 (= .cse12 ~c_num_read~0) .cse9))))))) [2019-10-22 11:21:22,675 INFO L439 ceAbstractionStarter]: At program point L43-1(lines 31 45) the Hoare annotation is: (let ((.cse1 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse6 (= ~q_buf_0~0 ~p_last_write~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_num_write~0 ~c_num_read~0) (= (_ bv1 32) ~c_dr_pc~0))) (and (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1) (= (bvadd ~p_num_write~0 (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 (= (_ bv0 32) ~c_dr_pc~0) .cse6 (= (bvadd ~c_num_read~0 (_ bv4294967295 32)) (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))))) [2019-10-22 11:21:22,675 INFO L439 ceAbstractionStarter]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse1 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_write_ev~0))) (let ((.cse5 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32))) (.cse9 (and (= ~p_dw_st~0 (_ bv0 32)) .cse1 .cse3)) (.cse2 (= ~p_last_write~0 ~c_last_read~0)) (.cse13 (= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse12 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse11 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse4 (= (_ bv0 32) ~c_num_read~0)) (.cse7 (= ~q_buf_0~0 ~p_last_write~0)) (.cse8 (= (_ bv2 32) ~q_read_ev~0)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse10 .cse2 .cse11 .cse7 (and .cse12 .cse9) .cse13 .cse14) .cse8) (and .cse0 (and .cse10 .cse2 .cse11 .cse7 .cse13 (and (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse12 .cse1 .cse3) .cse14) .cse8) (and .cse10 (= (bvadd ~p_num_write~0 (_ bv4294967295 32)) (_ bv0 32)) .cse12 .cse0 .cse11 .cse3 (not (= (_ bv0 32) ~c_dr_st~0)) .cse4 .cse7 (= (_ bv0 32) ~c_dr_pc~0) (= ~q_free~0 (_ bv0 32)) .cse8 .cse14)))) [2019-10-22 11:21:22,675 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-10-22 11:21:22,675 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-10-22 11:21:22,675 INFO L439 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (and (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) ~q_write_ev~0) (not (= (_ bv0 32) ~c_dr_st~0)) (= ~q_buf_0~0 ~p_last_write~0) (= (bvadd ~p_num_write~0 (_ bv4294967295 32)) ~c_num_read~0) (= ~q_free~0 (_ bv0 32)) (= (_ bv2 32) ~q_read_ev~0) (= (_ bv1 32) ~c_dr_pc~0)) [2019-10-22 11:21:22,675 INFO L439 ceAbstractionStarter]: At program point L44(lines 28 46) the Hoare annotation is: (let ((.cse14 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse6 (= (_ bv0 32) ~c_dr_pc~0)) (.cse13 (bvadd ~p_num_write~0 (_ bv4294967295 32)))) (let ((.cse0 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= .cse13 (_ bv0 32))) (.cse4 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= ~q_buf_0~0 ~p_last_write~0)) (.cse10 (= ~q_free~0 (_ bv0 32))) (.cse5 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse11 (= (_ bv2 32) ~q_read_ev~0)) (.cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse8 (= ~p_dw_pc~0 (_ bv0 32))) (.cse1 (and .cse14 .cse6))) (or (and (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1) .cse0 .cse1 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (let ((.cse12 (and .cse14 (= (_ bv1 32) ~c_dr_pc~0)))) (or (and (and .cse0 .cse3 .cse12 .cse7) .cse9 (= .cse13 ~c_num_read~0) .cse10) (and .cse2 (and .cse3 .cse12 .cse7 .cse8) .cse4 .cse9 .cse10))) .cse5 .cse11) (and .cse3 .cse7 .cse8 .cse1)))) [2019-10-22 11:21:22,675 INFO L439 ceAbstractionStarter]: At program point L44-1(lines 28 46) the Hoare annotation is: (let ((.cse1 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse5 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse6 (= ~q_buf_0~0 ~p_last_write~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_num_write~0 ~c_num_read~0) (= (_ bv1 32) ~c_dr_pc~0))) (and (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1) (= (bvadd ~p_num_write~0 (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 (= (_ bv0 32) ~c_dr_pc~0) .cse6 (= (bvadd ~c_num_read~0 (_ bv4294967295 32)) (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))))) [2019-10-22 11:21:22,676 INFO L446 ceAbstractionStarter]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-10-22 11:21:22,676 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-10-22 11:21:22,676 INFO L439 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse16 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse16 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse18 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and (and .cse5 .cse7 .cse16 .cse9) .cse11) (and .cse17 .cse18 (and (and .cse7 .cse16 .cse9) .cse19) .cse20) (and (and (and (and (and .cse4 .cse7 .cse16 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse17 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse18 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,676 INFO L439 ceAbstractionStarter]: At program point L226-1(lines 213 228) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse18 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse18 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse17 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and .cse16 .cse17 (and (and .cse7 .cse18 .cse9) .cse19) .cse20) (and (and .cse5 .cse7 .cse18 .cse9) .cse11) (and (and (and (and (and .cse4 .cse7 .cse18 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse16 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse17 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,676 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:21:22,677 INFO L446 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-10-22 11:21:22,677 INFO L439 ceAbstractionStarter]: At program point L227(lines 210 229) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse18 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse18 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse17 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and .cse16 .cse17 (and (and .cse7 .cse18 .cse9) .cse19) .cse20) (and (and .cse5 .cse7 .cse18 .cse9) .cse11) (and (and (and (and (and .cse4 .cse7 .cse18 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse16 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse17 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,677 INFO L439 ceAbstractionStarter]: At program point L227-1(lines 210 229) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse16 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse16 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse18 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and (and .cse5 .cse7 .cse16 .cse9) .cse11) (and .cse17 .cse18 (and (and .cse7 .cse16 .cse9) .cse19) .cse20) (and (and (and (and (and .cse4 .cse7 .cse16 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse17 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse18 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,677 INFO L439 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse17 (not (= (_ bv0 32) ~c_dr_st~0)))) (let ((.cse1 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse13 (and .cse17 (= (_ bv1 32) ~c_dr_pc~0))) (.cse10 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse16 (= (_ bv0 32) ~c_dr_pc~0))) (let ((.cse2 (and .cse17 .cse16)) (.cse12 (= .cse10 (_ bv0 32))) (.cse14 (= (_ bv0 32) ~c_num_read~0)) (.cse8 (and .cse1 .cse13)) (.cse0 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse3 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse5 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32))) (.cse9 (= ~q_buf_0~0 ~p_last_write~0)) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse7 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse15 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2)) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse2) (and .cse7 (or (and .cse8 .cse9 (= .cse10 ~c_num_read~0) .cse11) (and .cse12 .cse3 .cse4 .cse13 .cse14 .cse5 .cse6 .cse9 .cse11)) .cse15) (and .cse0 .cse12 .cse3 .cse4 .cse14 .cse7 .cse16 .cse5 .cse6 .cse9 .cse11 .cse15) (and (or (and (and .cse0 .cse8 .cse9) .cse11) (and (and .cse0 .cse3 .cse4 .cse13 .cse5 .cse6 .cse9) .cse11)) .cse7 .cse15))))) [2019-10-22 11:21:22,678 INFO L439 ceAbstractionStarter]: At program point L62-1(lines 50 64) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse1 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse6 (= ~q_buf_0~0 ~p_last_write~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 (= ~p_dw_st~0 (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32)) (and .cse0 .cse3 (and (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse1 .cse2 .cse5 .cse4) .cse6 .cse7)))) [2019-10-22 11:21:22,678 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-10-22 11:21:22,679 INFO L439 ceAbstractionStarter]: At program point L63(lines 47 65) the Hoare annotation is: (let ((.cse18 (not (= (_ bv0 32) ~c_dr_st~0)))) (let ((.cse14 (= (_ bv0 32) ~c_dr_pc~0)) (.cse15 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse16 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (and .cse18 (= (_ bv1 32) ~c_dr_pc~0)))) (let ((.cse0 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse10 (and .cse16 .cse4)) (.cse12 (= .cse15 (_ bv0 32))) (.cse13 (= (_ bv0 32) ~c_num_read~0)) (.cse7 (= ~q_buf_0~0 ~p_last_write~0)) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse11 (= (_ bv2 32) ~q_read_ev~0)) (.cse1 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse2 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse5 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32))) (.cse17 (and .cse18 .cse14)) (.cse8 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)))) (or (and .cse0 (or (and (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (and (and .cse1 .cse10 .cse7 .cse8) .cse9)) .cse11) (and .cse1 .cse12 .cse3 .cse13 .cse0 .cse5 .cse7 .cse2 .cse14 .cse6 .cse9 .cse11 .cse8) (and .cse0 (or (and .cse10 .cse7 (= .cse15 ~c_num_read~0) .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse9)) .cse11) (and .cse1 (and .cse16 .cse17) .cse8) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse17 .cse8))))) [2019-10-22 11:21:22,679 INFO L439 ceAbstractionStarter]: At program point L63-1(lines 47 65) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse1 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse4 (= (_ bv2 32) ~q_write_ev~0)) (.cse6 (= ~q_buf_0~0 ~p_last_write~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 (= ~p_dw_st~0 (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32)) (and .cse0 .cse3 (and (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse1 .cse2 .cse5 .cse4) .cse6 .cse7 .cse8)))) [2019-10-22 11:21:22,679 INFO L439 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse18 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse18 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse17 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and .cse16 .cse17 (and (and .cse7 .cse18 .cse9) .cse19) .cse20) (and (and .cse5 .cse7 .cse18 .cse9) .cse11) (and (and (and (and (and .cse4 .cse7 .cse18 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse16 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse17 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,680 INFO L439 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse18 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse18 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse17 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and .cse16 .cse17 (and (and .cse7 .cse18 .cse9) .cse19) .cse20) (and (and .cse5 .cse7 .cse18 .cse9) .cse11) (and (and (and (and (and .cse4 .cse7 .cse18 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse16 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse17 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L443 ceAbstractionStarter]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-10-22 11:21:22,680 INFO L439 ceAbstractionStarter]: At program point L346(lines 332 348) the Hoare annotation is: (and (= ~p_dw_st~0 (_ bv0 32)) (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= (_ bv2 32) ~q_write_ev~0) (= (_ bv0 32) ~c_num_read~0) (= (_ bv0 32) ~c_dr_pc~0) (= ~p_num_write~0 (_ bv0 32)) (= ~p_dw_pc~0 (_ bv0 32)) (= ~q_buf_0~0 ~p_last_write~0) (= (_ bv2 32) ~q_read_ev~0)) [2019-10-22 11:21:22,681 INFO L439 ceAbstractionStarter]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse16 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse16 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse18 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and (and .cse5 .cse7 .cse16 .cse9) .cse11) (and .cse17 .cse18 (and (and .cse7 .cse16 .cse9) .cse19) .cse20) (and (and (and (and (and .cse4 .cse7 .cse16 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse17 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse18 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,681 INFO L439 ceAbstractionStarter]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse18 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse18 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse17 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and .cse16 .cse17 (and (and .cse7 .cse18 .cse9) .cse19) .cse20) (and (and .cse5 .cse7 .cse18 .cse9) .cse11) (and (and (and (and (and .cse4 .cse7 .cse18 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse16 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse17 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,681 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-10-22 11:21:22,681 INFO L443 ceAbstractionStarter]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-10-22 11:21:22,681 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-10-22 11:21:22,681 INFO L439 ceAbstractionStarter]: At program point L82-2(lines 66 90) the Hoare annotation is: (let ((.cse15 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse11 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse19 (= (_ bv0 32) ~c_dr_pc~0))) (let ((.cse12 (= (_ bv1 32) ~c_dr_pc~0)) (.cse10 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse17 (and .cse11 .cse19)) (.cse16 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse13 (= .cse15 (_ bv0 32))) (.cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse14 (= (_ bv0 32) ~c_num_read~0)) (.cse0 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse6 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse8 (= ~q_buf_0~0 ~p_last_write~0)) (.cse2 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse9 (= ~q_free~0 (_ bv0 32))) (.cse1 (= (_ bv2 32) ~q_read_ev~0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 (let ((.cse5 (and .cse11 .cse12))) (or (and (and (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8) .cse9) (and (and (and .cse4 (and .cse10 .cse5)) .cse8) .cse9)))) (and (or (and .cse13 .cse2 .cse3 .cse14 .cse6 .cse7 .cse8 .cse9 .cse12) (and (and .cse10 .cse12) .cse8 (= .cse15 ~c_num_read~0) .cse9)) .cse0 .cse1) (and .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse18) (and .cse16 (and .cse10 .cse17) .cse4 .cse18) (and .cse16 .cse13 .cse3 .cse4 .cse14 .cse0 .cse6 .cse8 .cse2 .cse19 .cse7 .cse9 .cse1 .cse18)))) [2019-10-22 11:21:22,682 INFO L443 ceAbstractionStarter]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-10-22 11:21:22,682 INFO L439 ceAbstractionStarter]: At program point L82-5(lines 66 90) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse1 (= ~p_last_write~0 ~c_last_read~0)) (.cse2 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse3 (= ~q_buf_0~0 ~p_last_write~0)) (.cse7 (= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv2 32) ~q_write_ev~0)) (.cse8 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 (and (= ~p_dw_st~0 (_ bv0 32)) .cse5 .cse6)) .cse7 .cse8) (and (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32)) (and .cse0 .cse1 .cse2 .cse3 .cse7 (and (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse4 .cse5 .cse6) .cse8)))) [2019-10-22 11:21:22,682 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-10-22 11:21:22,682 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-10-22 11:21:22,682 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-10-22 11:21:22,682 INFO L443 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2019-10-22 11:21:22,683 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-10-22 11:21:22,683 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-10-22 11:21:22,683 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-10-22 11:21:22,683 INFO L443 ceAbstractionStarter]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-10-22 11:21:22,683 INFO L443 ceAbstractionStarter]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-10-22 11:21:22,683 INFO L439 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: (let ((.cse7 (= (_ bv2 32) ~q_write_ev~0)) (.cse16 (not (= (_ bv0 32) ~c_dr_st~0))) (.cse14 (= (_ bv1 32) ~c_dr_pc~0)) (.cse19 (= (bvadd ~p_dw_pc~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= ~q_buf_0~0 ~p_last_write~0))) (let ((.cse13 (= (_ bv2 32) ~c_dr_st~0)) (.cse6 (= ~p_last_write~0 ~c_last_read~0)) (.cse10 (= ~p_num_write~0 (_ bv0 32))) (.cse2 (and (and (and .cse7 .cse16 .cse14) .cse19) .cse12)) (.cse5 (= (bvadd ~q_free~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse1 (= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= (_ bv0 32) ULTIMATE.start_is_do_read_c_triggered_~__retres1~1)) (.cse18 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (.cse8 (= (_ bv0 32) ~c_num_read~0)) (.cse9 (= (_ bv0 32) ~c_dr_pc~0)) (.cse20 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse21 (bvadd ~p_num_write~0 (_ bv4294967295 32))) (.cse0 (= (bvadd ~p_dw_st~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse15 (= ~q_free~0 (_ bv0 32))) (.cse3 (= (_ bv2 32) ~q_read_ev~0))) (or (and .cse0 (and .cse1 .cse2) .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3) (and .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse13 .cse0 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3 .cse14) (and .cse0 .cse2 .cse15 .cse3) (and (and .cse5 .cse7 .cse16 .cse9) .cse11) (and .cse17 .cse18 (and (and .cse7 .cse16 .cse9) .cse19) .cse20) (and (and (and (and (and .cse4 .cse7 .cse16 .cse14) .cse19) .cse12) .cse1) .cse3) (and .cse17 (= .cse21 (_ bv0 32)) .cse19 .cse0 .cse18 .cse7 .cse8 .cse9 .cse12 .cse15 .cse3 .cse20) (and (and (and .cse19 .cse7 .cse14) .cse12 (= .cse21 ~c_num_read~0)) .cse0 .cse15 .cse3)))) [2019-10-22 11:21:22,683 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-10-22 11:21:22,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:22 BoogieIcfgContainer [2019-10-22 11:21:22,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:22,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:22,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:22,766 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:22,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:03" (3/4) ... [2019-10-22 11:21:22,772 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:22,787 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-10-22 11:21:22,787 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:22,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,818 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,819 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_buf_0 == p_last_write) && tmp == 0bv32) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32) || ((!(p_dw_st == 0bv32) && ((((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 1bv32 == c_dr_pc) || (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32))) && 2bv32 == q_read_ev)) || (((((((0bv32 == __retres1 && tmp == 0bv32) && (2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && __retres1 == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && \result == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && tmp == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) || ((((((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0bv32 == __retres1 && tmp___0 == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && (2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && \result == 0bv32) || (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || ((((((((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && 2bv32 == q_read_ev)) || ((!(p_dw_st == 0bv32) && (q_buf_0 == p_last_write && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((2bv32 == q_write_ev && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,820 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || ((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && p_last_write == c_last_read) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && (p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && p_num_write == c_num_read) && \result == 0bv32) && 2bv32 == q_read_ev)) || ((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && ((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && \result == 0bv32) && 2bv32 == q_read_ev)) || ((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_num_read) && q_buf_0 == p_last_write) && 0bv32 == c_dr_pc) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((__retres1 == 0bv32 && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) || (((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32)) || ((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((!(p_dw_st == 0bv32) && 2bv32 == q_read_ev) && (((((((__retres1 == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && p_dw_pc == 0bv32) && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && 0bv32 == c_num_read) && q_buf_0 == p_last_write) && q_free == 0bv32) || (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32))) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32) || (((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) || ((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && ((__retres1 == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && 0bv32 == c_num_read) && q_buf_0 == p_last_write) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev)) || (((__retres1 == 0bv32 && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 1bv32 == c_dr_pc) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(c_num_read, 4294967295bv32) == 0bv32) && \result == 0bv32) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 1bv32 == c_dr_pc) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(c_num_read, 4294967295bv32) == 0bv32) && \result == 0bv32) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) || (((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc)) || ((!(p_dw_st == 0bv32) && (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) || ((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32))) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) || (((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(p_dw_st == 0bv32) && (((((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && \result == 0bv32) && q_free == 0bv32) || ((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && \result == 0bv32) && q_free == 0bv32))) && 2bv32 == q_read_ev) || ((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_buf_0 == p_last_write) && tmp == 0bv32) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || ((!(p_dw_st == 0bv32) && (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) || ((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32))) && 2bv32 == q_read_ev)) || ((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32)) || ((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32) [2019-10-22 11:21:22,821 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && \result == 0bv32) || (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ((((0bv32 == __retres1 && p_last_write == c_last_read) && (((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st)) && 2bv32 == q_write_ev) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && \result == 0bv32) [2019-10-22 11:21:22,822 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(p_dw_st == 0bv32) && 2bv32 == q_read_ev) && ((((((((tmp == 0bv32 && __retres1 == 0bv32) && tmp___0 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) || (((tmp___0 == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32))) || (((((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 1bv32 == c_dr_pc) || ((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev)) || (((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32)) || (((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && tmp___0 == 0bv32) && \result == 0bv32)) || (((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_buf_0 == p_last_write) && tmp == 0bv32) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32) [2019-10-22 11:21:22,824 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && (p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && p_num_write == c_num_read) && \result == 0bv32) || (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && ((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && \result == 0bv32) [2019-10-22 11:21:22,865 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bfd1d108-3adb-4d4e-980d-3fced5e2aabf/bin/utaipan/witness.graphml [2019-10-22 11:21:22,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:22,869 INFO L168 Benchmark]: Toolchain (without parser) took 19915.50 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.7 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -48.0 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,869 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:22,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.62 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 936.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 936.2 MB in the beginning and 1.2 GB in the end (delta: -229.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,870 INFO L168 Benchmark]: Boogie Preprocessor took 28.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,870 INFO L168 Benchmark]: RCFGBuilder took 405.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,870 INFO L168 Benchmark]: TraceAbstraction took 18961.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.4 MB). Peak memory consumption was 450.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,871 INFO L168 Benchmark]: Witness Printer took 101.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:22,872 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.62 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 936.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 936.2 MB in the beginning and 1.2 GB in the end (delta: -229.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 405.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18961.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.4 MB). Peak memory consumption was 450.7 MB. Max. memory is 11.5 GB. * Witness Printer took 101.82 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 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: (((((!(p_dw_st == 0bv32) && 2bv32 == q_read_ev) && ((((((((tmp == 0bv32 && __retres1 == 0bv32) && tmp___0 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) || (((tmp___0 == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32))) || (((((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 1bv32 == c_dr_pc) || ((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev)) || (((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32)) || (((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && tmp___0 == 0bv32) && \result == 0bv32)) || (((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_buf_0 == p_last_write) && tmp == 0bv32) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) || (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((0bv32 == __retres1 && p_last_write == c_last_read) && (((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st)) && 2bv32 == q_write_ev) && q_buf_0 == p_last_write) && p_num_write == c_num_read) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) || (((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc)) || ((!(p_dw_st == 0bv32) && (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) || ((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32))) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && tmp == 0bv32) && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) || (((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((!(p_dw_st == 0bv32) && (((((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && \result == 0bv32) && q_free == 0bv32) || ((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && \result == 0bv32) && q_free == 0bv32))) && 2bv32 == q_read_ev) || ((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_buf_0 == p_last_write) && tmp == 0bv32) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || ((!(p_dw_st == 0bv32) && (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) || ((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32))) && 2bv32 == q_read_ev)) || ((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32)) || ((((((0bv32 == __retres1 && tmp == 0bv32) && __retres1 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_buf_0 == p_last_write) && tmp == 0bv32) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32) || ((!(p_dw_st == 0bv32) && ((((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && tmp == 0bv32) && __retres1 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 1bv32 == c_dr_pc) || (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32))) && 2bv32 == q_read_ev)) || (((((((0bv32 == __retres1 && tmp == 0bv32) && (2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && __retres1 == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && \result == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && tmp == 0bv32) && __retres1 == 0bv32) && tmp___0 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) || ((((((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 1bv32 == c_dr_pc) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(c_num_read, 4294967295bv32) == 0bv32) && \result == 0bv32) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((__retres1 == 0bv32 && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) || (((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32)) || ((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((!(p_dw_st == 0bv32) && 2bv32 == q_read_ev) && (((((((__retres1 == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && p_dw_pc == 0bv32) && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && 0bv32 == c_num_read) && q_buf_0 == p_last_write) && q_free == 0bv32) || (((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32))) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((0bv32 == __retres1 && tmp___0 == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && (2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && \result == 0bv32) || (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || ((((((((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && 2bv32 == q_read_ev)) || ((!(p_dw_st == 0bv32) && (q_buf_0 == p_last_write && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((2bv32 == q_write_ev && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: ((((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && (p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && p_num_write == c_num_read) && \result == 0bv32) || (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && ((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && \result == 0bv32) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && \result == 0bv32) || (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ((((0bv32 == __retres1 && p_last_write == c_last_read) && (((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st)) && 2bv32 == q_write_ev) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && \result == 0bv32) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || ((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && p_last_write == c_last_read) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && (p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && p_num_write == c_num_read) && \result == 0bv32) && 2bv32 == q_read_ev)) || ((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((((0bv32 == __retres1 && p_last_write == c_last_read) && tmp___0 == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && ((tmp == 0bv32 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && 2bv32 == q_write_ev) && \result == 0bv32) && 2bv32 == q_read_ev)) || ((((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_num_read) && q_buf_0 == p_last_write) && 0bv32 == c_dr_pc) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 1bv32 == c_dr_pc) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(c_num_read, 4294967295bv32) == 0bv32) && \result == 0bv32) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((0bv32 == __retres1 && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) && \result == 0bv32) || (((((((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && 0bv32 == c_num_read) && !(p_dw_st == 0bv32)) && 0bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && __retres1 == 0bv32) && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && q_free == 0bv32) || ((((~bvadd64(p_num_write, 4294967295bv32) == 0bv32 && ((__retres1 == 0bv32 && !(0bv32 == c_dr_st) && 1bv32 == c_dr_pc) && \result == 0bv32) && p_dw_pc == 0bv32) && 0bv32 == c_num_read) && q_buf_0 == p_last_write) && q_free == 0bv32)) && !(p_dw_st == 0bv32)) && 2bv32 == q_read_ev)) || (((__retres1 == 0bv32 && \result == 0bv32) && p_dw_pc == 0bv32) && !(0bv32 == c_dr_st) && 0bv32 == c_dr_pc) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && p_num_write == c_num_read && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) || (((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || (((((((((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev)) || ((((((((((2bv32 == c_dr_st && p_dw_st == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || ((((((((((2bv32 == c_dr_st && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev) && 1bv32 == c_dr_pc)) || (((~bvadd64(p_dw_st, 4294967294bv32) == 0bv32 && (((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev)) || (((0bv32 == __retres1 && tmp___0 == 0bv32) && ((2bv32 == q_write_ev && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && \result == 0bv32)) || ((((~bvadd64(q_free, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 0bv32 == c_dr_pc) && p_dw_pc == 0bv32)) || (((((((p_dw_st == 0bv32 && 2bv32 == q_write_ev) && !(0bv32 == c_dr_st)) && 1bv32 == c_dr_pc) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && q_buf_0 == p_last_write) && p_num_write == c_num_read) && 2bv32 == q_read_ev)) || (((((((((((0bv32 == __retres1 && ~bvadd64(p_num_write, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && tmp___0 == 0bv32) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && q_buf_0 == p_last_write) && q_free == 0bv32) && 2bv32 == q_read_ev) && \result == 0bv32)) || (((((((~bvadd64(p_dw_pc, 4294967295bv32) == 0bv32 && 2bv32 == q_write_ev) && 1bv32 == c_dr_pc) && q_buf_0 == p_last_write) && ~bvadd64(p_num_write, 4294967295bv32) == c_num_read) && ~bvadd64(p_dw_st, 4294967294bv32) == 0bv32) && q_free == 0bv32) && 2bv32 == q_read_ev) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((p_dw_st == 0bv32 && ~bvadd64(q_free, 4294967295bv32) == 0bv32) && p_last_write == c_last_read) && 2bv32 == q_write_ev) && 0bv32 == c_num_read) && 0bv32 == c_dr_pc) && p_num_write == 0bv32) && p_dw_pc == 0bv32) && q_buf_0 == p_last_write) && 2bv32 == q_read_ev - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Result: SAFE, OverallTime: 18.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.7s, HoareTripleCheckerStatistics: 1893 SDtfs, 1667 SDslu, 2256 SDs, 0 SdLazy, 205 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1683 GetRequests, 1650 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1414 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 222 NumberOfFragments, 5759 HoareAnnotationTreeSize, 27 FomulaSimplifications, 36031 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 54732 FormulaSimplificationTreeSizeReductionInter, 10.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 853 NumberOfCodeBlocks, 853 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1674 ConstructedInterpolants, 0 QuantifiedInterpolants, 213193 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 32 InterpolantComputations, 28 PerfectInterpolantSequences, 238/246 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...