./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/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 bb52621d262b2a79ebd79f9601fb8103d2f4f11e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:33:27,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:33:27,046 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:33:27,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:33:27,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:33:27,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:33:27,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:33:27,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:33:27,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:33:27,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:33:27,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:33:27,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:33:27,059 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:33:27,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:33:27,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:33:27,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:33:27,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:33:27,062 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:33:27,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:33:27,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:33:27,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:33:27,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:33:27,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:33:27,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:33:27,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:33:27,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:33:27,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:33:27,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:33:27,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:33:27,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:33:27,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:33:27,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:33:27,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:33:27,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:33:27,073 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:33:27,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:33:27,073 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:33:27,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:33:27,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:33:27,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:33:27,084 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:33:27,084 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:33:27,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:33:27,084 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:33:27,084 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:33:27,085 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:33:27,085 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:33:27,085 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:33:27,085 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:33:27,085 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:33:27,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:33:27,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:33:27,086 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:33:27,086 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:33:27,086 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:33:27,086 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:33:27,086 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:33:27,087 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:33:27,087 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:33:27,087 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:33:27,087 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:33:27,087 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:33:27,087 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:33:27,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:33:27,088 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:33:27,088 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:33:27,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:33:27,088 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:33:27,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:33:27,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:33:27,089 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:33:27,089 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:33:27,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:33:27,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:33:27,089 INFO L133 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_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2018-11-23 06:33:27,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:33:27,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:33:27,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:33:27,123 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:33:27,123 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:33:27,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-11-23 06:33:27,158 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/data/5816b2ca3/9f8b34649ac441408b3f92bc2b62855d/FLAG64f9d3c49 [2018-11-23 06:33:27,561 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:33:27,562 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-11-23 06:33:27,568 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/data/5816b2ca3/9f8b34649ac441408b3f92bc2b62855d/FLAG64f9d3c49 [2018-11-23 06:33:27,577 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/data/5816b2ca3/9f8b34649ac441408b3f92bc2b62855d [2018-11-23 06:33:27,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:33:27,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:33:27,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:33:27,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:33:27,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:33:27,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651809fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27, skipping insertion in model container [2018-11-23 06:33:27,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:33:27,614 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:33:27,730 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:33:27,733 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:33:27,755 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:33:27,765 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:33:27,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27 WrapperNode [2018-11-23 06:33:27,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:33:27,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:33:27,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:33:27,766 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:33:27,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:33:27,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:33:27,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:33:27,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:33:27,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... [2018-11-23 06:33:27,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:33:27,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:33:27,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:33:27,846 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:33:27,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/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 [2018-11-23 06:33:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-23 06:33:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-23 06:33:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-23 06:33:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-23 06:33:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2018-11-23 06:33:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:33:27,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:33:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-23 06:33:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-23 06:33:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-23 06:33:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2018-11-23 06:33:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2018-11-23 06:33:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:33:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:33:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-23 06:33:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-23 06:33:28,225 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:33:28,225 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 06:33:28,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:28 BoogieIcfgContainer [2018-11-23 06:33:28,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:33:28,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:33:28,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:33:28,229 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:33:28,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:33:27" (1/3) ... [2018-11-23 06:33:28,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cf93c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:33:28, skipping insertion in model container [2018-11-23 06:33:28,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:33:27" (2/3) ... [2018-11-23 06:33:28,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cf93c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:33:28, skipping insertion in model container [2018-11-23 06:33:28,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:28" (3/3) ... [2018-11-23 06:33:28,232 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-11-23 06:33:28,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:33:28,246 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:33:28,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:33:28,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:33:28,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:33:28,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:33:28,287 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:33:28,287 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:33:28,287 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:33:28,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:33:28,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:33:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-11-23 06:33:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 06:33:28,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:28,310 INFO L402 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, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:28,312 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:28,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1449059025, now seen corresponding path program 1 times [2018-11-23 06:33:28,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:28,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:28,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:33:28,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:33:28,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:33:28,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:28,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 06:33:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:33:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:33:28,527 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-11-23 06:33:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:28,668 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-11-23 06:33:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:33:28,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-23 06:33:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:28,681 INFO L225 Difference]: With dead ends: 265 [2018-11-23 06:33:28,681 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 06:33:28,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:33:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 06:33:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-11-23 06:33:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 06:33:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2018-11-23 06:33:28,720 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 58 [2018-11-23 06:33:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:28,721 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2018-11-23 06:33:28,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 06:33:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2018-11-23 06:33:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 06:33:28,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:28,724 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:28,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:28,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1447129993, now seen corresponding path program 1 times [2018-11-23 06:33:28,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:28,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:28,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:28,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:33:28,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:28,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:28,852 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2018-11-23 06:33:28,853 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [273], [277], [283], [287], [293], [300], [307], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [399], [400], [401] [2018-11-23 06:33:28,880 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:28,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:28,995 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:28,996 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Performed 307 root evaluator evaluations with a maximum evaluation depth of 1. Performed 307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 1. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:29,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:29,000 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:29,090 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 86.41% of their original sizes. [2018-11-23 06:33:29,090 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:29,112 INFO L415 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2018-11-23 06:33:29,112 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:29,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:29,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-23 06:33:29,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:29,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:33:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:33:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:33:29,115 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 3 states. [2018-11-23 06:33:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:29,318 INFO L93 Difference]: Finished difference Result 259 states and 352 transitions. [2018-11-23 06:33:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:33:29,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-23 06:33:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:29,320 INFO L225 Difference]: With dead ends: 259 [2018-11-23 06:33:29,320 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 06:33:29,321 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:33:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 06:33:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-11-23 06:33:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 06:33:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2018-11-23 06:33:29,332 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 125 [2018-11-23 06:33:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:29,333 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2018-11-23 06:33:29,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:33:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2018-11-23 06:33:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 06:33:29,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:29,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:29,335 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:29,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:29,335 INFO L82 PathProgramCache]: Analyzing trace with hash -145736468, now seen corresponding path program 1 times [2018-11-23 06:33:29,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:29,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:29,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:29,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:29,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:33:29,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:29,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:29,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-11-23 06:33:29,466 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [273], [277], [283], [287], [290], [293], [300], [307], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [399], [400], [401] [2018-11-23 06:33:29,469 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:29,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:29,507 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:29,507 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 362 root evaluator evaluations with a maximum evaluation depth of 3. Performed 362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:29,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:29,517 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:29,575 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 81.22% of their original sizes. [2018-11-23 06:33:29,575 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:29,600 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-11-23 06:33:29,600 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:29,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:29,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-23 06:33:29,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:29,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 06:33:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 06:33:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:33:29,602 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 6 states. [2018-11-23 06:33:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:30,085 INFO L93 Difference]: Finished difference Result 265 states and 360 transitions. [2018-11-23 06:33:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:33:30,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-23 06:33:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:30,087 INFO L225 Difference]: With dead ends: 265 [2018-11-23 06:33:30,088 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 06:33:30,088 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 06:33:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 06:33:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-11-23 06:33:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-23 06:33:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2018-11-23 06:33:30,100 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 186 transitions. Word has length 130 [2018-11-23 06:33:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:30,101 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 186 transitions. [2018-11-23 06:33:30,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 06:33:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2018-11-23 06:33:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 06:33:30,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:30,103 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:30,103 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:30,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1691889557, now seen corresponding path program 1 times [2018-11-23 06:33:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:30,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:30,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:33:30,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:30,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:30,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2018-11-23 06:33:30,199 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [273], [277], [283], [287], [290], [293], [297], [300], [307], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [399], [400], [401] [2018-11-23 06:33:30,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:30,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:30,221 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:30,221 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Performed 417 root evaluator evaluations with a maximum evaluation depth of 3. Performed 417 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:30,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:30,222 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:30,260 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 78.06% of their original sizes. [2018-11-23 06:33:30,260 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:30,303 INFO L415 sIntCurrentIteration]: We unified 134 AI predicates to 134 [2018-11-23 06:33:30,303 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:30,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2018-11-23 06:33:30,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:30,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 06:33:30,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 06:33:30,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:33:30,304 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand 9 states. [2018-11-23 06:33:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:30,833 INFO L93 Difference]: Finished difference Result 271 states and 366 transitions. [2018-11-23 06:33:30,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 06:33:30,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-23 06:33:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:30,835 INFO L225 Difference]: With dead ends: 271 [2018-11-23 06:33:30,835 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 06:33:30,835 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 06:33:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 06:33:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-11-23 06:33:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 06:33:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 192 transitions. [2018-11-23 06:33:30,846 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 192 transitions. Word has length 135 [2018-11-23 06:33:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:30,846 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 192 transitions. [2018-11-23 06:33:30,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 06:33:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 192 transitions. [2018-11-23 06:33:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 06:33:30,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:30,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:30,848 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:30,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1032963108, now seen corresponding path program 1 times [2018-11-23 06:33:30,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:30,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:30,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:30,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:30,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:33:30,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:30,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:30,960 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-23 06:33:30,960 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [273], [277], [283], [287], [290], [293], [297], [300], [304], [307], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [399], [400], [401] [2018-11-23 06:33:30,962 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:30,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:30,994 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:30,994 INFO L272 AbstractInterpreter]: Visited 35 different actions 35 times. Never merged. Never widened. Performed 472 root evaluator evaluations with a maximum evaluation depth of 3. Performed 472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:30,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:30,996 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:31,056 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 75.71% of their original sizes. [2018-11-23 06:33:31,057 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:31,144 INFO L415 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2018-11-23 06:33:31,144 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-11-23 06:33:31,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:31,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 06:33:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:33:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:33:31,146 INFO L87 Difference]: Start difference. First operand 147 states and 192 transitions. Second operand 12 states. [2018-11-23 06:33:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:31,909 INFO L93 Difference]: Finished difference Result 277 states and 372 transitions. [2018-11-23 06:33:31,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:33:31,909 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2018-11-23 06:33:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:31,910 INFO L225 Difference]: With dead ends: 277 [2018-11-23 06:33:31,910 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 06:33:31,910 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:33:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 06:33:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-11-23 06:33:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 06:33:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2018-11-23 06:33:31,921 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 140 [2018-11-23 06:33:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:31,921 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2018-11-23 06:33:31,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 06:33:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2018-11-23 06:33:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 06:33:31,922 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:31,922 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:31,923 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:31,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash 965990518, now seen corresponding path program 1 times [2018-11-23 06:33:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:31,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:31,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:31,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:31,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 06:33:31,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:31,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:31,982 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-23 06:33:31,982 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [145], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [273], [277], [283], [287], [290], [293], [297], [300], [304], [307], [311], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [399], [400], [401] [2018-11-23 06:33:31,984 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:31,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:32,007 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:32,007 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 519 root evaluator evaluations with a maximum evaluation depth of 3. Performed 519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:32,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:32,009 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:32,039 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 71.97% of their original sizes. [2018-11-23 06:33:32,039 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:32,112 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-23 06:33:32,112 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:32,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:32,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-23 06:33:32,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:32,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 06:33:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 06:33:32,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:33:32,113 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand 13 states. [2018-11-23 06:33:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:32,967 INFO L93 Difference]: Finished difference Result 276 states and 369 transitions. [2018-11-23 06:33:32,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:33:32,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 145 [2018-11-23 06:33:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:32,968 INFO L225 Difference]: With dead ends: 276 [2018-11-23 06:33:32,968 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 06:33:32,968 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 06:33:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 06:33:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-11-23 06:33:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 06:33:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2018-11-23 06:33:32,977 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 145 [2018-11-23 06:33:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:32,977 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2018-11-23 06:33:32,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 06:33:32,977 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2018-11-23 06:33:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 06:33:32,978 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:32,978 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:32,978 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:32,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 494634168, now seen corresponding path program 1 times [2018-11-23 06:33:32,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:32,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:32,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:32,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:33:33,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:33,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:33,065 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-23 06:33:33,065 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [273], [277], [283], [287], [290], [293], [297], [300], [304], [307], [311], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [399], [400], [401] [2018-11-23 06:33:33,067 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:33,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:33,089 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:33,089 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Performed 629 root evaluator evaluations with a maximum evaluation depth of 3. Performed 629 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:33,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:33,091 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:33,125 INFO L227 lantSequenceWeakener]: Weakened 46 states. On average, predicates are now at 73.86% of their original sizes. [2018-11-23 06:33:33,125 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:33,230 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-23 06:33:33,230 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:33,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [10] total 26 [2018-11-23 06:33:33,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:33,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 06:33:33,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 06:33:33,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-11-23 06:33:33,232 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand 18 states. [2018-11-23 06:33:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:34,215 INFO L93 Difference]: Finished difference Result 285 states and 379 transitions. [2018-11-23 06:33:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 06:33:34,216 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 145 [2018-11-23 06:33:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:34,216 INFO L225 Difference]: With dead ends: 285 [2018-11-23 06:33:34,216 INFO L226 Difference]: Without dead ends: 164 [2018-11-23 06:33:34,217 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-11-23 06:33:34,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-23 06:33:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-11-23 06:33:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 06:33:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 208 transitions. [2018-11-23 06:33:34,226 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 208 transitions. Word has length 145 [2018-11-23 06:33:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:34,226 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 208 transitions. [2018-11-23 06:33:34,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 06:33:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 208 transitions. [2018-11-23 06:33:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 06:33:34,228 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:34,228 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:34,228 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:34,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1893929862, now seen corresponding path program 1 times [2018-11-23 06:33:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:34,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:34,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 06:33:34,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:34,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:34,315 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-23 06:33:34,315 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [271], [273], [277], [283], [287], [290], [293], [297], [300], [304], [307], [311], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [399], [400], [401] [2018-11-23 06:33:34,316 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:34,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:34,338 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:34,338 INFO L272 AbstractInterpreter]: Visited 55 different actions 55 times. Never merged. Never widened. Performed 640 root evaluator evaluations with a maximum evaluation depth of 3. Performed 640 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:34,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:34,340 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:34,372 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 73.9% of their original sizes. [2018-11-23 06:33:34,372 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:34,500 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-23 06:33:34,500 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:34,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:34,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 28 [2018-11-23 06:33:34,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:34,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 06:33:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 06:33:34,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:33:34,501 INFO L87 Difference]: Start difference. First operand 164 states and 208 transitions. Second operand 20 states. [2018-11-23 06:33:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:35,720 INFO L93 Difference]: Finished difference Result 296 states and 390 transitions. [2018-11-23 06:33:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 06:33:35,720 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 145 [2018-11-23 06:33:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:35,721 INFO L225 Difference]: With dead ends: 296 [2018-11-23 06:33:35,721 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 06:33:35,722 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-11-23 06:33:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 06:33:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-11-23 06:33:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 06:33:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 223 transitions. [2018-11-23 06:33:35,729 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 223 transitions. Word has length 145 [2018-11-23 06:33:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:35,729 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 223 transitions. [2018-11-23 06:33:35,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 06:33:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 223 transitions. [2018-11-23 06:33:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 06:33:35,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:35,730 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:35,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:35,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1344306232, now seen corresponding path program 1 times [2018-11-23 06:33:35,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:35,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:35,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 06:33:35,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:35,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:35,784 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-23 06:33:35,785 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [271], [273], [277], [283], [285], [287], [290], [293], [297], [300], [304], [307], [311], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [399], [400], [401] [2018-11-23 06:33:35,786 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:35,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:35,813 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:35,813 INFO L272 AbstractInterpreter]: Visited 74 different actions 74 times. Never merged. Never widened. Performed 799 root evaluator evaluations with a maximum evaluation depth of 3. Performed 799 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:35,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:35,826 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:35,886 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 73.92% of their original sizes. [2018-11-23 06:33:35,886 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:36,097 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-23 06:33:36,097 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:36,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:36,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-11-23 06:33:36,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:36,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 06:33:36,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 06:33:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-11-23 06:33:36,098 INFO L87 Difference]: Start difference. First operand 180 states and 223 transitions. Second operand 27 states. [2018-11-23 06:33:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:37,569 INFO L93 Difference]: Finished difference Result 300 states and 388 transitions. [2018-11-23 06:33:37,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 06:33:37,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-11-23 06:33:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:37,571 INFO L225 Difference]: With dead ends: 300 [2018-11-23 06:33:37,571 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 06:33:37,571 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-11-23 06:33:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 06:33:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-23 06:33:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-23 06:33:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2018-11-23 06:33:37,577 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 145 [2018-11-23 06:33:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:37,577 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2018-11-23 06:33:37,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 06:33:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-23 06:33:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-23 06:33:37,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:37,579 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:37,579 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:37,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 505272570, now seen corresponding path program 1 times [2018-11-23 06:33:37,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:37,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:37,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:37,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 06:33:37,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:37,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:37,664 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-11-23 06:33:37,665 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [94], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [179], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [271], [273], [277], [283], [285], [287], [290], [293], [297], [300], [304], [307], [311], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [399], [400], [401] [2018-11-23 06:33:37,666 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:37,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:37,690 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:37,690 INFO L272 AbstractInterpreter]: Visited 77 different actions 77 times. Never merged. Never widened. Performed 808 root evaluator evaluations with a maximum evaluation depth of 3. Performed 808 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-23 06:33:37,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:37,707 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:37,747 INFO L227 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 73.89% of their original sizes. [2018-11-23 06:33:37,747 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:38,013 INFO L415 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-11-23 06:33:38,013 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:38,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:38,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [8] total 35 [2018-11-23 06:33:38,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:38,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 06:33:38,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 06:33:38,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-11-23 06:33:38,015 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand 29 states. [2018-11-23 06:33:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:40,587 INFO L93 Difference]: Finished difference Result 368 states and 490 transitions. [2018-11-23 06:33:40,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 06:33:40,588 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 145 [2018-11-23 06:33:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:40,589 INFO L225 Difference]: With dead ends: 368 [2018-11-23 06:33:40,589 INFO L226 Difference]: Without dead ends: 251 [2018-11-23 06:33:40,591 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-11-23 06:33:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-23 06:33:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-11-23 06:33:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-23 06:33:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 299 transitions. [2018-11-23 06:33:40,603 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 299 transitions. Word has length 145 [2018-11-23 06:33:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:40,603 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 299 transitions. [2018-11-23 06:33:40,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 06:33:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 299 transitions. [2018-11-23 06:33:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-23 06:33:40,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:40,604 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:40,604 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:40,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:40,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1360421963, now seen corresponding path program 1 times [2018-11-23 06:33:40,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:40,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:40,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 06:33:40,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:40,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:40,661 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2018-11-23 06:33:40,661 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [19], [30], [42], [46], [65], [69], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [177], [179], [183], [186], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [271], [273], [277], [283], [285], [287], [290], [293], [297], [300], [304], [307], [311], [314], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [399], [400], [401] [2018-11-23 06:33:40,662 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:40,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:40,707 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:40,708 INFO L272 AbstractInterpreter]: Visited 99 different actions 99 times. Never merged. Never widened. Performed 974 root evaluator evaluations with a maximum evaluation depth of 3. Performed 974 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 48 variables. [2018-11-23 06:33:40,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:40,709 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:40,798 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 71.7% of their original sizes. [2018-11-23 06:33:40,798 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:41,422 INFO L415 sIntCurrentIteration]: We unified 165 AI predicates to 165 [2018-11-23 06:33:41,422 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:41,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:41,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-11-23 06:33:41,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:41,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 06:33:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 06:33:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1458, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 06:33:41,423 INFO L87 Difference]: Start difference. First operand 251 states and 299 transitions. Second operand 40 states. [2018-11-23 06:33:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:45,663 INFO L93 Difference]: Finished difference Result 518 states and 682 transitions. [2018-11-23 06:33:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 06:33:45,664 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 166 [2018-11-23 06:33:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:45,665 INFO L225 Difference]: With dead ends: 518 [2018-11-23 06:33:45,665 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 06:33:45,666 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 06:33:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 06:33:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 323. [2018-11-23 06:33:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-23 06:33:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 391 transitions. [2018-11-23 06:33:45,682 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 391 transitions. Word has length 166 [2018-11-23 06:33:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:45,683 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 391 transitions. [2018-11-23 06:33:45,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 06:33:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 391 transitions. [2018-11-23 06:33:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-23 06:33:45,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:45,684 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:45,684 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:45,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1930450629, now seen corresponding path program 1 times [2018-11-23 06:33:45,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:45,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:45,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:45,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 06:33:45,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:33:45,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:33:45,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:45,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:33:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:33:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:33:45,745 INFO L87 Difference]: Start difference. First operand 323 states and 391 transitions. Second operand 3 states. [2018-11-23 06:33:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:45,774 INFO L93 Difference]: Finished difference Result 571 states and 717 transitions. [2018-11-23 06:33:45,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:33:45,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-11-23 06:33:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:45,776 INFO L225 Difference]: With dead ends: 571 [2018-11-23 06:33:45,776 INFO L226 Difference]: Without dead ends: 335 [2018-11-23 06:33:45,777 INFO L631 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 [2018-11-23 06:33:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-23 06:33:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2018-11-23 06:33:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-23 06:33:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2018-11-23 06:33:45,795 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 173 [2018-11-23 06:33:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:45,795 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2018-11-23 06:33:45,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:33:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2018-11-23 06:33:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 06:33:45,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:45,796 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:45,797 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:45,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash -90864135, now seen corresponding path program 1 times [2018-11-23 06:33:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:45,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:45,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 06:33:45,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:45,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:45,936 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-23 06:33:45,936 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [15], [17], [18], [19], [22], [25], [34], [39], [46], [65], [71], [74], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [135], [139], [140], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [177], [179], [183], [186], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [271], [273], [277], [283], [285], [287], [290], [293], [297], [300], [304], [307], [311], [314], [318], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2018-11-23 06:33:45,939 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:45,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:45,984 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:45,985 INFO L272 AbstractInterpreter]: Visited 104 different actions 104 times. Never merged. Never widened. Performed 986 root evaluator evaluations with a maximum evaluation depth of 3. Performed 986 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 48 variables. [2018-11-23 06:33:45,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:45,997 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:46,087 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 69.46% of their original sizes. [2018-11-23 06:33:46,087 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:46,693 INFO L415 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2018-11-23 06:33:46,693 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:46,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [11] total 53 [2018-11-23 06:33:46,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:46,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 06:33:46,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 06:33:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 06:33:46,694 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand 44 states. [2018-11-23 06:33:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:51,583 INFO L93 Difference]: Finished difference Result 574 states and 711 transitions. [2018-11-23 06:33:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 06:33:51,584 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 174 [2018-11-23 06:33:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:51,585 INFO L225 Difference]: With dead ends: 574 [2018-11-23 06:33:51,585 INFO L226 Difference]: Without dead ends: 332 [2018-11-23 06:33:51,586 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 06:33:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-23 06:33:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 325. [2018-11-23 06:33:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-23 06:33:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 387 transitions. [2018-11-23 06:33:51,603 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 387 transitions. Word has length 174 [2018-11-23 06:33:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:51,603 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 387 transitions. [2018-11-23 06:33:51,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 06:33:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 387 transitions. [2018-11-23 06:33:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 06:33:51,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:51,604 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:51,604 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:51,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:51,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1989871414, now seen corresponding path program 1 times [2018-11-23 06:33:51,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:51,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:51,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:51,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 06:33:51,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:33:51,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:33:51,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:51,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:33:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:33:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:33:51,644 INFO L87 Difference]: Start difference. First operand 325 states and 387 transitions. Second operand 3 states. [2018-11-23 06:33:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:33:51,658 INFO L93 Difference]: Finished difference Result 576 states and 711 transitions. [2018-11-23 06:33:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:33:51,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-23 06:33:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:33:51,660 INFO L225 Difference]: With dead ends: 576 [2018-11-23 06:33:51,660 INFO L226 Difference]: Without dead ends: 338 [2018-11-23 06:33:51,661 INFO L631 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 [2018-11-23 06:33:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-23 06:33:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 332. [2018-11-23 06:33:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-23 06:33:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 397 transitions. [2018-11-23 06:33:51,672 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 397 transitions. Word has length 175 [2018-11-23 06:33:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:33:51,672 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 397 transitions. [2018-11-23 06:33:51,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:33:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 397 transitions. [2018-11-23 06:33:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 06:33:51,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:33:51,674 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:33:51,674 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:33:51,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash 932033336, now seen corresponding path program 1 times [2018-11-23 06:33:51,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:33:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:51,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:33:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:33:51,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:33:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:33:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 06:33:51,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:33:51,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 06:33:51,742 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-23 06:33:51,742 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [15], [17], [18], [19], [22], [25], [34], [37], [48], [53], [65], [71], [74], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [135], [139], [140], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [171], [174], [177], [179], [183], [186], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [236], [238], [240], [242], [247], [250], [256], [259], [265], [271], [273], [277], [283], [285], [287], [290], [293], [297], [300], [304], [307], [311], [314], [318], [321], [323], [324], [327], [346], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2018-11-23 06:33:51,743 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 06:33:51,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 06:33:51,812 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 06:33:51,812 INFO L272 AbstractInterpreter]: Visited 121 different actions 174 times. Merged at 10 different actions 15 times. Never widened. Performed 1860 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1860 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 1 different actions. Largest state had 48 variables. [2018-11-23 06:33:51,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:33:51,825 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 06:33:51,930 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 71.53% of their original sizes. [2018-11-23 06:33:51,930 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 06:33:52,805 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-23 06:33:52,805 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 06:33:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 06:33:52,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [7] total 58 [2018-11-23 06:33:52,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:33:52,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 06:33:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 06:33:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 06:33:52,806 INFO L87 Difference]: Start difference. First operand 332 states and 397 transitions. Second operand 53 states. [2018-11-23 06:34:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:34:01,633 INFO L93 Difference]: Finished difference Result 487 states and 588 transitions. [2018-11-23 06:34:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 06:34:01,633 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 175 [2018-11-23 06:34:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:34:01,634 INFO L225 Difference]: With dead ends: 487 [2018-11-23 06:34:01,634 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 06:34:01,635 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=563, Invalid=5289, Unknown=0, NotChecked=0, Total=5852 [2018-11-23 06:34:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 06:34:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 06:34:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 06:34:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 06:34:01,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2018-11-23 06:34:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:34:01,636 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:34:01,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 06:34:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:34:01,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 06:34:01,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 06:34:01,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 06:34:02,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 06:34:02,192 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2018-11-23 06:34:02,306 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-23 06:34:02,549 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 131 [2018-11-23 06:34:02,663 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-23 06:34:02,865 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-23 06:34:02,979 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-23 06:34:03,120 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2018-11-23 06:34:03,384 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2018-11-23 06:34:03,718 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2018-11-23 06:34:03,955 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2018-11-23 06:34:04,265 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2018-11-23 06:34:04,455 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2018-11-23 06:34:04,617 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2018-11-23 06:34:04,940 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-23 06:34:05,084 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-11-23 06:34:05,373 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-23 06:34:05,860 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 135 [2018-11-23 06:34:06,257 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2018-11-23 06:34:06,400 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-11-23 06:34:06,683 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2018-11-23 06:34:06,893 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-23 06:34:07,068 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 129 [2018-11-23 06:34:07,295 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 129 [2018-11-23 06:34:07,567 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2018-11-23 06:34:07,912 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-23 06:34:07,914 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (or (= ~comp_m1_st~0 0) (= ~comp_m1_st~0 2)) (< 0 ~comp_m1_i~0) (let ((.cse0 (not (= 0 ~z_val_t~0)))) (and (or (not (= ~z_req_up~0 0)) .cse0) (or .cse0 (not (= ~z_req_up~0 1))))) (let ((.cse1 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse3 (not (= 1 ~b1_val~0))) (.cse4 (not (= ~z_val~0 0))) (.cse5 (not (= 2 ~d1_ev~0))) (.cse6 (not (= 2 ~b0_ev~0))) (.cse7 (not (= 1 ~d1_val~0))) (.cse8 (not (= 0 ~d1_req_up~0))) (.cse9 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 0 ~b0_req_up~0))) (.cse11 (not (= ~d0_req_up~0 0))) (.cse12 (not (= ~b0_val~0 1)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 |old(~comp_m1_st~0)|)) .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 2 |old(~comp_m1_st~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= ~d0_val~0 1))) [2018-11-23 06:34:07,914 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-11-23 06:34:07,914 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2018-11-23 06:34:07,914 INFO L444 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (or (= ~comp_m1_st~0 0) (= ~comp_m1_st~0 2)) (< 0 ~comp_m1_i~0) (let ((.cse0 (not (= 0 ~z_val_t~0)))) (and (or (not (= ~z_req_up~0 0)) .cse0) (or .cse0 (not (= ~z_req_up~0 1))))) (let ((.cse1 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse3 (not (= 1 ~b1_val~0))) (.cse4 (not (= ~z_val~0 0))) (.cse5 (not (= 2 ~d1_ev~0))) (.cse6 (not (= 2 ~b0_ev~0))) (.cse7 (not (= 1 ~d1_val~0))) (.cse8 (not (= 0 ~d1_req_up~0))) (.cse9 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 0 ~b0_req_up~0))) (.cse11 (not (= ~d0_req_up~0 0))) (.cse12 (not (= ~b0_val~0 1)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 |old(~comp_m1_st~0)|)) .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 2 |old(~comp_m1_st~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= ~d0_val~0 1))) [2018-11-23 06:34:07,914 INFO L448 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2018-11-23 06:34:07,914 INFO L448 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2018-11-23 06:34:07,914 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L444 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse4 (not (= 2 ~d0_ev~0))) (.cse0 (not (= ~z_ev~0 2))) (.cse17 (= exists_runnable_thread_~__retres1~1 1)) (.cse5 (not (= ~b1_ev~0 2))) (.cse6 (not (= 1 ~b1_val~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (not (= 2 ~d1_ev~0))) (.cse9 (not (= 2 ~b0_ev~0))) (.cse10 (not (= 1 ~d1_val~0))) (.cse2 (not (= ~z_req_up~0 0))) (.cse11 (not (= 0 ~d1_req_up~0))) (.cse12 (not (= 0 ~b1_req_up~0))) (.cse1 (< 0 ~comp_m1_i~0)) (.cse13 (not (= 0 ~comp_m1_st~0))) (.cse14 (not (= 0 ~b0_req_up~0))) (.cse15 (not (= ~d0_req_up~0 0))) (.cse16 (not (= ~b0_val~0 1))) (.cse18 (not (= ~d0_val~0 1)))) (and (or .cse0 .cse1 (let ((.cse3 (not (= 0 ~z_val_t~0)))) (and (or .cse2 .cse3) (or .cse3 (not (= ~z_req_up~0 1))))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 2 ~comp_m1_st~0)) .cse10 .cse11 .cse12 .cse14 .cse15 .cse16)) (or (and .cse17 (= ~comp_m1_st~0 0)) (and (= exists_runnable_thread_~__retres1~1 0) (= ~comp_m1_st~0 2))) .cse18) (or .cse4 .cse0 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse18))) [2018-11-23 06:34:07,915 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L444 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= 1 ~b1_val~0)) (let ((.cse0 (= ~z_val_t~0 0))) (or (and .cse0 (= ~z_req_up~0 0)) (and (= ~z_req_up~0 1) .cse0))) (not (= 1 ~d1_val~0)) (< 0 ~comp_m1_i~0) (let ((.cse1 (not (= 0 ~d1_req_up~0))) (.cse2 (not (= 2 ~d0_ev~0))) (.cse3 (not (= ~b1_ev~0 2))) (.cse4 (not (= ~z_val~0 0))) (.cse5 (not (= 0 |old(~z_val_t~0)|))) (.cse6 (not (= 0 ~b1_req_up~0))) (.cse7 (not (= 2 ~d1_ev~0))) (.cse8 (not (= 2 ~b0_ev~0)))) (and (or (not (= |old(~z_req_up~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |old(~z_req_up~0)| 1)) .cse8))) (not (= 0 ~b0_req_up~0)) (not (= ~d0_req_up~0 0)) (not (= ~b0_val~0 1)) (not (= ~d0_val~0 1))) [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2018-11-23 06:34:07,915 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse5 (not (= ~z_req_up~0 0))) (.cse6 (not (= 0 ~d1_req_up~0))) (.cse3 (not (= ~z_val~0 0))) (.cse7 (not (= 0 ~b1_req_up~0)))) (let ((.cse9 (not (= 0 ~comp_m1_st~0))) (.cse1 (not (= |old(~z_ev~0)| 2))) (.cse0 (= ~z_ev~0 2)) (.cse15 (= ~d1_ev~0 2)) (.cse14 (= ~b1_ev~0 2)) (.cse16 (= ~b0_ev~0 2)) (.cse17 (= ~d0_ev~0 2)) (.cse8 (< 0 ~comp_m1_i~0)) (.cse18 (let ((.cse19 (not (= 2 |old(~d0_ev~0)|))) (.cse20 (not (= |old(~b1_ev~0)| 2))) (.cse21 (not (= 0 ~z_val_t~0))) (.cse22 (not (= 2 |old(~d1_ev~0)|))) (.cse23 (not (= 2 |old(~b0_ev~0)|)))) (and (or .cse5 .cse6 .cse19 .cse20 .cse3 .cse21 .cse7 .cse22 .cse23) (or .cse6 .cse19 .cse20 .cse3 .cse21 .cse7 .cse22 (not (= ~z_req_up~0 1)) .cse23)))) (.cse2 (not (= 1 ~b1_val~0))) (.cse4 (not (= 1 ~d1_val~0))) (.cse10 (not (= 0 ~b0_req_up~0))) (.cse11 (not (= ~d0_req_up~0 0))) (.cse12 (not (= ~b0_val~0 1))) (.cse13 (not (= ~d0_val~0 1)))) (and (or (and (= ~b1_ev~0 1) (= ~b0_ev~0 1) (= ~d0_ev~0 1) (= ~d1_ev~0 1) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~b1_ev~0)| 1)) .cse7 .cse8 (not (= 1 |old(~d0_ev~0)|)) .cse9 .cse10 (not (= 1 |old(~b0_ev~0)|)) .cse11 .cse12 .cse13 (not (= 1 |old(~d1_ev~0)|))) (or .cse1 .cse2 .cse4 (and .cse14 .cse15 .cse16 .cse17 .cse0) .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 (and .cse0 (and .cse15 .cse14 .cse16 .cse17)) .cse8 .cse18 (or .cse2 (not (= 2 ~comp_m1_st~0)) .cse4 .cse10 .cse11 .cse12) .cse13)))) [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2018-11-23 06:34:07,916 INFO L451 ceAbstractionStarter]: At program point init_threadsENTRY(lines 241 253) the Hoare annotation is: true [2018-11-23 06:34:07,916 INFO L448 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 483 501) the Hoare annotation is: (or (< 0 |old(~comp_m1_i~0)|) (<= ~comp_m1_i~0 0)) [2018-11-23 06:34:07,917 INFO L444 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (< 0 |old(~comp_m1_i~0)|) [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L444 ceAbstractionStarter]: At program point L488(line 488) the Hoare annotation is: (or (< 0 |old(~comp_m1_i~0)|) (<= ~comp_m1_i~0 0)) [2018-11-23 06:34:07,917 INFO L444 ceAbstractionStarter]: At program point L488-1(line 488) the Hoare annotation is: (or (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~b0_val_t~0 1) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~d0_val_t~0 1) (= ~d1_val_t~0 1) (= ~b1_val~0 0) (= ~b1_val_t~0 1) (= ~z_ev~0 2) (= ~comp_m1_i~0 0) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (< 0 |old(~comp_m1_i~0)|)) [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L444 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse7 (not (= 2 ~comp_m1_st~0)))) (let ((.cse0 (not (= |old(~z_ev~0)| 2))) (.cse1 (= ~z_req_up~0 1)) (.cse4 (not (= |old(~z_req_up~0)| 1))) (.cse3 (not (= 0 ~z_val_t~0))) (.cse2 (< 0 ~comp_m1_i~0)) (.cse5 (let ((.cse8 (not (= 2 ~d0_ev~0))) (.cse9 (not (= ~b1_ev~0 2))) (.cse10 (not (= 1 ~b1_val~0))) (.cse11 (not (= |old(~z_val~0)| 0))) (.cse12 (not (= 2 ~d1_ev~0))) (.cse13 (not (= 2 ~b0_ev~0))) (.cse14 (not (= 1 ~d1_val~0))) (.cse15 (not (= 0 ~d1_req_up~0))) (.cse16 (not (= 0 ~b1_req_up~0))) (.cse17 (not (= 0 ~b0_req_up~0))) (.cse18 (not (= ~d0_req_up~0 0))) (.cse19 (not (= ~b0_val~0 1)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ~comp_m1_st~0)) .cse17 .cse18 .cse19) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse7 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse6 (not (= ~d0_val~0 1)))) (and (or .cse0 (and (or .cse1 (= ~z_req_up~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0)) .cse2 (and (or (not (= |old(~z_req_up~0)| 0)) .cse3) (or .cse3 .cse4)) .cse5 .cse6) (or .cse0 .cse1 .cse4 .cse7 .cse3 .cse2 .cse5 .cse6)))) [2018-11-23 06:34:07,917 INFO L448 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2018-11-23 06:34:07,917 INFO L444 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= 1 ~b1_val~0)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 0 ~b0_ev~0)) (not (= 0 |old(~d1_val~0)|)) (not (= ~z_req_up~0 0)) (and (= ~d1_ev~0 2) (= ~d1_req_up~0 1) (= ~d1_val~0 0)) (not (= ~d1_val_t~0 1)) (not (= 0 ~b1_req_up~0)) (not (= ~b1_ev~0 0)) (not (= 0 ~b0_req_up~0)) (not (= ~d0_req_up~0 0)) (not (= ~b0_val~0 1)) (not (= 0 ~d0_ev~0)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val~0 1))) [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L451 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L451 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: true [2018-11-23 06:34:07,918 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse19 (not (= |old(~z_req_up~0)| 0))) (.cse20 (not (= 0 ~d1_req_up~0))) (.cse13 (not (= 2 ~d0_ev~0))) (.cse14 (not (= ~b1_ev~0 2))) (.cse15 (not (= ~z_val~0 0))) (.cse21 (not (= 0 ~b1_req_up~0))) (.cse17 (not (= 2 ~d1_ev~0))) (.cse18 (not (= 2 ~b0_ev~0))) (.cse16 (= ~z_req_up~0 0)) (.cse23 (= ~z_val_t~0 0))) (let ((.cse4 (and (= ~z_req_up~0 1) .cse23)) (.cse3 (and .cse23 .cse16)) (.cse7 (let ((.cse22 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse19 .cse20 .cse13 .cse14 .cse15 .cse22 .cse21 .cse17 .cse18) (or .cse20 .cse13 .cse14 .cse15 .cse22 .cse21 .cse17 (not (= |old(~z_req_up~0)| 1)) .cse18)))) (.cse0 (not (= ~z_ev~0 2))) (.cse1 (not (= 1 ~b1_val~0))) (.cse5 (= ~comp_m1_st~0 0)) (.cse2 (not (= 1 ~d1_val~0))) (.cse6 (< 0 ~comp_m1_i~0)) (.cse8 (not (= 0 |old(~comp_m1_st~0)|))) (.cse9 (not (= 0 ~b0_req_up~0))) (.cse10 (not (= ~d0_req_up~0 0))) (.cse11 (not (= ~b0_val~0 1))) (.cse12 (not (= ~d0_val~0 1)))) (and (or .cse0 .cse1 .cse2 (and (or .cse3 .cse4) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (and (or .cse4 .cse3) (or .cse5 (= ~comp_m1_st~0 2))) .cse6 .cse7 (or .cse1 (not (= 2 |old(~comp_m1_st~0)|)) .cse2 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse0 .cse14 .cse1 .cse15 (and .cse16 .cse5) .cse17 .cse18 .cse2 .cse19 .cse20 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-23 06:34:07,918 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-11-23 06:34:07,918 INFO L444 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse13 (not (= |old(~z_req_up~0)| 0))) (.cse14 (not (= 0 ~d1_req_up~0))) (.cse0 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse4 (not (= ~z_val~0 0))) (.cse15 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 2 ~d1_ev~0))) (.cse11 (not (= 2 ~b0_ev~0)))) (let ((.cse1 (not (= ~z_ev~0 2))) (.cse6 (= ~comp_m1_st~0 2)) (.cse9 (= ~comp_m1_st~0 0)) (.cse16 (< 0 ~comp_m1_i~0)) (.cse22 (let ((.cse24 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse13 .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 .cse11) (or .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 (not (= |old(~z_req_up~0)| 1)) .cse11)))) (.cse17 (not (= 0 |old(~comp_m1_st~0)|))) (.cse3 (not (= 1 ~b1_val~0))) (.cse12 (not (= 1 ~d1_val~0))) (.cse18 (not (= 0 ~b0_req_up~0))) (.cse19 (not (= ~d0_req_up~0 0))) (.cse20 (not (= ~b0_val~0 1))) (.cse21 (not (= ~d0_val~0 1))) (.cse8 (= ~z_req_up~0 0)) (.cse7 (= ~z_req_up~0 1)) (.cse5 (= ~z_val_t~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) (and .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse9 .cse12 .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7) (let ((.cse23 (or (and .cse5 .cse8) (and .cse7 .cse5)))) (or .cse1 (and .cse23 .cse6) (and .cse23 .cse9) .cse16 .cse22 (and (or .cse3 .cse12 .cse17 .cse18 .cse19 .cse20) (or .cse3 (not (= 2 |old(~comp_m1_st~0)|)) .cse12 .cse18 .cse19 .cse20)) .cse21))))) [2018-11-23 06:34:07,919 INFO L444 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse19 (= ~z_ev~0 2))) (let ((.cse0 (not .cse19)) (.cse4 (not (= 1 ~b1_val~0))) (.cse1 (and (let ((.cse18 (= ~z_val_t~0 0))) (or (and .cse18 (= ~z_req_up~0 0)) (and (= ~z_req_up~0 1) .cse18))) (= ~b1_val~0 1) .cse19)) (.cse5 (not (= 1 ~d1_val~0))) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (let ((.cse10 (not (= 0 ~d1_req_up~0))) (.cse11 (not (= 2 ~d0_ev~0))) (.cse12 (not (= ~b1_ev~0 2))) (.cse13 (not (= ~z_val~0 0))) (.cse14 (not (= 0 |old(~z_val_t~0)|))) (.cse15 (not (= 0 ~b1_req_up~0))) (.cse16 (not (= 2 ~d1_ev~0))) (.cse17 (not (= 2 ~b0_ev~0)))) (and (or (not (= |old(~z_req_up~0)| 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= |old(~z_req_up~0)| 1)) .cse17)))) (.cse6 (not (= 0 ~b0_req_up~0))) (.cse7 (not (= ~d0_req_up~0 0))) (.cse8 (not (= ~b0_val~0 1))) (.cse9 (not (= ~d0_val~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (or .cse4 (not (= 2 |old(~comp_m1_st~0)|)) .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 (not (= 0 |old(~comp_m1_st~0)|)) .cse6 .cse7 .cse8 .cse9)))) [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L444 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse13 (not (= |old(~z_req_up~0)| 0))) (.cse14 (not (= 0 ~d1_req_up~0))) (.cse0 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse4 (not (= ~z_val~0 0))) (.cse15 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 2 ~d1_ev~0))) (.cse11 (not (= 2 ~b0_ev~0)))) (let ((.cse1 (not (= ~z_ev~0 2))) (.cse6 (= ~comp_m1_st~0 2)) (.cse9 (= ~comp_m1_st~0 0)) (.cse16 (< 0 ~comp_m1_i~0)) (.cse22 (let ((.cse24 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse13 .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 .cse11) (or .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 (not (= |old(~z_req_up~0)| 1)) .cse11)))) (.cse17 (not (= 0 |old(~comp_m1_st~0)|))) (.cse3 (not (= 1 ~b1_val~0))) (.cse12 (not (= 1 ~d1_val~0))) (.cse18 (not (= 0 ~b0_req_up~0))) (.cse19 (not (= ~d0_req_up~0 0))) (.cse20 (not (= ~b0_val~0 1))) (.cse21 (not (= ~d0_val~0 1))) (.cse8 (= ~z_req_up~0 0)) (.cse7 (= ~z_req_up~0 1)) (.cse5 (= ~z_val_t~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) (and .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse9 .cse12 .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7) (let ((.cse23 (or (and .cse5 .cse8) (and .cse7 .cse5)))) (or .cse1 (and .cse23 .cse6) (and .cse23 .cse9) .cse16 .cse22 (and (or .cse3 .cse12 .cse17 .cse18 .cse19 .cse20) (or .cse3 (not (= 2 |old(~comp_m1_st~0)|)) .cse12 .cse18 .cse19 .cse20)) .cse21))))) [2018-11-23 06:34:07,919 INFO L444 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse22 (= ~z_val~0 0)) (.cse23 (= ~b1_ev~0 2))) (let ((.cse2 (= ~z_val_t~0 0)) (.cse3 (= ~comp_m1_st~0 2)) (.cse1 (= ~z_req_up~0 1)) (.cse24 (= ~z_ev~0 2)) (.cse19 (not (= |old(~z_req_up~0)| 0))) (.cse20 (not (= 0 ~d1_req_up~0))) (.cse14 (not (= 2 ~d0_ev~0))) (.cse15 (not .cse23)) (.cse16 (not .cse22)) (.cse21 (not (= 0 ~b1_req_up~0))) (.cse17 (not (= 2 ~d1_ev~0))) (.cse18 (not (= 2 ~b0_ev~0)))) (let ((.cse5 (let ((.cse25 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse19 .cse20 .cse14 .cse15 .cse16 .cse25 .cse21 .cse17 .cse18) (or .cse20 .cse14 .cse15 .cse16 .cse25 .cse21 .cse17 (not (= |old(~z_req_up~0)| 1)) .cse18)))) (.cse0 (not .cse24)) (.cse6 (not (= 1 ~b1_val~0))) (.cse12 (and .cse22 .cse23 .cse2 .cse3 (= ~d0_ev~0 2) .cse1 (= ~b1_val~0 1) .cse24)) (.cse7 (not (= 1 ~d1_val~0))) (.cse4 (< 0 ~comp_m1_i~0)) (.cse13 (not (= 0 |old(~comp_m1_st~0)|))) (.cse8 (not (= 0 ~b0_req_up~0))) (.cse9 (not (= ~d0_req_up~0 0))) (.cse10 (not (= ~b0_val~0 1))) (.cse11 (not (= ~d0_val~0 1)))) (and (or .cse0 (and (or (and .cse1 .cse2) (and .cse2 (= ~z_req_up~0 0))) (or (= ~comp_m1_st~0 0) .cse3)) .cse4 .cse5 (or .cse6 (not (= 2 |old(~comp_m1_st~0)|)) .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse0 .cse6 .cse12 .cse7 .cse4 .cse5 .cse13 .cse8 .cse9 .cse10 .cse11) (or .cse14 .cse0 .cse15 .cse6 .cse16 .cse12 .cse17 .cse18 .cse7 .cse19 .cse20 .cse21 .cse4 .cse13 .cse8 .cse9 .cse10 .cse11))))) [2018-11-23 06:34:07,919 INFO L444 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= 1 ~b1_val~0)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 ~d1_ev~0)) (and (= ~d0_val~0 0) (= ~d0_req_up~0 1)) (not (= 0 ~b0_ev~0)) (not (= 0 ~d1_val~0)) (not (= |old(~d0_val~0)| 0)) (not (= ~z_req_up~0 0)) (not (= ~d1_val_t~0 1)) (not (= 0 ~b1_req_up~0)) (not (= ~b1_ev~0 0)) (not (= 0 ~b0_req_up~0)) (not (= ~b0_val~0 1)) (not (= 1 ~d1_req_up~0)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2018-11-23 06:34:07,919 INFO L444 ceAbstractionStarter]: At program point update_b1ENTRY(lines 138 152) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 2 ~d0_ev~0)) (not (= ~z_ev~0 2)) (not (= ~d0_req_up~0 1)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 ~d1_ev~0)) (not (= 0 ~b0_ev~0)) (not (= 0 ~d1_val~0)) (not (= ~d0_val~0 0)) (not (= ~z_req_up~0 0)) (and (= ~b1_req_up~0 1) (= ~b1_val~0 0)) (not (= 1 ~b1_val_t~0)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 0 ~b0_req_up~0)) (not (= ~b0_val~0 1)) (not (= 1 ~d1_req_up~0)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,919 INFO L448 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2018-11-23 06:34:07,920 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2018-11-23 06:34:07,920 INFO L448 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2018-11-23 06:34:07,920 INFO L444 ceAbstractionStarter]: At program point update_b0ENTRY(lines 123 137) the Hoare annotation is: (or (not (= 1 ~b1_req_up~0)) (not (= 1 ~b0_val_t~0)) (not (= 2 ~d0_ev~0)) (not (= ~z_ev~0 2)) (not (= ~d0_req_up~0 1)) (and (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b0_req_up~0 1)) (not (= ~b1_ev~0 2)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 ~d1_ev~0)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 ~d1_val~0)) (not (= ~d0_val~0 0)) (not (= ~z_req_up~0 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 ~b1_val~0)) (not (= 1 ~d1_req_up~0)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,920 INFO L448 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2018-11-23 06:34:07,920 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (and (= ~z_val~0 0) (= ~b1_ev~0 1) (= ~b0_ev~0 1) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~d0_ev~0 1) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d1_ev~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,920 INFO L444 ceAbstractionStarter]: At program point L415(line 415) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,920 INFO L444 ceAbstractionStarter]: At program point L415-1(line 415) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~b0_ev~0 0) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~d0_ev~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,920 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2018-11-23 06:34:07,920 INFO L444 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 2)) (.cse9 (let ((.cse13 (= ~z_val~0 0)) (.cse14 (= ~d1_ev~0 2)) (.cse15 (= ~z_val_t~0 0))) (or (and .cse13 .cse14 .cse15 (= ~z_req_up~0 0)) (and .cse13 .cse14 (= ~z_req_up~0 1) .cse15)))) (.cse1 (= ~b0_ev~0 2)) (.cse2 (= ~b0_req_up~0 0)) (.cse3 (= ~d0_val~0 1)) (.cse4 (= ~d0_ev~0 2)) (.cse5 (= ~d1_req_up~0 0)) (.cse6 (= ~b0_val~0 1)) (.cse7 (= ~b1_val~0 1)) (.cse8 (= ~b1_req_up~0 0)) (.cse10 (= ~d1_val~0 1)) (.cse11 (= ~d0_req_up~0 0)) (.cse12 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (and (and .cse0 .cse1 .cse2 .cse3 (= ~comp_m1_st~0 2) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse0 .cse9 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1)))) [2018-11-23 06:34:07,920 INFO L444 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (let ((.cse0 (= ~z_val_t~0 0))) (or (and (= ~z_req_up~0 1) .cse0) (and .cse0 (= ~z_req_up~0 0)))) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (let ((.cse1 (= ~z_val~0 0)) (.cse2 (= ~d1_ev~0 2)) (.cse3 (= ~b1_ev~0 2)) (.cse4 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~d0_val~0 1)) (.cse7 (= ~d0_ev~0 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~comp_m1_st~0 0) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~comp_m1_st~0 2) .cse7)))) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,921 INFO L444 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (let ((.cse0 (= ~z_val_t~0 0))) (or (and (= ~z_req_up~0 1) .cse0) (and .cse0 (= ~z_req_up~0 0)))) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (let ((.cse1 (= ~z_val~0 0)) (.cse2 (= ~d1_ev~0 2)) (.cse3 (= ~b1_ev~0 2)) (.cse4 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~d0_val~0 1)) (.cse7 (= ~d0_ev~0 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~comp_m1_st~0 0) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~comp_m1_st~0 2) .cse7)))) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,921 INFO L444 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (let ((.cse0 (= ~z_val_t~0 0))) (or (and (= ~z_req_up~0 1) .cse0) (and .cse0 (= ~z_req_up~0 0)))) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (let ((.cse1 (= ~z_val~0 0)) (.cse2 (= ~d1_ev~0 2)) (.cse3 (= ~b1_ev~0 2)) (.cse4 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~d0_val~0 1)) (.cse7 (= ~d0_ev~0 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~comp_m1_st~0 0) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~comp_m1_st~0 2) .cse7)))) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,921 INFO L448 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2018-11-23 06:34:07,921 INFO L444 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse4 (= ~z_req_up~0 0)) (.cse0 (= ~z_val~0 0)) (.cse1 (= ~d1_ev~0 2))) (let ((.cse2 (= ~b1_ev~0 2)) (.cse16 (let ((.cse17 (= ~z_val_t~0 0))) (or (and .cse0 .cse1 .cse17 .cse4) (and .cse0 .cse1 (= ~z_req_up~0 1) .cse17)))) (.cse3 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~comp_m1_st~0 0)) (.cse7 (= ~d0_val~0 1)) (.cse8 (= ~d0_ev~0 2)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~b0_val~0 1)) (.cse11 (= ~b1_val~0 1)) (.cse12 (= ~b1_req_up~0 0)) (.cse13 (= ~d1_val~0 1)) (.cse14 (= ~d0_req_up~0 0)) (.cse15 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~d1_ev~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse7 (= ~comp_m1_st~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-23 06:34:07,921 INFO L448 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-11-23 06:34:07,922 INFO L444 ceAbstractionStarter]: At program point L422-1(lines 419 444) the Hoare annotation is: (let ((.cse4 (= ~z_req_up~0 0)) (.cse0 (= ~z_val~0 0)) (.cse1 (= ~d1_ev~0 2))) (let ((.cse2 (= ~b1_ev~0 2)) (.cse16 (let ((.cse17 (= ~z_val_t~0 0))) (or (and .cse0 .cse1 .cse17 .cse4) (and .cse0 .cse1 (= ~z_req_up~0 1) .cse17)))) (.cse3 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~comp_m1_st~0 0)) (.cse7 (= ~d0_val~0 1)) (.cse8 (= ~d0_ev~0 2)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~b0_val~0 1)) (.cse11 (= ~b1_val~0 1)) (.cse12 (= ~b1_req_up~0 0)) (.cse13 (= ~d1_val~0 1)) (.cse14 (= ~d0_req_up~0 0)) (.cse15 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~d1_ev~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse7 (= ~comp_m1_st~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-23 06:34:07,922 INFO L444 ceAbstractionStarter]: At program point L418(line 418) the Hoare annotation is: (or (and (= ~z_val~0 0) (= ~b1_ev~0 1) (= ~b0_ev~0 1) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~comp_m1_st~0 0) (= ~d0_val~0 1) (= ~d0_ev~0 1) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d1_ev~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,922 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 408 450) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,922 INFO L444 ceAbstractionStarter]: At program point L416(line 416) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~b0_ev~0 0) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~d0_ev~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-23 06:34:07,922 INFO L444 ceAbstractionStarter]: At program point L445(lines 408 450) the Hoare annotation is: (let ((.cse0 (= ~z_val~0 0)) (.cse1 (= ~d1_ev~0 2)) (.cse2 (= ~b1_ev~0 2)) (.cse3 (= ~b0_ev~0 2)) (.cse4 (= ~b0_req_up~0 0)) (.cse5 (= ~d0_ev~0 2)) (.cse6 (= ~d1_req_up~0 0)) (.cse7 (= ~b1_req_up~0 0)) (.cse8 (= ~d0_req_up~0 0)) (.cse9 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d0_val~0 1) .cse5 .cse6 (= ~b0_val~0 1) .cse7 .cse8 .cse9) (not (= 2 |old(~d1_ev~0)|)) (and .cse0 .cse1 .cse2 .cse3 (= ~z_req_up~0 0) .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1)))) [2018-11-23 06:34:07,923 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-11-23 06:34:07,923 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-23 06:34:07,923 INFO L444 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 2)) (.cse9 (let ((.cse13 (= ~z_val~0 0)) (.cse14 (= ~d1_ev~0 2)) (.cse15 (= ~z_val_t~0 0))) (or (and .cse13 .cse14 .cse15 (= ~z_req_up~0 0)) (and .cse13 .cse14 (= ~z_req_up~0 1) .cse15)))) (.cse1 (= ~b0_ev~0 2)) (.cse2 (= ~b0_req_up~0 0)) (.cse3 (= ~d0_val~0 1)) (.cse4 (= ~d0_ev~0 2)) (.cse5 (= ~d1_req_up~0 0)) (.cse6 (= ~b0_val~0 1)) (.cse7 (= ~b1_val~0 1)) (.cse8 (= ~b1_req_up~0 0)) (.cse10 (= ~d1_val~0 1)) (.cse11 (= ~d0_req_up~0 0)) (.cse12 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (and (and .cse0 .cse1 .cse2 .cse3 (= ~comp_m1_st~0 2) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse0 .cse9 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1)))) [2018-11-23 06:34:07,923 INFO L448 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-11-23 06:34:07,923 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse0 (not (= |old(~z_ev~0)| 2))) (.cse6 (not (= 1 ~b1_val~0))) (.cse7 (not (= ~z_val~0 0))) (.cse10 (not (= 1 ~d1_val~0))) (.cse2 (not (= ~z_req_up~0 0))) (.cse11 (not (= 0 ~d1_req_up~0))) (.cse12 (not (= 0 ~b1_req_up~0))) (.cse13 (not (= 0 ~b0_req_up~0))) (.cse1 (= ~z_ev~0 2)) (.cse14 (not (= ~d0_req_up~0 0))) (.cse15 (not (= ~b0_val~0 1))) (.cse16 (not (= ~d0_val~0 1)))) (and (or .cse0 (and .cse1 (and (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~b0_ev~0 2) (= ~d0_ev~0 2))) (< 0 ~comp_m1_i~0) (let ((.cse3 (not (= 0 ~z_val_t~0)))) (and (or .cse2 .cse3) (or .cse3 (not (= ~z_req_up~0 1))))) (let ((.cse4 (not (= 2 |old(~d0_ev~0)|))) (.cse5 (not (= |old(~b1_ev~0)| 2))) (.cse8 (not (= 2 |old(~d1_ev~0)|))) (.cse9 (not (= 2 |old(~b0_ev~0)|)))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ~comp_m1_st~0)) .cse13 .cse14 .cse15) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 2 ~comp_m1_st~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) .cse16) (or .cse0 .cse6 .cse7 (not (= ~comp_m1_i~0 0)) (not (= 0 |old(~d1_ev~0)|)) (not (= 0 |old(~b0_ev~0)|)) .cse10 .cse2 .cse11 .cse12 (not (= |old(~b1_ev~0)| 0)) .cse13 (and (= ~b1_ev~0 0) (= ~d1_ev~0 0) (= ~b0_ev~0 0) (= ~d0_ev~0 0) .cse1) .cse14 .cse15 (not (= 0 |old(~d0_ev~0)|)) .cse16))) [2018-11-23 06:34:07,923 INFO L448 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-11-23 06:34:07,923 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2018-11-23 06:34:07,923 INFO L448 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-11-23 06:34:07,924 INFO L448 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-11-23 06:34:07,924 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2018-11-23 06:34:07,924 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-11-23 06:34:07,924 INFO L444 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse3 (not (= 2 |old(~d0_ev~0)|))) (.cse0 (not (= |old(~z_ev~0)| 2))) (.cse4 (not (= |old(~b1_ev~0)| 2))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (= 2 |old(~d1_ev~0)|))) (.cse8 (not (= 2 |old(~b0_ev~0)|))) (.cse1 (not (= |old(~z_req_up~0)| 0)))) (and (or .cse0 (< 0 ~comp_m1_i~0) (let ((.cse2 (not (= 0 ~z_val_t~0)))) (and (or .cse1 .cse2) (or .cse2 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse5 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse3 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse6 (not (= ~comp_m1_i~0 0)) .cse7 .cse8 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse1 (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~d1_req_up~0 1) (= ~b0_ev~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d0_req_up~0 0) (= ~d0_ev~0 0) (= ~z_ev~0 2) (= ~d1_val~0 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-23 06:34:07,924 INFO L448 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2018-11-23 06:34:07,924 INFO L444 ceAbstractionStarter]: At program point L211(line 211) the Hoare annotation is: (let ((.cse3 (not (= 2 |old(~d0_ev~0)|))) (.cse0 (not (= |old(~z_ev~0)| 2))) (.cse4 (not (= |old(~b1_ev~0)| 2))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (= 2 |old(~d1_ev~0)|))) (.cse8 (not (= 2 |old(~b0_ev~0)|))) (.cse1 (not (= |old(~z_req_up~0)| 0)))) (and (or .cse0 (< 0 ~comp_m1_i~0) (let ((.cse2 (not (= 0 ~z_val_t~0)))) (and (or .cse1 .cse2) (or .cse2 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse5 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse3 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse6 (not (= ~comp_m1_i~0 0)) .cse7 .cse8 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse1 (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~d0_val~0 0) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_ev~0 0) (= ~b1_val~0 0) (= ~b0_val~0 1) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-23 06:34:07,925 INFO L448 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2018-11-23 06:34:07,925 INFO L444 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse8 (not (= 2 |old(~d0_ev~0)|))) (.cse9 (not (= |old(~b1_ev~0)| 2))) (.cse10 (not (= |old(~z_val~0)| 0))) (.cse11 (not (= 2 |old(~d1_ev~0)|))) (.cse12 (not (= 2 |old(~b0_ev~0)|))) (.cse3 (not (= 2 ~comp_m1_st~0)))) (let ((.cse0 (not (= |old(~z_ev~0)| 2))) (.cse1 (= ~z_req_up~0 1)) (.cse5 (< 0 ~comp_m1_i~0)) (.cse13 (not (= |old(~z_req_up~0)| 0))) (.cse4 (not (= 0 ~z_val_t~0))) (.cse2 (not (= |old(~z_req_up~0)| 1))) (.cse6 (let ((.cse14 (not (= 1 |old(~b1_val~0)|))) (.cse15 (not (= 1 |old(~d1_val~0)|))) (.cse16 (not (= 0 |old(~d1_req_up~0)|))) (.cse17 (not (= 0 |old(~b1_req_up~0)|))) (.cse18 (not (= 0 |old(~b0_req_up~0)|))) (.cse19 (not (= |old(~d0_req_up~0)| 0))) (.cse20 (not (= |old(~b0_val~0)| 1)))) (and (or .cse8 .cse9 .cse14 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 (not (= 0 ~comp_m1_st~0)) .cse18 .cse19 .cse20) (or .cse8 .cse9 .cse14 .cse10 .cse11 .cse12 .cse3 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) (.cse7 (not (= |old(~d0_val~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse8 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse9 .cse10 (not (= ~comp_m1_i~0 0)) .cse11 .cse12 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse13 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) (or .cse0 (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (or .cse1 (= ~z_req_up~0 0)) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~b0_ev~0 2) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~d0_ev~0 2))) .cse5 (and (or .cse13 .cse4) (or .cse4 .cse2)) .cse6 .cse7)))) [2018-11-23 06:34:07,925 INFO L448 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2018-11-23 06:34:07,925 INFO L444 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse3 (not (= 2 |old(~d0_ev~0)|))) (.cse0 (not (= |old(~z_ev~0)| 2))) (.cse4 (not (= |old(~b1_ev~0)| 2))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (= 2 |old(~d1_ev~0)|))) (.cse8 (not (= 2 |old(~b0_ev~0)|))) (.cse1 (not (= |old(~z_req_up~0)| 0)))) (and (or .cse0 (< 0 ~comp_m1_i~0) (let ((.cse2 (not (= 0 ~z_val_t~0)))) (and (or .cse1 .cse2) (or .cse2 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse5 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse3 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse6 (not (= ~comp_m1_i~0 0)) .cse7 (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~d0_val~0 0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d1_req_up~0 1) (= ~b0_ev~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) .cse8 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse1 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-23 06:34:07,925 INFO L448 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2018-11-23 06:34:07,926 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse0 (not (= 2 |old(~d0_ev~0)|))) (.cse2 (not (= |old(~b1_ev~0)| 2))) (.cse3 (not (= |old(~z_val~0)| 0))) (.cse4 (not (= 2 |old(~d1_ev~0)|))) (.cse5 (not (= 2 |old(~b0_ev~0)|))) (.cse16 (not (= 2 ~comp_m1_st~0)))) (let ((.cse1 (not (= |old(~z_ev~0)| 2))) (.cse14 (= ~z_req_up~0 1)) (.cse11 (= ~z_req_up~0 0)) (.cse13 (= ~z_ev~0 2)) (.cse7 (= ~z_val~0 0)) (.cse8 (= ~d1_ev~0 2)) (.cse9 (= ~b1_ev~0 2)) (.cse10 (= ~b0_ev~0 2)) (.cse12 (= ~d0_ev~0 2)) (.cse18 (< 0 ~comp_m1_i~0)) (.cse6 (not (= |old(~z_req_up~0)| 0))) (.cse17 (not (= 0 ~z_val_t~0))) (.cse15 (not (= |old(~z_req_up~0)| 1))) (.cse19 (let ((.cse21 (not (= 1 |old(~b1_val~0)|))) (.cse22 (not (= 1 |old(~d1_val~0)|))) (.cse23 (not (= 0 |old(~d1_req_up~0)|))) (.cse24 (not (= 0 |old(~b1_req_up~0)|))) (.cse25 (not (= 0 |old(~b0_req_up~0)|))) (.cse26 (not (= |old(~d0_req_up~0)| 0))) (.cse27 (not (= |old(~b0_val~0)| 1)))) (and (or .cse0 .cse2 .cse21 .cse3 .cse4 .cse5 .cse22 .cse23 .cse24 (not (= 0 ~comp_m1_st~0)) .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse21 .cse3 .cse4 .cse5 .cse16 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) (.cse20 (not (= |old(~d0_val~0)| 1)))) (and (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse0 .cse1 (not (= |old(~d0_req_up~0)| 1)) .cse2 .cse3 (not (= ~comp_m1_i~0 0)) .cse4 .cse5 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse6 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (and .cse7 .cse8 .cse9 (= ~d0_val~0 0) (= ~b0_val~0 0) .cse10 (= ~b1_req_up~0 1) .cse11 .cse12 (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) .cse13 (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) (or .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (or .cse14 .cse11) (= ~d1_val~0 1) (= ~d0_req_up~0 0) .cse13 (and .cse7 .cse8 .cse9 .cse10 (= ~b0_req_up~0 0) (= ~d0_val~0 1) .cse12)) .cse18 (and (or .cse6 .cse17) (or .cse17 .cse15)) .cse19 .cse20)))) [2018-11-23 06:34:07,926 INFO L444 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse1 (not (= |old(~z_ev~0)| 2))) (.cse6 (not (= |old(~z_req_up~0)| 0))) (.cse0 (not (= 2 |old(~d0_ev~0)|))) (.cse2 (not (= |old(~b1_ev~0)| 2))) (.cse3 (not (= |old(~z_val~0)| 0))) (.cse4 (not (= 2 |old(~d1_ev~0)|))) (.cse5 (not (= 2 |old(~b0_ev~0)|)))) (and (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse0 .cse1 (not (= |old(~d0_req_up~0)| 1)) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) .cse2 .cse3 (not (= ~comp_m1_i~0 0)) .cse4 .cse5 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse6 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) (or .cse1 (< 0 ~comp_m1_i~0) (let ((.cse7 (not (= 0 ~z_val_t~0)))) (and (or .cse6 .cse7) (or .cse7 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse8 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))))) [2018-11-23 06:34:07,926 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2018-11-23 06:34:07,926 INFO L448 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2018-11-23 06:34:07,926 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-11-23 06:34:07,926 INFO L448 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L444 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= 1 ~b1_val~0)) (not (= ~z_val~0 0)) (not (= 1 ~d1_val~0)) (= is_method1_triggered_~__retres1~0 1) (not (= ~z_req_up~0 0)) (not (= 0 ~d1_req_up~0)) (not (= ~b1_ev~0 1)) (not (= 0 ~b1_req_up~0)) (< 0 ~comp_m1_i~0) (not (= 1 ~d0_ev~0)) (not (= 0 ~b0_req_up~0)) (not (= 1 ~b0_ev~0)) (not (= ~d0_req_up~0 0)) (not (= ~b0_val~0 1)) (not (= ~d0_val~0 1)) (not (= 1 ~d1_ev~0))) [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L451 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~comp_m1_i~0 0) [2018-11-23 06:34:07,927 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2018-11-23 06:34:07,927 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2018-11-23 06:34:07,928 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 451 482) the Hoare annotation is: (or (< 0 |old(~comp_m1_i~0)|) (<= ~comp_m1_i~0 0)) [2018-11-23 06:34:07,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:34:07 BoogieIcfgContainer [2018-11-23 06:34:07,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:34:07,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:34:07,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:34:07,953 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:34:07,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:33:28" (3/4) ... [2018-11-23 06:34:07,957 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 06:34:07,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-23 06:34:07,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-23 06:34:07,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure method1 [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_z [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d1 [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d0 [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b1 [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b0 [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-23 06:34:07,962 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-23 06:34:07,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-23 06:34:07,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_method1_triggered [2018-11-23 06:34:07,963 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-23 06:34:07,969 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-23 06:34:07,969 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 06:34:07,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && comp_m1_st == 2) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) [2018-11-23 06:34:07,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_ev == 2) && d1_req_up == 0) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) [2018-11-23 06:34:07,995 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || ((z_val_t == 0 && comp_m1_st == 2) && z_req_up == 1)) || (z_req_up == 0 && comp_m1_st == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && (((((((((((!(z_ev == 2) || !(1 == b1_val)) || comp_m1_st == 0) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) || z_req_up == 1)) && ((((((!(z_ev == 2) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 2)) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 0)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((((!(1 == b1_val) || !(1 == d1_val)) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) && (((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)))) || !(d0_val == 1)) [2018-11-23 06:34:07,995 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(z_ev == 2) || (((z_req_up == 1 && z_val_t == 0) || (z_val_t == 0 && z_req_up == 0)) && (comp_m1_st == 0 || comp_m1_st == 2))) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && ((((((((((!(z_ev == 2) || !(1 == b1_val)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1))) && (((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) [2018-11-23 06:34:08,030 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_256fef35-7a8b-499b-ac86-dfc758c230f9/bin-2019/utaipan/witness.graphml [2018-11-23 06:34:08,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:34:08,032 INFO L168 Benchmark]: Toolchain (without parser) took 40452.47 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 948.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:08,033 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:34:08,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:08,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.09 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:34:08,033 INFO L168 Benchmark]: Boogie Preprocessor took 60.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:08,033 INFO L168 Benchmark]: RCFGBuilder took 379.61 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:08,034 INFO L168 Benchmark]: TraceAbstraction took 39726.53 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 951.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-23 06:34:08,034 INFO L168 Benchmark]: Witness Printer took 77.56 ms. Allocated memory is still 2.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:34:08,036 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.07 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 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 19.09 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 379.61 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39726.53 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 951.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 77.56 ms. Allocated memory is still 2.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_ev == 2) && d1_req_up == 0) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((!(z_ev == 2) || 0 < comp_m1_i) || ((!(z_req_up == 0) || !(0 == z_val_t)) && (!(0 == z_val_t) || !(z_req_up == 1)))) || (((((((((((((!(2 == d0_ev) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || !(0 == comp_m1_st)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) && ((((((((((((!(2 == d0_ev) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(2 == comp_m1_st)) || !(1 == d1_val)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)))) || (__retres1 == 1 && comp_m1_st == 0) || (__retres1 == 0 && comp_m1_st == 2)) || !(d0_val == 1)) && (((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || __retres1 == 1) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(z_req_up == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == comp_m1_st)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((!(z_ev == 2) || (((z_req_up == 1 && z_val_t == 0) || (z_val_t == 0 && z_req_up == 0)) && (comp_m1_st == 0 || comp_m1_st == 2))) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && ((((((((((!(z_ev == 2) || !(1 == b1_val)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1))) && (((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || ((z_val_t == 0 && comp_m1_st == 2) && z_req_up == 1)) || (z_req_up == 0 && comp_m1_st == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && (((((((((((!(z_ev == 2) || !(1 == b1_val)) || comp_m1_st == 0) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) || z_req_up == 1)) && ((((((!(z_ev == 2) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 2)) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 0)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((((!(1 == b1_val) || !(1 == d1_val)) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) && (((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)))) || !(d0_val == 1)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((!(z_ev == 2) || !(1 == b1_val)) || !(z_val == 0)) || !(1 == d1_val)) || __retres1 == 1) || !(z_req_up == 0)) || !(0 == d1_req_up)) || !(b1_ev == 1)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(1 == d0_ev)) || !(0 == b0_req_up)) || !(1 == b0_ev)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) || !(1 == d1_ev) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && comp_m1_st == 2) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 141 locations, 1 error locations. SAFE Result, 39.6s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 6.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2535 SDtfs, 1439 SDslu, 18338 SDs, 0 SdLazy, 13159 SolverSat, 531 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 24 DeclaredPredicates, 1809 GetRequests, 1514 SyntacticMatches, 0 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2882 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 12 AbstIntIterations, 12 AbstIntStrong, 0.9940991528717664 AbsIntWeakeningRatio, 0.6251422070534699 AbsIntAvgWeakeningVarsNumRemoved, 11.215585893060295 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 38 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 778 PreInvPairs, 835 NumberOfFragments, 8068 HoareAnnotationTreeSize, 778 FomulaSimplifications, 8122 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 52 FomulaSimplificationsInter, 11061 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2176 NumberOfCodeBlocks, 2176 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2161 ConstructedInterpolants, 0 QuantifiedInterpolants, 550663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 434/588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...