./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/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 aefcaabd16a50e389998bb4544e72a90e6b18c44 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/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 aefcaabd16a50e389998bb4544e72a90e6b18c44 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:37:35,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:37:35,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:37:35,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:37:35,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:37:35,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:37:35,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:37:35,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:37:35,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:37:35,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:37:35,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:37:35,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:37:35,033 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:37:35,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:37:35,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:37:35,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:37:35,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:37:35,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:37:35,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:37:35,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:37:35,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:37:35,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:37:35,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:37:35,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:37:35,046 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:37:35,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:37:35,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:37:35,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:37:35,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:37:35,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:37:35,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:37:35,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:37:35,051 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:37:35,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:37:35,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:37:35,052 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:37:35,052 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:37:35,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:37:35,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:37:35,065 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:37:35,065 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:37:35,066 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:37:35,066 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:37:35,066 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:37:35,066 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:37:35,066 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:37:35,066 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:37:35,067 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:37:35,067 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:37:35,067 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:37:35,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:37:35,068 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:37:35,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:37:35,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:37:35,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:37:35,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:37:35,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:37:35,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:37:35,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:37:35,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:37:35,071 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:37:35,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:37:35,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:37:35,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:37:35,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:37:35,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:37:35,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:37:35,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:37:35,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:37:35,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:37:35,073 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:37:35,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:37:35,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:37:35,073 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:37:35,073 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_c4bbe533-4581-4608-80c1-77056f935799/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 -> aefcaabd16a50e389998bb4544e72a90e6b18c44 [2018-11-18 15:37:35,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:37:35,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:37:35,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:37:35,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:37:35,150 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:37:35,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-18 15:37:35,209 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/3d6bcabab/cfe08cfaa6774888bd90729acfb5d911/FLAG29daafd04 [2018-11-18 15:37:35,897 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:37:35,897 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-18 15:37:35,927 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/3d6bcabab/cfe08cfaa6774888bd90729acfb5d911/FLAG29daafd04 [2018-11-18 15:37:36,022 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/3d6bcabab/cfe08cfaa6774888bd90729acfb5d911 [2018-11-18 15:37:36,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:37:36,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:37:36,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:37:36,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:37:36,035 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:37:36,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:37:36" (1/1) ... [2018-11-18 15:37:36,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e43d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:36, skipping insertion in model container [2018-11-18 15:37:36,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:37:36" (1/1) ... [2018-11-18 15:37:36,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:37:36,167 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:37:37,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:37:37,704 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:37:38,258 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:37:38,348 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:37:38,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38 WrapperNode [2018-11-18 15:37:38,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:37:38,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:37:38,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:37:38,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:37:38,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:37:38,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:37:38,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:37:38,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:37:38,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... [2018-11-18 15:37:38,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:37:38,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:37:38,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:37:38,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:37:38,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/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-18 15:37:38,692 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-18 15:37:38,692 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-18 15:37:38,692 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 15:37:38,692 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 15:37:38,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 15:37:38,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:37:38,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:37:38,695 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-18 15:37:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-18 15:37:38,695 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-18 15:37:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-18 15:37:38,695 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-18 15:37:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-18 15:37:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 15:37:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 15:37:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 15:37:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 15:37:38,697 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-18 15:37:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-18 15:37:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-18 15:37:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-18 15:37:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-18 15:37:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-18 15:37:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-18 15:37:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-18 15:37:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-11-18 15:37:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-11-18 15:37:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-18 15:37:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-18 15:37:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-18 15:37:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-18 15:37:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:37:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-11-18 15:37:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-11-18 15:37:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-18 15:37:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-18 15:37:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 15:37:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 15:37:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-18 15:37:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-18 15:37:38,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 15:37:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 15:37:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 15:37:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 15:37:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-18 15:37:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-18 15:37:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-18 15:37:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-18 15:37:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:37:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:37:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 15:37:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 15:37:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-18 15:37:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-18 15:37:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-18 15:37:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-18 15:37:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:37:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:37:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-11-18 15:37:38,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-11-18 15:37:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:37:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 15:37:38,751 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 15:37:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-18 15:37:38,751 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-18 15:37:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:37:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 15:37:38,752 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 15:37:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 15:37:38,752 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 15:37:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-11-18 15:37:38,752 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-11-18 15:37:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-18 15:37:38,752 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-18 15:37:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:37:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 15:37:38,752 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 15:37:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-11-18 15:37:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-11-18 15:37:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 15:37:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 15:37:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-11-18 15:37:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-11-18 15:37:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-11-18 15:37:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-11-18 15:37:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-18 15:37:38,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-18 15:37:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-11-18 15:37:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-11-18 15:37:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-18 15:37:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-18 15:37:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-18 15:37:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-18 15:37:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-18 15:37:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-18 15:37:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-18 15:37:38,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-18 15:37:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-18 15:37:38,755 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-18 15:37:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:37:38,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:37:39,312 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:39,312 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:39,579 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:39,579 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:40,275 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:40,276 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:40,568 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:40,568 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:40,981 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:40,982 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:40,988 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:40,988 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,165 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,165 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,177 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,177 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,183 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,183 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,240 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,240 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,250 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,250 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,273 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,274 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,691 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,691 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,729 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,729 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,738 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,739 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,745 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,746 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:41,817 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:41,817 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:45,229 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:45,229 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:45,656 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:37:45,656 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:37:45,674 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:37:45,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:37:45 BoogieIcfgContainer [2018-11-18 15:37:45,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:37:45,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:37:45,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:37:45,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:37:45,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:37:36" (1/3) ... [2018-11-18 15:37:45,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c2cef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:37:45, skipping insertion in model container [2018-11-18 15:37:45,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:37:38" (2/3) ... [2018-11-18 15:37:45,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c2cef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:37:45, skipping insertion in model container [2018-11-18 15:37:45,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:37:45" (3/3) ... [2018-11-18 15:37:45,680 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-18 15:37:45,688 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:37:45,696 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:37:45,709 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:37:45,740 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:37:45,741 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:37:45,741 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:37:45,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:37:45,741 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:37:45,741 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:37:45,741 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:37:45,741 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:37:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states. [2018-11-18 15:37:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:37:45,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:45,773 INFO L375 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] [2018-11-18 15:37:45,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:45,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -182646718, now seen corresponding path program 1 times [2018-11-18 15:37:45,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:45,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:45,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:45,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:45,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:46,166 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-18 15:37:46,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:37:46,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:46,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:37:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:37:46,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:46,184 INFO L87 Difference]: Start difference. First operand 672 states. Second operand 3 states. [2018-11-18 15:37:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:46,481 INFO L93 Difference]: Finished difference Result 1263 states and 1871 transitions. [2018-11-18 15:37:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:37:46,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 15:37:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:46,497 INFO L225 Difference]: With dead ends: 1263 [2018-11-18 15:37:46,497 INFO L226 Difference]: Without dead ends: 666 [2018-11-18 15:37:46,549 INFO L604 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-18 15:37:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-18 15:37:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2018-11-18 15:37:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-18 15:37:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 924 transitions. [2018-11-18 15:37:46,624 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 924 transitions. Word has length 31 [2018-11-18 15:37:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:46,624 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 924 transitions. [2018-11-18 15:37:46,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:37:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 924 transitions. [2018-11-18 15:37:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 15:37:46,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:46,625 INFO L375 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] [2018-11-18 15:37:46,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:46,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash -199001135, now seen corresponding path program 1 times [2018-11-18 15:37:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:46,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:46,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:46,786 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-18 15:37:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:46,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:37:46,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:46,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:37:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:37:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:46,788 INFO L87 Difference]: Start difference. First operand 666 states and 924 transitions. Second operand 3 states. [2018-11-18 15:37:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:47,019 INFO L93 Difference]: Finished difference Result 1618 states and 2267 transitions. [2018-11-18 15:37:47,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:37:47,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 15:37:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:47,026 INFO L225 Difference]: With dead ends: 1618 [2018-11-18 15:37:47,026 INFO L226 Difference]: Without dead ends: 1136 [2018-11-18 15:37:47,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2018-11-18 15:37:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1117. [2018-11-18 15:37:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-11-18 15:37:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1564 transitions. [2018-11-18 15:37:47,075 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1564 transitions. Word has length 36 [2018-11-18 15:37:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:47,075 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 1564 transitions. [2018-11-18 15:37:47,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:37:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1564 transitions. [2018-11-18 15:37:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 15:37:47,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:47,078 INFO L375 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] [2018-11-18 15:37:47,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:47,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -293176185, now seen corresponding path program 1 times [2018-11-18 15:37:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:47,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:47,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:47,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:47,262 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-18 15:37:47,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:47,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:37:47,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:47,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:37:47,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:37:47,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:47,264 INFO L87 Difference]: Start difference. First operand 1117 states and 1564 transitions. Second operand 3 states. [2018-11-18 15:37:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:47,349 INFO L93 Difference]: Finished difference Result 1855 states and 2631 transitions. [2018-11-18 15:37:47,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:37:47,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 15:37:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:47,357 INFO L225 Difference]: With dead ends: 1855 [2018-11-18 15:37:47,357 INFO L226 Difference]: Without dead ends: 1836 [2018-11-18 15:37:47,358 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-11-18 15:37:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1774. [2018-11-18 15:37:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2018-11-18 15:37:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2533 transitions. [2018-11-18 15:37:47,408 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2533 transitions. Word has length 48 [2018-11-18 15:37:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:47,409 INFO L480 AbstractCegarLoop]: Abstraction has 1774 states and 2533 transitions. [2018-11-18 15:37:47,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:37:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2533 transitions. [2018-11-18 15:37:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:37:47,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:47,411 INFO L375 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] [2018-11-18 15:37:47,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:47,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1409188059, now seen corresponding path program 1 times [2018-11-18 15:37:47,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:47,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:47,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:47,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:47,562 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-18 15:37:47,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:47,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:37:47,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:47,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:37:47,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:37:47,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:47,563 INFO L87 Difference]: Start difference. First operand 1774 states and 2533 transitions. Second operand 3 states. [2018-11-18 15:37:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:47,699 INFO L93 Difference]: Finished difference Result 1823 states and 2602 transitions. [2018-11-18 15:37:47,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:37:47,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-18 15:37:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:47,705 INFO L225 Difference]: With dead ends: 1823 [2018-11-18 15:37:47,705 INFO L226 Difference]: Without dead ends: 1819 [2018-11-18 15:37:47,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 15:37:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2018-11-18 15:37:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1811. [2018-11-18 15:37:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2018-11-18 15:37:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2584 transitions. [2018-11-18 15:37:47,751 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2584 transitions. Word has length 49 [2018-11-18 15:37:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:47,752 INFO L480 AbstractCegarLoop]: Abstraction has 1811 states and 2584 transitions. [2018-11-18 15:37:47,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:37:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2584 transitions. [2018-11-18 15:37:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:37:47,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:47,753 INFO L375 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] [2018-11-18 15:37:47,753 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:47,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:47,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2139697088, now seen corresponding path program 1 times [2018-11-18 15:37:47,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:47,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:47,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:47,894 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-18 15:37:47,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:47,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:37:47,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:47,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:37:47,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:37:47,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:47,895 INFO L87 Difference]: Start difference. First operand 1811 states and 2584 transitions. Second operand 3 states. [2018-11-18 15:37:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:50,222 INFO L93 Difference]: Finished difference Result 3180 states and 4600 transitions. [2018-11-18 15:37:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:37:50,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-18 15:37:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:50,236 INFO L225 Difference]: With dead ends: 3180 [2018-11-18 15:37:50,236 INFO L226 Difference]: Without dead ends: 3177 [2018-11-18 15:37:50,238 INFO L604 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-18 15:37:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2018-11-18 15:37:50,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2977. [2018-11-18 15:37:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2018-11-18 15:37:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4284 transitions. [2018-11-18 15:37:50,351 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4284 transitions. Word has length 49 [2018-11-18 15:37:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:50,351 INFO L480 AbstractCegarLoop]: Abstraction has 2977 states and 4284 transitions. [2018-11-18 15:37:50,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:37:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4284 transitions. [2018-11-18 15:37:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 15:37:50,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:50,353 INFO L375 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] [2018-11-18 15:37:50,353 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:50,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -622679882, now seen corresponding path program 1 times [2018-11-18 15:37:50,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:50,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:50,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:50,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:50,506 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-18 15:37:50,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:50,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:37:50,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:50,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:37:50,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:37:50,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:37:50,507 INFO L87 Difference]: Start difference. First operand 2977 states and 4284 transitions. Second operand 3 states. [2018-11-18 15:37:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:50,767 INFO L93 Difference]: Finished difference Result 3586 states and 5201 transitions. [2018-11-18 15:37:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:37:50,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 15:37:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:50,783 INFO L225 Difference]: With dead ends: 3586 [2018-11-18 15:37:50,783 INFO L226 Difference]: Without dead ends: 3581 [2018-11-18 15:37:50,786 INFO L604 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-18 15:37:50,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2018-11-18 15:37:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3509. [2018-11-18 15:37:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3509 states. [2018-11-18 15:37:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5060 transitions. [2018-11-18 15:37:50,974 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5060 transitions. Word has length 50 [2018-11-18 15:37:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:50,974 INFO L480 AbstractCegarLoop]: Abstraction has 3509 states and 5060 transitions. [2018-11-18 15:37:50,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:37:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5060 transitions. [2018-11-18 15:37:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 15:37:50,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:50,976 INFO L375 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] [2018-11-18 15:37:50,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:50,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1667908896, now seen corresponding path program 1 times [2018-11-18 15:37:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:50,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:50,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:50,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:50,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:51,188 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-18 15:37:51,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:51,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:37:51,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:51,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:37:51,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:37:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:37:51,189 INFO L87 Difference]: Start difference. First operand 3509 states and 5060 transitions. Second operand 5 states. [2018-11-18 15:37:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:37:56,776 INFO L93 Difference]: Finished difference Result 6906 states and 9960 transitions. [2018-11-18 15:37:56,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:37:56,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 15:37:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:37:56,792 INFO L225 Difference]: With dead ends: 6906 [2018-11-18 15:37:56,792 INFO L226 Difference]: Without dead ends: 3676 [2018-11-18 15:37:56,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:37:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2018-11-18 15:37:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3503. [2018-11-18 15:37:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-11-18 15:37:56,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5046 transitions. [2018-11-18 15:37:56,923 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5046 transitions. Word has length 50 [2018-11-18 15:37:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:37:56,923 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 5046 transitions. [2018-11-18 15:37:56,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:37:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5046 transitions. [2018-11-18 15:37:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 15:37:56,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:37:56,924 INFO L375 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] [2018-11-18 15:37:56,924 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:37:56,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:37:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1549189709, now seen corresponding path program 1 times [2018-11-18 15:37:56,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:37:56,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:56,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:37:56,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:37:56,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:37:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:37:57,094 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-18 15:37:57,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:37:57,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:37:57,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:37:57,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:37:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:37:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:37:57,096 INFO L87 Difference]: Start difference. First operand 3503 states and 5046 transitions. Second operand 5 states. [2018-11-18 15:38:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:01,872 INFO L93 Difference]: Finished difference Result 3587 states and 5192 transitions. [2018-11-18 15:38:01,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:38:01,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 15:38:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:01,885 INFO L225 Difference]: With dead ends: 3587 [2018-11-18 15:38:01,885 INFO L226 Difference]: Without dead ends: 3581 [2018-11-18 15:38:01,887 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:38:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2018-11-18 15:38:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3503. [2018-11-18 15:38:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-11-18 15:38:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5045 transitions. [2018-11-18 15:38:02,009 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5045 transitions. Word has length 52 [2018-11-18 15:38:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:02,010 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 5045 transitions. [2018-11-18 15:38:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5045 transitions. [2018-11-18 15:38:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 15:38:02,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:02,011 INFO L375 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] [2018-11-18 15:38:02,011 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:02,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1158787389, now seen corresponding path program 1 times [2018-11-18 15:38:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:02,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:02,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:02,184 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-18 15:38:02,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:02,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:02,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:02,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:02,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:02,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:02,185 INFO L87 Difference]: Start difference. First operand 3503 states and 5045 transitions. Second operand 5 states. [2018-11-18 15:38:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:06,827 INFO L93 Difference]: Finished difference Result 3583 states and 5186 transitions. [2018-11-18 15:38:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:38:06,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-18 15:38:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:06,837 INFO L225 Difference]: With dead ends: 3583 [2018-11-18 15:38:06,837 INFO L226 Difference]: Without dead ends: 3577 [2018-11-18 15:38:06,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:38:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2018-11-18 15:38:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3503. [2018-11-18 15:38:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-11-18 15:38:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5044 transitions. [2018-11-18 15:38:06,958 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5044 transitions. Word has length 52 [2018-11-18 15:38:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:06,959 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 5044 transitions. [2018-11-18 15:38:06,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5044 transitions. [2018-11-18 15:38:06,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:38:06,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:06,960 INFO L375 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] [2018-11-18 15:38:06,960 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:06,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1479732052, now seen corresponding path program 1 times [2018-11-18 15:38:06,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:06,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:06,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:06,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:06,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:07,126 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-18 15:38:07,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:07,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:07,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:07,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:07,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:07,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:07,128 INFO L87 Difference]: Start difference. First operand 3503 states and 5044 transitions. Second operand 5 states. [2018-11-18 15:38:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:07,245 INFO L93 Difference]: Finished difference Result 3518 states and 5060 transitions. [2018-11-18 15:38:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:38:07,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 15:38:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:07,257 INFO L225 Difference]: With dead ends: 3518 [2018-11-18 15:38:07,257 INFO L226 Difference]: Without dead ends: 3501 [2018-11-18 15:38:07,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2018-11-18 15:38:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2018-11-18 15:38:07,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3501 states. [2018-11-18 15:38:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 5040 transitions. [2018-11-18 15:38:07,344 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 5040 transitions. Word has length 53 [2018-11-18 15:38:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:07,344 INFO L480 AbstractCegarLoop]: Abstraction has 3501 states and 5040 transitions. [2018-11-18 15:38:07,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 5040 transitions. [2018-11-18 15:38:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 15:38:07,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:07,346 INFO L375 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] [2018-11-18 15:38:07,346 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:07,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1446696274, now seen corresponding path program 1 times [2018-11-18 15:38:07,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:07,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:07,478 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-18 15:38:07,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:07,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:38:07,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:07,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:38:07,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:38:07,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:38:07,480 INFO L87 Difference]: Start difference. First operand 3501 states and 5040 transitions. Second operand 3 states. [2018-11-18 15:38:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:07,698 INFO L93 Difference]: Finished difference Result 9839 states and 14358 transitions. [2018-11-18 15:38:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:38:07,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-18 15:38:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:07,718 INFO L225 Difference]: With dead ends: 9839 [2018-11-18 15:38:07,718 INFO L226 Difference]: Without dead ends: 6575 [2018-11-18 15:38:07,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-18 15:38:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2018-11-18 15:38:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6521. [2018-11-18 15:38:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6521 states. [2018-11-18 15:38:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 9503 transitions. [2018-11-18 15:38:07,870 INFO L78 Accepts]: Start accepts. Automaton has 6521 states and 9503 transitions. Word has length 55 [2018-11-18 15:38:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:07,871 INFO L480 AbstractCegarLoop]: Abstraction has 6521 states and 9503 transitions. [2018-11-18 15:38:07,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:38:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6521 states and 9503 transitions. [2018-11-18 15:38:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 15:38:07,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:07,872 INFO L375 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] [2018-11-18 15:38:07,872 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:07,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash 736994140, now seen corresponding path program 1 times [2018-11-18 15:38:07,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:07,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:07,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:07,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:07,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:07,987 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-18 15:38:07,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:07,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:07,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:07,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:07,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:07,988 INFO L87 Difference]: Start difference. First operand 6521 states and 9503 transitions. Second operand 5 states. [2018-11-18 15:38:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:08,093 INFO L93 Difference]: Finished difference Result 6536 states and 9519 transitions. [2018-11-18 15:38:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:38:08,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 15:38:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:08,110 INFO L225 Difference]: With dead ends: 6536 [2018-11-18 15:38:08,110 INFO L226 Difference]: Without dead ends: 6514 [2018-11-18 15:38:08,113 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-11-18 15:38:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6514. [2018-11-18 15:38:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6514 states. [2018-11-18 15:38:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 9494 transitions. [2018-11-18 15:38:08,255 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 9494 transitions. Word has length 54 [2018-11-18 15:38:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:08,255 INFO L480 AbstractCegarLoop]: Abstraction has 6514 states and 9494 transitions. [2018-11-18 15:38:08,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 9494 transitions. [2018-11-18 15:38:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 15:38:08,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:08,257 INFO L375 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] [2018-11-18 15:38:08,257 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:08,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash 218864070, now seen corresponding path program 1 times [2018-11-18 15:38:08,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:08,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:08,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:08,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:08,354 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-18 15:38:08,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:08,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:38:08,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:08,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:38:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:38:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:38:08,355 INFO L87 Difference]: Start difference. First operand 6514 states and 9494 transitions. Second operand 3 states. [2018-11-18 15:38:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:08,564 INFO L93 Difference]: Finished difference Result 12307 states and 18112 transitions. [2018-11-18 15:38:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:38:08,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-18 15:38:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:08,584 INFO L225 Difference]: With dead ends: 12307 [2018-11-18 15:38:08,584 INFO L226 Difference]: Without dead ends: 6726 [2018-11-18 15:38:08,597 INFO L604 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-18 15:38:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2018-11-18 15:38:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 6626. [2018-11-18 15:38:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6626 states. [2018-11-18 15:38:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 9622 transitions. [2018-11-18 15:38:08,813 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 9622 transitions. Word has length 55 [2018-11-18 15:38:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:08,813 INFO L480 AbstractCegarLoop]: Abstraction has 6626 states and 9622 transitions. [2018-11-18 15:38:08,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:38:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 9622 transitions. [2018-11-18 15:38:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 15:38:08,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:08,815 INFO L375 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-18 15:38:08,815 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:08,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:08,815 INFO L82 PathProgramCache]: Analyzing trace with hash -563220113, now seen corresponding path program 1 times [2018-11-18 15:38:08,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:08,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:08,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:08,927 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-18 15:38:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:08,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:08,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:08,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:08,928 INFO L87 Difference]: Start difference. First operand 6626 states and 9622 transitions. Second operand 5 states. [2018-11-18 15:38:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:09,043 INFO L93 Difference]: Finished difference Result 6650 states and 9664 transitions. [2018-11-18 15:38:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:38:09,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-18 15:38:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:09,061 INFO L225 Difference]: With dead ends: 6650 [2018-11-18 15:38:09,061 INFO L226 Difference]: Without dead ends: 6634 [2018-11-18 15:38:09,065 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6634 states. [2018-11-18 15:38:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6634 to 6632. [2018-11-18 15:38:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6632 states. [2018-11-18 15:38:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6632 states to 6632 states and 9640 transitions. [2018-11-18 15:38:09,284 INFO L78 Accepts]: Start accepts. Automaton has 6632 states and 9640 transitions. Word has length 58 [2018-11-18 15:38:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:09,284 INFO L480 AbstractCegarLoop]: Abstraction has 6632 states and 9640 transitions. [2018-11-18 15:38:09,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 6632 states and 9640 transitions. [2018-11-18 15:38:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 15:38:09,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:09,286 INFO L375 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, 1] [2018-11-18 15:38:09,286 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:09,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:09,286 INFO L82 PathProgramCache]: Analyzing trace with hash -344400594, now seen corresponding path program 1 times [2018-11-18 15:38:09,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:09,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:09,453 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-18 15:38:09,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:09,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:09,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:09,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:09,454 INFO L87 Difference]: Start difference. First operand 6632 states and 9640 transitions. Second operand 5 states. [2018-11-18 15:38:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:09,642 INFO L93 Difference]: Finished difference Result 6650 states and 9659 transitions. [2018-11-18 15:38:09,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:38:09,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-18 15:38:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:09,661 INFO L225 Difference]: With dead ends: 6650 [2018-11-18 15:38:09,661 INFO L226 Difference]: Without dead ends: 6630 [2018-11-18 15:38:09,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2018-11-18 15:38:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6630. [2018-11-18 15:38:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6630 states. [2018-11-18 15:38:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6630 states to 6630 states and 9636 transitions. [2018-11-18 15:38:09,871 INFO L78 Accepts]: Start accepts. Automaton has 6630 states and 9636 transitions. Word has length 59 [2018-11-18 15:38:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:09,871 INFO L480 AbstractCegarLoop]: Abstraction has 6630 states and 9636 transitions. [2018-11-18 15:38:09,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6630 states and 9636 transitions. [2018-11-18 15:38:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 15:38:09,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:09,873 INFO L375 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, 1, 1, 1] [2018-11-18 15:38:09,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:09,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1727839769, now seen corresponding path program 1 times [2018-11-18 15:38:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:09,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:09,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:09,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:09,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:10,028 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-18 15:38:10,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:10,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:10,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:10,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:10,029 INFO L87 Difference]: Start difference. First operand 6630 states and 9636 transitions. Second operand 5 states. [2018-11-18 15:38:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:10,188 INFO L93 Difference]: Finished difference Result 6645 states and 9652 transitions. [2018-11-18 15:38:10,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:38:10,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-18 15:38:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:10,204 INFO L225 Difference]: With dead ends: 6645 [2018-11-18 15:38:10,205 INFO L226 Difference]: Without dead ends: 6625 [2018-11-18 15:38:10,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2018-11-18 15:38:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6625. [2018-11-18 15:38:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6625 states. [2018-11-18 15:38:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 9629 transitions. [2018-11-18 15:38:10,470 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 9629 transitions. Word has length 61 [2018-11-18 15:38:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:10,471 INFO L480 AbstractCegarLoop]: Abstraction has 6625 states and 9629 transitions. [2018-11-18 15:38:10,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 9629 transitions. [2018-11-18 15:38:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 15:38:10,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:10,472 INFO L375 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, 1, 1, 1, 1] [2018-11-18 15:38:10,472 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:10,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash -405016589, now seen corresponding path program 1 times [2018-11-18 15:38:10,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:10,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:10,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:10,691 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-18 15:38:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:38:10,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:10,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:38:10,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:38:10,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:38:10,692 INFO L87 Difference]: Start difference. First operand 6625 states and 9629 transitions. Second operand 7 states. [2018-11-18 15:38:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:19,786 INFO L93 Difference]: Finished difference Result 11992 states and 17684 transitions. [2018-11-18 15:38:19,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:38:19,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-11-18 15:38:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:19,806 INFO L225 Difference]: With dead ends: 11992 [2018-11-18 15:38:19,806 INFO L226 Difference]: Without dead ends: 8269 [2018-11-18 15:38:19,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:38:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8269 states. [2018-11-18 15:38:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8269 to 7490. [2018-11-18 15:38:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7490 states. [2018-11-18 15:38:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7490 states to 7490 states and 10954 transitions. [2018-11-18 15:38:20,112 INFO L78 Accepts]: Start accepts. Automaton has 7490 states and 10954 transitions. Word has length 62 [2018-11-18 15:38:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:20,112 INFO L480 AbstractCegarLoop]: Abstraction has 7490 states and 10954 transitions. [2018-11-18 15:38:20,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:38:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7490 states and 10954 transitions. [2018-11-18 15:38:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 15:38:20,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:20,113 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 15:38:20,114 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:20,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 529836039, now seen corresponding path program 1 times [2018-11-18 15:38:20,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:20,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:20,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:20,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:20,258 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-18 15:38:20,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:20,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:20,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:20,260 INFO L87 Difference]: Start difference. First operand 7490 states and 10954 transitions. Second operand 5 states. [2018-11-18 15:38:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:20,578 INFO L93 Difference]: Finished difference Result 14085 states and 20860 transitions. [2018-11-18 15:38:20,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:38:20,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-18 15:38:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:20,595 INFO L225 Difference]: With dead ends: 14085 [2018-11-18 15:38:20,595 INFO L226 Difference]: Without dead ends: 7670 [2018-11-18 15:38:20,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2018-11-18 15:38:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 7616. [2018-11-18 15:38:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7616 states. [2018-11-18 15:38:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 11133 transitions. [2018-11-18 15:38:20,777 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 11133 transitions. Word has length 63 [2018-11-18 15:38:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:20,778 INFO L480 AbstractCegarLoop]: Abstraction has 7616 states and 11133 transitions. [2018-11-18 15:38:20,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 11133 transitions. [2018-11-18 15:38:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 15:38:20,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:20,779 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 15:38:20,780 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:20,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1022234862, now seen corresponding path program 1 times [2018-11-18 15:38:20,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:20,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:20,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:20,895 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-18 15:38:20,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:38:20,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:20,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:38:20,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:38:20,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:38:20,896 INFO L87 Difference]: Start difference. First operand 7616 states and 11133 transitions. Second operand 3 states. [2018-11-18 15:38:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:21,127 INFO L93 Difference]: Finished difference Result 14279 states and 21130 transitions. [2018-11-18 15:38:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:38:21,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 15:38:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:21,148 INFO L225 Difference]: With dead ends: 14279 [2018-11-18 15:38:21,148 INFO L226 Difference]: Without dead ends: 7738 [2018-11-18 15:38:21,165 INFO L604 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-18 15:38:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7738 states. [2018-11-18 15:38:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7738 to 7656. [2018-11-18 15:38:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7656 states. [2018-11-18 15:38:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7656 states to 7656 states and 11173 transitions. [2018-11-18 15:38:21,371 INFO L78 Accepts]: Start accepts. Automaton has 7656 states and 11173 transitions. Word has length 63 [2018-11-18 15:38:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:21,372 INFO L480 AbstractCegarLoop]: Abstraction has 7656 states and 11173 transitions. [2018-11-18 15:38:21,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:38:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7656 states and 11173 transitions. [2018-11-18 15:38:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:38:21,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:21,374 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-11-18 15:38:21,374 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:21,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1570650670, now seen corresponding path program 1 times [2018-11-18 15:38:21,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:21,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:21,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:21,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:21,575 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-18 15:38:21,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:21,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:38:21,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:21,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:38:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:38:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:38:21,576 INFO L87 Difference]: Start difference. First operand 7656 states and 11173 transitions. Second operand 7 states. [2018-11-18 15:38:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:29,929 INFO L93 Difference]: Finished difference Result 11471 states and 16708 transitions. [2018-11-18 15:38:29,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:38:29,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-18 15:38:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:29,943 INFO L225 Difference]: With dead ends: 11471 [2018-11-18 15:38:29,943 INFO L226 Difference]: Without dead ends: 7573 [2018-11-18 15:38:29,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:38:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2018-11-18 15:38:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 6923. [2018-11-18 15:38:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6923 states. [2018-11-18 15:38:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6923 states to 6923 states and 9966 transitions. [2018-11-18 15:38:30,133 INFO L78 Accepts]: Start accepts. Automaton has 6923 states and 9966 transitions. Word has length 64 [2018-11-18 15:38:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:30,133 INFO L480 AbstractCegarLoop]: Abstraction has 6923 states and 9966 transitions. [2018-11-18 15:38:30,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:38:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6923 states and 9966 transitions. [2018-11-18 15:38:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:38:30,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:30,135 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-11-18 15:38:30,135 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:30,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -276801234, now seen corresponding path program 1 times [2018-11-18 15:38:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:30,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:30,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:30,234 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-18 15:38:30,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:30,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:38:30,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:30,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:38:30,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:38:30,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:38:30,235 INFO L87 Difference]: Start difference. First operand 6923 states and 9966 transitions. Second operand 3 states. [2018-11-18 15:38:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:30,524 INFO L93 Difference]: Finished difference Result 9591 states and 13949 transitions. [2018-11-18 15:38:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:38:30,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-18 15:38:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:30,538 INFO L225 Difference]: With dead ends: 9591 [2018-11-18 15:38:30,538 INFO L226 Difference]: Without dead ends: 9578 [2018-11-18 15:38:30,541 INFO L604 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-18 15:38:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9578 states. [2018-11-18 15:38:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9578 to 7510. [2018-11-18 15:38:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7510 states. [2018-11-18 15:38:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7510 states to 7510 states and 10809 transitions. [2018-11-18 15:38:30,761 INFO L78 Accepts]: Start accepts. Automaton has 7510 states and 10809 transitions. Word has length 64 [2018-11-18 15:38:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:30,762 INFO L480 AbstractCegarLoop]: Abstraction has 7510 states and 10809 transitions. [2018-11-18 15:38:30,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:38:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7510 states and 10809 transitions. [2018-11-18 15:38:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:38:30,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:30,763 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:38:30,763 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:30,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 460413673, now seen corresponding path program 1 times [2018-11-18 15:38:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:30,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:30,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:30,946 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-18 15:38:30,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:38:30,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:30,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:38:30,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:38:30,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:38:30,946 INFO L87 Difference]: Start difference. First operand 7510 states and 10809 transitions. Second operand 8 states. [2018-11-18 15:38:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:43,277 INFO L93 Difference]: Finished difference Result 7534 states and 10870 transitions. [2018-11-18 15:38:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:38:43,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-18 15:38:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:43,289 INFO L225 Difference]: With dead ends: 7534 [2018-11-18 15:38:43,289 INFO L226 Difference]: Without dead ends: 7530 [2018-11-18 15:38:43,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:38:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7530 states. [2018-11-18 15:38:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7530 to 7520. [2018-11-18 15:38:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7520 states. [2018-11-18 15:38:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7520 states to 7520 states and 10834 transitions. [2018-11-18 15:38:43,486 INFO L78 Accepts]: Start accepts. Automaton has 7520 states and 10834 transitions. Word has length 65 [2018-11-18 15:38:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:43,486 INFO L480 AbstractCegarLoop]: Abstraction has 7520 states and 10834 transitions. [2018-11-18 15:38:43,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:38:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7520 states and 10834 transitions. [2018-11-18 15:38:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:38:43,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:43,488 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:38:43,488 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:43,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 460136843, now seen corresponding path program 1 times [2018-11-18 15:38:43,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:43,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:43,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:43,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:43,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:43,580 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-18 15:38:43,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:43,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:38:43,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:43,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:38:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:38:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:38:43,580 INFO L87 Difference]: Start difference. First operand 7520 states and 10834 transitions. Second operand 5 states. [2018-11-18 15:38:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:38:48,371 INFO L93 Difference]: Finished difference Result 8424 states and 12214 transitions. [2018-11-18 15:38:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:38:48,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 15:38:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:38:48,386 INFO L225 Difference]: With dead ends: 8424 [2018-11-18 15:38:48,387 INFO L226 Difference]: Without dead ends: 8410 [2018-11-18 15:38:48,391 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:38:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2018-11-18 15:38:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 7514. [2018-11-18 15:38:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7514 states. [2018-11-18 15:38:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7514 states to 7514 states and 10825 transitions. [2018-11-18 15:38:48,617 INFO L78 Accepts]: Start accepts. Automaton has 7514 states and 10825 transitions. Word has length 65 [2018-11-18 15:38:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:38:48,618 INFO L480 AbstractCegarLoop]: Abstraction has 7514 states and 10825 transitions. [2018-11-18 15:38:48,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:38:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7514 states and 10825 transitions. [2018-11-18 15:38:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:38:48,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:38:48,619 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:38:48,619 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:38:48,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:38:48,620 INFO L82 PathProgramCache]: Analyzing trace with hash 301337160, now seen corresponding path program 1 times [2018-11-18 15:38:48,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:38:48,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:48,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:38:48,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:38:48,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:38:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:38:48,791 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-18 15:38:48,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:38:48,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:38:48,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:38:48,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:38:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:38:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:38:48,792 INFO L87 Difference]: Start difference. First operand 7514 states and 10825 transitions. Second operand 8 states. [2018-11-18 15:39:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:01,048 INFO L93 Difference]: Finished difference Result 7527 states and 10839 transitions. [2018-11-18 15:39:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:39:01,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-18 15:39:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:01,059 INFO L225 Difference]: With dead ends: 7527 [2018-11-18 15:39:01,059 INFO L226 Difference]: Without dead ends: 7477 [2018-11-18 15:39:01,062 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:39:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7477 states. [2018-11-18 15:39:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7477 to 7477. [2018-11-18 15:39:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7477 states. [2018-11-18 15:39:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 10775 transitions. [2018-11-18 15:39:01,249 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 10775 transitions. Word has length 65 [2018-11-18 15:39:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:01,249 INFO L480 AbstractCegarLoop]: Abstraction has 7477 states and 10775 transitions. [2018-11-18 15:39:01,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:39:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 10775 transitions. [2018-11-18 15:39:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 15:39:01,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:01,251 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:01,251 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:01,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash -499378748, now seen corresponding path program 1 times [2018-11-18 15:39:01,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:01,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:01,354 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-18 15:39:01,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:01,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:39:01,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:01,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:39:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:39:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:39:01,355 INFO L87 Difference]: Start difference. First operand 7477 states and 10775 transitions. Second operand 3 states. [2018-11-18 15:39:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:03,561 INFO L93 Difference]: Finished difference Result 10824 states and 15645 transitions. [2018-11-18 15:39:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:39:03,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 15:39:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:03,573 INFO L225 Difference]: With dead ends: 10824 [2018-11-18 15:39:03,573 INFO L226 Difference]: Without dead ends: 7378 [2018-11-18 15:39:03,579 INFO L604 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-18 15:39:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7378 states. [2018-11-18 15:39:03,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7378 to 7315. [2018-11-18 15:39:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2018-11-18 15:39:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 10522 transitions. [2018-11-18 15:39:03,766 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 10522 transitions. Word has length 68 [2018-11-18 15:39:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:03,767 INFO L480 AbstractCegarLoop]: Abstraction has 7315 states and 10522 transitions. [2018-11-18 15:39:03,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:39:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 10522 transitions. [2018-11-18 15:39:03,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 15:39:03,768 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:03,768 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:03,768 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:03,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1706339903, now seen corresponding path program 1 times [2018-11-18 15:39:03,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:03,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:03,851 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-18 15:39:03,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:03,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:39:03,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:03,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:39:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:39:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:39:03,852 INFO L87 Difference]: Start difference. First operand 7315 states and 10522 transitions. Second operand 3 states. [2018-11-18 15:39:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:04,135 INFO L93 Difference]: Finished difference Result 13654 states and 19830 transitions. [2018-11-18 15:39:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:39:04,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 15:39:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:04,149 INFO L225 Difference]: With dead ends: 13654 [2018-11-18 15:39:04,149 INFO L226 Difference]: Without dead ends: 7365 [2018-11-18 15:39:04,156 INFO L604 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-18 15:39:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2018-11-18 15:39:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 7191. [2018-11-18 15:39:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7191 states. [2018-11-18 15:39:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 10356 transitions. [2018-11-18 15:39:04,338 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 10356 transitions. Word has length 68 [2018-11-18 15:39:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:04,338 INFO L480 AbstractCegarLoop]: Abstraction has 7191 states and 10356 transitions. [2018-11-18 15:39:04,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:39:04,338 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 10356 transitions. [2018-11-18 15:39:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 15:39:04,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:04,339 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:04,339 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:04,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1069362388, now seen corresponding path program 1 times [2018-11-18 15:39:04,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:04,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:04,422 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-18 15:39:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:39:04,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:04,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:39:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:39:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:39:04,423 INFO L87 Difference]: Start difference. First operand 7191 states and 10356 transitions. Second operand 3 states. [2018-11-18 15:39:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:04,717 INFO L93 Difference]: Finished difference Result 13478 states and 19647 transitions. [2018-11-18 15:39:04,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:39:04,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 15:39:04,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:04,732 INFO L225 Difference]: With dead ends: 13478 [2018-11-18 15:39:04,732 INFO L226 Difference]: Without dead ends: 7313 [2018-11-18 15:39:04,744 INFO L604 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-18 15:39:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-11-18 15:39:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 7207. [2018-11-18 15:39:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7207 states. [2018-11-18 15:39:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7207 states to 7207 states and 10372 transitions. [2018-11-18 15:39:04,949 INFO L78 Accepts]: Start accepts. Automaton has 7207 states and 10372 transitions. Word has length 66 [2018-11-18 15:39:04,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:04,950 INFO L480 AbstractCegarLoop]: Abstraction has 7207 states and 10372 transitions. [2018-11-18 15:39:04,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:39:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 7207 states and 10372 transitions. [2018-11-18 15:39:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:39:04,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:04,951 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:04,951 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:04,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash 310207976, now seen corresponding path program 1 times [2018-11-18 15:39:04,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:04,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:04,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:04,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:05,103 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-18 15:39:05,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:39:05,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:05,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:39:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:39:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:39:05,104 INFO L87 Difference]: Start difference. First operand 7207 states and 10372 transitions. Second operand 4 states. [2018-11-18 15:39:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:07,573 INFO L93 Difference]: Finished difference Result 9082 states and 13014 transitions. [2018-11-18 15:39:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:39:07,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-18 15:39:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:07,580 INFO L225 Difference]: With dead ends: 9082 [2018-11-18 15:39:07,581 INFO L226 Difference]: Without dead ends: 5319 [2018-11-18 15:39:07,586 INFO L604 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-18 15:39:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2018-11-18 15:39:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 4806. [2018-11-18 15:39:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2018-11-18 15:39:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 6814 transitions. [2018-11-18 15:39:07,732 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 6814 transitions. Word has length 73 [2018-11-18 15:39:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 4806 states and 6814 transitions. [2018-11-18 15:39:07,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:39:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 6814 transitions. [2018-11-18 15:39:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 15:39:07,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:07,734 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:07,734 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:07,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 51754937, now seen corresponding path program 1 times [2018-11-18 15:39:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:07,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:07,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:07,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:07,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:07,832 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-18 15:39:07,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:07,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:39:07,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:07,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:39:07,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:39:07,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:39:07,833 INFO L87 Difference]: Start difference. First operand 4806 states and 6814 transitions. Second operand 3 states. [2018-11-18 15:39:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:08,045 INFO L93 Difference]: Finished difference Result 7008 states and 9967 transitions. [2018-11-18 15:39:08,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:39:08,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-18 15:39:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:08,052 INFO L225 Difference]: With dead ends: 7008 [2018-11-18 15:39:08,052 INFO L226 Difference]: Without dead ends: 5008 [2018-11-18 15:39:08,055 INFO L604 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-18 15:39:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2018-11-18 15:39:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 4910. [2018-11-18 15:39:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2018-11-18 15:39:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6973 transitions. [2018-11-18 15:39:08,199 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6973 transitions. Word has length 70 [2018-11-18 15:39:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:08,199 INFO L480 AbstractCegarLoop]: Abstraction has 4910 states and 6973 transitions. [2018-11-18 15:39:08,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:39:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6973 transitions. [2018-11-18 15:39:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 15:39:08,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:08,200 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:08,200 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:08,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1214266384, now seen corresponding path program 1 times [2018-11-18 15:39:08,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:08,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:08,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:08,267 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-18 15:39:08,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:08,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:39:08,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:08,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:39:08,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:39:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:39:08,268 INFO L87 Difference]: Start difference. First operand 4910 states and 6973 transitions. Second operand 3 states. [2018-11-18 15:39:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:08,456 INFO L93 Difference]: Finished difference Result 7004 states and 9939 transitions. [2018-11-18 15:39:08,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:39:08,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-18 15:39:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:08,463 INFO L225 Difference]: With dead ends: 7004 [2018-11-18 15:39:08,463 INFO L226 Difference]: Without dead ends: 4954 [2018-11-18 15:39:08,466 INFO L604 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-18 15:39:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2018-11-18 15:39:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4854. [2018-11-18 15:39:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2018-11-18 15:39:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 6909 transitions. [2018-11-18 15:39:08,605 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 6909 transitions. Word has length 71 [2018-11-18 15:39:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:08,605 INFO L480 AbstractCegarLoop]: Abstraction has 4854 states and 6909 transitions. [2018-11-18 15:39:08,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:39:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 6909 transitions. [2018-11-18 15:39:08,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 15:39:08,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:08,606 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:08,606 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:08,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:08,607 INFO L82 PathProgramCache]: Analyzing trace with hash -693203350, now seen corresponding path program 1 times [2018-11-18 15:39:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:08,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:08,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:08,714 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-18 15:39:08,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:08,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:39:08,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:08,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:39:08,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:39:08,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:39:08,714 INFO L87 Difference]: Start difference. First operand 4854 states and 6909 transitions. Second operand 8 states. [2018-11-18 15:39:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:21,030 INFO L93 Difference]: Finished difference Result 4870 states and 6926 transitions. [2018-11-18 15:39:21,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:39:21,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-18 15:39:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:21,037 INFO L225 Difference]: With dead ends: 4870 [2018-11-18 15:39:21,038 INFO L226 Difference]: Without dead ends: 4850 [2018-11-18 15:39:21,039 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:39:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2018-11-18 15:39:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2018-11-18 15:39:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2018-11-18 15:39:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 6903 transitions. [2018-11-18 15:39:21,209 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 6903 transitions. Word has length 71 [2018-11-18 15:39:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:21,209 INFO L480 AbstractCegarLoop]: Abstraction has 4850 states and 6903 transitions. [2018-11-18 15:39:21,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:39:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 6903 transitions. [2018-11-18 15:39:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:39:21,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:21,210 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:21,210 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:21,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash -396799950, now seen corresponding path program 1 times [2018-11-18 15:39:21,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:21,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:21,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:21,354 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-18 15:39:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:21,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:39:21,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:21,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:39:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:39:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:39:21,355 INFO L87 Difference]: Start difference. First operand 4850 states and 6903 transitions. Second operand 6 states. [2018-11-18 15:39:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:21,604 INFO L93 Difference]: Finished difference Result 9173 states and 13152 transitions. [2018-11-18 15:39:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:39:21,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-18 15:39:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:21,611 INFO L225 Difference]: With dead ends: 9173 [2018-11-18 15:39:21,611 INFO L226 Difference]: Without dead ends: 4890 [2018-11-18 15:39:21,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:39:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2018-11-18 15:39:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4858. [2018-11-18 15:39:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4858 states. [2018-11-18 15:39:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 6911 transitions. [2018-11-18 15:39:21,788 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 6911 transitions. Word has length 72 [2018-11-18 15:39:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:21,788 INFO L480 AbstractCegarLoop]: Abstraction has 4858 states and 6911 transitions. [2018-11-18 15:39:21,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:39:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 6911 transitions. [2018-11-18 15:39:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:39:21,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:21,790 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:21,790 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:21,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1917394937, now seen corresponding path program 1 times [2018-11-18 15:39:21,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:21,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:21,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:21,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:21,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:21,935 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-18 15:39:21,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:21,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:39:21,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:21,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:39:21,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:39:21,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:39:21,936 INFO L87 Difference]: Start difference. First operand 4858 states and 6911 transitions. Second operand 5 states. [2018-11-18 15:39:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:22,163 INFO L93 Difference]: Finished difference Result 9256 states and 13315 transitions. [2018-11-18 15:39:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:39:22,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 15:39:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:22,171 INFO L225 Difference]: With dead ends: 9256 [2018-11-18 15:39:22,171 INFO L226 Difference]: Without dead ends: 4978 [2018-11-18 15:39:22,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:39:22,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2018-11-18 15:39:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4866. [2018-11-18 15:39:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4866 states. [2018-11-18 15:39:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4866 states to 4866 states and 6919 transitions. [2018-11-18 15:39:22,323 INFO L78 Accepts]: Start accepts. Automaton has 4866 states and 6919 transitions. Word has length 73 [2018-11-18 15:39:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:22,324 INFO L480 AbstractCegarLoop]: Abstraction has 4866 states and 6919 transitions. [2018-11-18 15:39:22,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:39:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4866 states and 6919 transitions. [2018-11-18 15:39:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 15:39:22,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:22,325 INFO L375 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, 1, 1, 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-18 15:39:22,325 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:22,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:22,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1847149966, now seen corresponding path program 1 times [2018-11-18 15:39:22,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:22,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:22,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:22,411 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-18 15:39:22,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:22,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:39:22,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:22,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:39:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:39:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:39:22,412 INFO L87 Difference]: Start difference. First operand 4866 states and 6919 transitions. Second operand 3 states. [2018-11-18 15:39:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:22,598 INFO L93 Difference]: Finished difference Result 8181 states and 11655 transitions. [2018-11-18 15:39:22,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:39:22,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-11-18 15:39:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:22,606 INFO L225 Difference]: With dead ends: 8181 [2018-11-18 15:39:22,606 INFO L226 Difference]: Without dead ends: 4837 [2018-11-18 15:39:22,611 INFO L604 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-18 15:39:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2018-11-18 15:39:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4835. [2018-11-18 15:39:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4835 states. [2018-11-18 15:39:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 6866 transitions. [2018-11-18 15:39:22,753 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 6866 transitions. Word has length 84 [2018-11-18 15:39:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:22,753 INFO L480 AbstractCegarLoop]: Abstraction has 4835 states and 6866 transitions. [2018-11-18 15:39:22,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:39:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 6866 transitions. [2018-11-18 15:39:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 15:39:22,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:22,754 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:22,754 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:22,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1844953435, now seen corresponding path program 1 times [2018-11-18 15:39:22,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:22,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:22,894 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-18 15:39:22,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:22,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:39:22,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:22,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:39:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:39:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:39:22,896 INFO L87 Difference]: Start difference. First operand 4835 states and 6866 transitions. Second operand 6 states. [2018-11-18 15:39:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:23,085 INFO L93 Difference]: Finished difference Result 4866 states and 6908 transitions. [2018-11-18 15:39:23,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:39:23,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-18 15:39:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:23,092 INFO L225 Difference]: With dead ends: 4866 [2018-11-18 15:39:23,092 INFO L226 Difference]: Without dead ends: 4842 [2018-11-18 15:39:23,094 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:39:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2018-11-18 15:39:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 4840. [2018-11-18 15:39:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4840 states. [2018-11-18 15:39:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4840 states to 4840 states and 6875 transitions. [2018-11-18 15:39:23,236 INFO L78 Accepts]: Start accepts. Automaton has 4840 states and 6875 transitions. Word has length 74 [2018-11-18 15:39:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:23,236 INFO L480 AbstractCegarLoop]: Abstraction has 4840 states and 6875 transitions. [2018-11-18 15:39:23,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:39:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4840 states and 6875 transitions. [2018-11-18 15:39:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 15:39:23,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:23,237 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:23,238 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:23,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash 121385763, now seen corresponding path program 1 times [2018-11-18 15:39:23,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:23,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:23,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:23,402 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-18 15:39:23,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:23,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:39:23,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:23,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:39:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:39:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:39:23,403 INFO L87 Difference]: Start difference. First operand 4840 states and 6875 transitions. Second operand 5 states. [2018-11-18 15:39:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:23,565 INFO L93 Difference]: Finished difference Result 9231 states and 13275 transitions. [2018-11-18 15:39:23,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:39:23,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-18 15:39:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:23,572 INFO L225 Difference]: With dead ends: 9231 [2018-11-18 15:39:23,572 INFO L226 Difference]: Without dead ends: 4924 [2018-11-18 15:39:23,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:39:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2018-11-18 15:39:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4896. [2018-11-18 15:39:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2018-11-18 15:39:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6931 transitions. [2018-11-18 15:39:23,724 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6931 transitions. Word has length 76 [2018-11-18 15:39:23,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:23,724 INFO L480 AbstractCegarLoop]: Abstraction has 4896 states and 6931 transitions. [2018-11-18 15:39:23,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:39:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6931 transitions. [2018-11-18 15:39:23,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 15:39:23,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:23,725 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:23,726 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:23,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:23,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1893783966, now seen corresponding path program 1 times [2018-11-18 15:39:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:23,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:23,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:23,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:23,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:23,847 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-18 15:39:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:39:23,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:23,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:39:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:39:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:39:23,848 INFO L87 Difference]: Start difference. First operand 4896 states and 6931 transitions. Second operand 5 states. [2018-11-18 15:39:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:24,006 INFO L93 Difference]: Finished difference Result 9770 states and 13837 transitions. [2018-11-18 15:39:24,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:39:24,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-18 15:39:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:24,014 INFO L225 Difference]: With dead ends: 9770 [2018-11-18 15:39:24,014 INFO L226 Difference]: Without dead ends: 4896 [2018-11-18 15:39:24,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:39:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4896 states. [2018-11-18 15:39:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4896 to 4896. [2018-11-18 15:39:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4896 states. [2018-11-18 15:39:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4896 states to 4896 states and 6930 transitions. [2018-11-18 15:39:24,165 INFO L78 Accepts]: Start accepts. Automaton has 4896 states and 6930 transitions. Word has length 76 [2018-11-18 15:39:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:24,165 INFO L480 AbstractCegarLoop]: Abstraction has 4896 states and 6930 transitions. [2018-11-18 15:39:24,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:39:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4896 states and 6930 transitions. [2018-11-18 15:39:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:39:24,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:24,167 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:24,167 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:24,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash 459031563, now seen corresponding path program 1 times [2018-11-18 15:39:24,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:24,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:24,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:24,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:24,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:24,284 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-18 15:39:24,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:24,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:39:24,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:24,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:39:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:39:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:39:24,285 INFO L87 Difference]: Start difference. First operand 4896 states and 6930 transitions. Second operand 6 states. [2018-11-18 15:39:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:24,537 INFO L93 Difference]: Finished difference Result 9329 states and 13318 transitions. [2018-11-18 15:39:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:39:24,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 15:39:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:24,547 INFO L225 Difference]: With dead ends: 9329 [2018-11-18 15:39:24,547 INFO L226 Difference]: Without dead ends: 4985 [2018-11-18 15:39:24,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:39:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2018-11-18 15:39:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4919. [2018-11-18 15:39:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4919 states. [2018-11-18 15:39:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 6946 transitions. [2018-11-18 15:39:24,717 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 6946 transitions. Word has length 80 [2018-11-18 15:39:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:24,717 INFO L480 AbstractCegarLoop]: Abstraction has 4919 states and 6946 transitions. [2018-11-18 15:39:24,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:39:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 6946 transitions. [2018-11-18 15:39:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 15:39:24,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:24,719 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:39:24,719 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:24,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:24,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1698672270, now seen corresponding path program 1 times [2018-11-18 15:39:24,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:24,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:39:24,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:24,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:39:24,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:24,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:39:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:39:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:39:24,830 INFO L87 Difference]: Start difference. First operand 4919 states and 6946 transitions. Second operand 8 states. [2018-11-18 15:39:24,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:24,991 INFO L93 Difference]: Finished difference Result 4940 states and 6979 transitions. [2018-11-18 15:39:24,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:39:24,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-18 15:39:24,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:24,997 INFO L225 Difference]: With dead ends: 4940 [2018-11-18 15:39:24,997 INFO L226 Difference]: Without dead ends: 4924 [2018-11-18 15:39:24,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:39:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4924 states. [2018-11-18 15:39:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4924 to 4916. [2018-11-18 15:39:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4916 states. [2018-11-18 15:39:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 6941 transitions. [2018-11-18 15:39:25,173 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 6941 transitions. Word has length 82 [2018-11-18 15:39:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:25,173 INFO L480 AbstractCegarLoop]: Abstraction has 4916 states and 6941 transitions. [2018-11-18 15:39:25,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:39:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 6941 transitions. [2018-11-18 15:39:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 15:39:25,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:25,174 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:25,174 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:25,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash -753281265, now seen corresponding path program 1 times [2018-11-18 15:39:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:25,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:25,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:25,287 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-18 15:39:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:39:25,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:25,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:39:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:39:25,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:39:25,288 INFO L87 Difference]: Start difference. First operand 4916 states and 6941 transitions. Second operand 9 states. [2018-11-18 15:39:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:39,579 INFO L93 Difference]: Finished difference Result 4935 states and 6962 transitions. [2018-11-18 15:39:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:39:39,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-18 15:39:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:39,586 INFO L225 Difference]: With dead ends: 4935 [2018-11-18 15:39:39,586 INFO L226 Difference]: Without dead ends: 4911 [2018-11-18 15:39:39,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:39:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2018-11-18 15:39:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4911. [2018-11-18 15:39:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4911 states. [2018-11-18 15:39:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4911 states to 4911 states and 6934 transitions. [2018-11-18 15:39:39,727 INFO L78 Accepts]: Start accepts. Automaton has 4911 states and 6934 transitions. Word has length 79 [2018-11-18 15:39:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:39,727 INFO L480 AbstractCegarLoop]: Abstraction has 4911 states and 6934 transitions. [2018-11-18 15:39:39,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:39:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4911 states and 6934 transitions. [2018-11-18 15:39:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 15:39:39,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:39,729 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:39,729 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:39,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash -977472617, now seen corresponding path program 1 times [2018-11-18 15:39:39,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:39,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:39,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:39,843 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-18 15:39:39,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:39,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:39:39,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:39,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:39:39,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:39:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:39:39,844 INFO L87 Difference]: Start difference. First operand 4911 states and 6934 transitions. Second operand 9 states. [2018-11-18 15:39:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:54,127 INFO L93 Difference]: Finished difference Result 4930 states and 6955 transitions. [2018-11-18 15:39:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:39:54,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-18 15:39:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:54,134 INFO L225 Difference]: With dead ends: 4930 [2018-11-18 15:39:54,134 INFO L226 Difference]: Without dead ends: 4907 [2018-11-18 15:39:54,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:39:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4907 states. [2018-11-18 15:39:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4907 to 4907. [2018-11-18 15:39:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4907 states. [2018-11-18 15:39:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4907 states to 4907 states and 6928 transitions. [2018-11-18 15:39:54,274 INFO L78 Accepts]: Start accepts. Automaton has 4907 states and 6928 transitions. Word has length 79 [2018-11-18 15:39:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:54,274 INFO L480 AbstractCegarLoop]: Abstraction has 4907 states and 6928 transitions. [2018-11-18 15:39:54,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:39:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4907 states and 6928 transitions. [2018-11-18 15:39:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:39:54,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:54,276 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:39:54,276 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:54,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:54,276 INFO L82 PathProgramCache]: Analyzing trace with hash 488750892, now seen corresponding path program 1 times [2018-11-18 15:39:54,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:54,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:54,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:54,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:54,388 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-18 15:39:54,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:39:54,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:39:54,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:39:54,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:39:54,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:39:54,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:39:54,389 INFO L87 Difference]: Start difference. First operand 4907 states and 6928 transitions. Second operand 9 states. [2018-11-18 15:40:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:08,674 INFO L93 Difference]: Finished difference Result 4926 states and 6949 transitions. [2018-11-18 15:40:08,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:40:08,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-18 15:40:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:08,681 INFO L225 Difference]: With dead ends: 4926 [2018-11-18 15:40:08,681 INFO L226 Difference]: Without dead ends: 4903 [2018-11-18 15:40:08,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:40:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4903 states. [2018-11-18 15:40:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4903 to 4903. [2018-11-18 15:40:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4903 states. [2018-11-18 15:40:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4903 states to 4903 states and 6922 transitions. [2018-11-18 15:40:08,822 INFO L78 Accepts]: Start accepts. Automaton has 4903 states and 6922 transitions. Word has length 80 [2018-11-18 15:40:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:08,822 INFO L480 AbstractCegarLoop]: Abstraction has 4903 states and 6922 transitions. [2018-11-18 15:40:08,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:40:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4903 states and 6922 transitions. [2018-11-18 15:40:08,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 15:40:08,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:08,824 INFO L375 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, 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-18 15:40:08,824 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:08,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 915009297, now seen corresponding path program 1 times [2018-11-18 15:40:08,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:08,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:08,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:08,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:08,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:08,940 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-18 15:40:08,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:08,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:40:08,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:40:08,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:40:08,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:40:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:40:08,942 INFO L87 Difference]: Start difference. First operand 4903 states and 6922 transitions. Second operand 8 states. [2018-11-18 15:40:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:21,211 INFO L93 Difference]: Finished difference Result 4922 states and 6953 transitions. [2018-11-18 15:40:21,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:40:21,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-11-18 15:40:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:21,218 INFO L225 Difference]: With dead ends: 4922 [2018-11-18 15:40:21,218 INFO L226 Difference]: Without dead ends: 4908 [2018-11-18 15:40:21,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:40:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2018-11-18 15:40:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 4900. [2018-11-18 15:40:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4900 states. [2018-11-18 15:40:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4900 states to 4900 states and 6917 transitions. [2018-11-18 15:40:21,358 INFO L78 Accepts]: Start accepts. Automaton has 4900 states and 6917 transitions. Word has length 81 [2018-11-18 15:40:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:21,359 INFO L480 AbstractCegarLoop]: Abstraction has 4900 states and 6917 transitions. [2018-11-18 15:40:21,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:40:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4900 states and 6917 transitions. [2018-11-18 15:40:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:40:21,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:21,360 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:40:21,360 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:21,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1528872222, now seen corresponding path program 1 times [2018-11-18 15:40:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:21,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:21,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:21,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:21,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:21,455 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-18 15:40:21,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:21,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:40:21,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:40:21,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:40:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:40:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:40:21,456 INFO L87 Difference]: Start difference. First operand 4900 states and 6917 transitions. Second operand 6 states. [2018-11-18 15:40:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:21,651 INFO L93 Difference]: Finished difference Result 8329 states and 11798 transitions. [2018-11-18 15:40:21,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:40:21,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-18 15:40:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:21,658 INFO L225 Difference]: With dead ends: 8329 [2018-11-18 15:40:21,659 INFO L226 Difference]: Without dead ends: 4954 [2018-11-18 15:40:21,663 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:40:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2018-11-18 15:40:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4917. [2018-11-18 15:40:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4917 states. [2018-11-18 15:40:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4917 states to 4917 states and 6943 transitions. [2018-11-18 15:40:21,803 INFO L78 Accepts]: Start accepts. Automaton has 4917 states and 6943 transitions. Word has length 93 [2018-11-18 15:40:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:21,803 INFO L480 AbstractCegarLoop]: Abstraction has 4917 states and 6943 transitions. [2018-11-18 15:40:21,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:40:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4917 states and 6943 transitions. [2018-11-18 15:40:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 15:40:21,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:21,804 INFO L375 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, 1, 1, 1, 1, 1, 1, 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-18 15:40:21,804 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:21,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:21,804 INFO L82 PathProgramCache]: Analyzing trace with hash 842380742, now seen corresponding path program 1 times [2018-11-18 15:40:21,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:21,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:21,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:21,909 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-18 15:40:21,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:21,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:40:21,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:40:21,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:40:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:40:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:40:21,910 INFO L87 Difference]: Start difference. First operand 4917 states and 6943 transitions. Second operand 6 states. [2018-11-18 15:40:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:22,158 INFO L93 Difference]: Finished difference Result 8325 states and 11772 transitions. [2018-11-18 15:40:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:40:22,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-11-18 15:40:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:22,166 INFO L225 Difference]: With dead ends: 8325 [2018-11-18 15:40:22,166 INFO L226 Difference]: Without dead ends: 4958 [2018-11-18 15:40:22,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:40:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2018-11-18 15:40:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4921. [2018-11-18 15:40:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2018-11-18 15:40:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 6947 transitions. [2018-11-18 15:40:22,312 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 6947 transitions. Word has length 88 [2018-11-18 15:40:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:22,313 INFO L480 AbstractCegarLoop]: Abstraction has 4921 states and 6947 transitions. [2018-11-18 15:40:22,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:40:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 6947 transitions. [2018-11-18 15:40:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-18 15:40:22,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:22,314 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:40:22,314 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:22,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -951599979, now seen corresponding path program 1 times [2018-11-18 15:40:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:22,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:22,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:22,416 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-18 15:40:22,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:22,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:40:22,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:40:22,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:40:22,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:40:22,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:40:22,417 INFO L87 Difference]: Start difference. First operand 4921 states and 6947 transitions. Second operand 5 states. [2018-11-18 15:40:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:27,394 INFO L93 Difference]: Finished difference Result 10629 states and 15105 transitions. [2018-11-18 15:40:27,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:40:27,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-11-18 15:40:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:27,407 INFO L225 Difference]: With dead ends: 10629 [2018-11-18 15:40:27,407 INFO L226 Difference]: Without dead ends: 7252 [2018-11-18 15:40:27,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:40:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7252 states. [2018-11-18 15:40:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 6084. [2018-11-18 15:40:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6084 states. [2018-11-18 15:40:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6084 states to 6084 states and 8641 transitions. [2018-11-18 15:40:27,608 INFO L78 Accepts]: Start accepts. Automaton has 6084 states and 8641 transitions. Word has length 94 [2018-11-18 15:40:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:27,608 INFO L480 AbstractCegarLoop]: Abstraction has 6084 states and 8641 transitions. [2018-11-18 15:40:27,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:40:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6084 states and 8641 transitions. [2018-11-18 15:40:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-18 15:40:27,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:27,610 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:40:27,610 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:27,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1144205711, now seen corresponding path program 1 times [2018-11-18 15:40:27,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:27,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:27,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:27,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:27,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:40:27,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:40:27,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:40:27,719 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-11-18 15:40:27,721 INFO L202 CegarAbsIntRunner]: [2], [3], [4], [8], [14], [17], [20], [22], [24], [26], [29], [35], [38], [85], [90], [91], [96], [98], [104], [109], [114], [119], [124], [129], [134], [137], [264], [270], [318], [321], [324], [327], [335], [340], [345], [350], [353], [649], [650], [651], [653], [657], [660], [664], [667], [671], [672], [673], [967], [968], [1089], [1092], [1097], [1106], [1107], [1619], [1620], [1672], [1673], [1738], [1739], [1740], [1741], [1742], [1743], [1792], [1793], [1794], [1808], [1809], [1810], [1811], [1812], [1813], [1820], [1860], [1861], [1974], [1975], [1976] [2018-11-18 15:40:27,761 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:40:27,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:40:27,849 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 15:40:27,856 INFO L168 Benchmark]: Toolchain (without parser) took 171830.13 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 951.0 MB in the beginning and 1.8 GB in the end (delta: -810.3 MB). Peak memory consumption was 503.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:27,857 INFO L168 Benchmark]: CDTParser took 0.42 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-18 15:40:27,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2321.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.0 MB in the beginning and 913.5 MB in the end (delta: 37.5 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:27,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.46 ms. Allocated memory is still 1.2 GB. Free memory was 913.5 MB in the beginning and 906.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:27,858 INFO L168 Benchmark]: Boogie Preprocessor took 178.90 ms. Allocated memory is still 1.2 GB. Free memory was 906.3 MB in the beginning and 868.1 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:27,858 INFO L168 Benchmark]: RCFGBuilder took 7040.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 864.6 MB in the beginning and 933.1 MB in the end (delta: -68.5 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:27,859 INFO L168 Benchmark]: TraceAbstraction took 162180.43 ms. Allocated memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: 934.8 MB). Free memory was 933.1 MB in the beginning and 1.8 GB in the end (delta: -828.2 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:40:27,861 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.42 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 2321.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.0 MB in the beginning and 913.5 MB in the end (delta: 37.5 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.46 ms. Allocated memory is still 1.2 GB. Free memory was 913.5 MB in the beginning and 906.3 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 178.90 ms. Allocated memory is still 1.2 GB. Free memory was 906.3 MB in the beginning and 868.1 MB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7040.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 864.6 MB in the beginning and 933.1 MB in the end (delta: -68.5 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 162180.43 ms. Allocated memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: 934.8 MB). Free memory was 933.1 MB in the beginning and 1.8 GB in the end (delta: -828.2 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 15:40:29,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:40:29,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:40:29,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:40:29,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:40:29,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:40:29,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:40:29,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:40:29,286 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:40:29,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:40:29,287 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:40:29,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:40:29,288 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:40:29,289 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:40:29,290 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:40:29,291 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:40:29,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:40:29,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:40:29,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:40:29,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:40:29,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:40:29,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:40:29,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:40:29,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:40:29,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:40:29,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:40:29,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:40:29,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:40:29,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:40:29,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:40:29,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:40:29,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:40:29,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:40:29,304 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:40:29,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:40:29,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:40:29,306 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 15:40:29,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:40:29,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:40:29,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:40:29,318 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:40:29,318 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:40:29,318 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:40:29,318 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:40:29,318 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:40:29,319 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:40:29,319 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:40:29,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:40:29,319 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 15:40:29,320 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 15:40:29,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:40:29,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:40:29,322 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:40:29,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:40:29,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:40:29,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:40:29,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:40:29,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:40:29,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:40:29,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:40:29,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:40:29,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:40:29,324 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 15:40:29,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:40:29,324 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 15:40:29,324 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 15:40:29,324 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_c4bbe533-4581-4608-80c1-77056f935799/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 -> aefcaabd16a50e389998bb4544e72a90e6b18c44 [2018-11-18 15:40:29,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:40:29,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:40:29,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:40:29,369 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:40:29,369 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:40:29,370 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-18 15:40:29,411 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/80d6793a0/73da5f64d2e34bbf9f9112e6eb87be84/FLAG972f4fe9e [2018-11-18 15:40:29,963 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:40:29,963 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-18 15:40:29,989 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/80d6793a0/73da5f64d2e34bbf9f9112e6eb87be84/FLAG972f4fe9e [2018-11-18 15:40:30,440 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/data/80d6793a0/73da5f64d2e34bbf9f9112e6eb87be84 [2018-11-18 15:40:30,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:40:30,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:40:30,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:40:30,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:40:30,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:40:30,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dbdf1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:30, skipping insertion in model container [2018-11-18 15:40:30,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:40:30" (1/1) ... [2018-11-18 15:40:30,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:40:30,523 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:40:31,654 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:40:31,693 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:40:32,035 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:40:32,108 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:40:32,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32 WrapperNode [2018-11-18 15:40:32,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:40:32,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:40:32,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:40:32,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:40:32,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:40:32,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:40:32,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:40:32,185 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:40:32,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... [2018-11-18 15:40:32,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:40:32,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:40:32,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:40:32,365 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:40:32,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/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-18 15:40:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-18 15:40:32,414 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-18 15:40:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 15:40:32,414 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 15:40:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 15:40:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-18 15:40:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:40:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 15:40:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2018-11-18 15:40:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-18 15:40:32,416 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-18 15:40:32,416 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-18 15:40:32,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-18 15:40:32,416 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-18 15:40:32,416 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-18 15:40:32,416 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 15:40:32,416 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 15:40:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-18 15:40:32,417 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-18 15:40:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-18 15:40:32,417 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-18 15:40:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-18 15:40:32,417 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-18 15:40:32,417 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-18 15:40:32,417 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-18 15:40:32,418 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-18 15:40:32,418 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-18 15:40:32,418 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-11-18 15:40:32,418 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-11-18 15:40:32,418 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-18 15:40:32,420 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-18 15:40:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-18 15:40:32,420 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-18 15:40:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-11-18 15:40:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-11-18 15:40:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-18 15:40:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-18 15:40:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 15:40:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 15:40:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 15:40:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2018-11-18 15:40:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-18 15:40:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-18 15:40:32,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 15:40:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2018-11-18 15:40:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 15:40:32,422 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 15:40:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 15:40:32,422 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 15:40:32,422 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-18 15:40:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-18 15:40:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-18 15:40:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-18 15:40:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:40:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:40:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-18 15:40:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-18 15:40:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-18 15:40:32,424 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-18 15:40:32,424 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-18 15:40:32,425 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-18 15:40:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:40:32,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:40:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-11-18 15:40:32,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-11-18 15:40:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:40:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 15:40:32,425 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 15:40:32,425 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-18 15:40:32,426 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-18 15:40:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:40:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 15:40:32,426 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 15:40:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 15:40:32,426 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 15:40:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-11-18 15:40:32,426 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-11-18 15:40:32,426 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-18 15:40:32,426 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 15:40:32,427 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-11-18 15:40:32,427 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-11-18 15:40:32,427 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 15:40:32,427 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 15:40:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-11-18 15:40:32,428 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-11-18 15:40:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-11-18 15:40:32,428 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-11-18 15:40:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-18 15:40:32,428 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-18 15:40:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-11-18 15:40:32,428 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-11-18 15:40:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-18 15:40:32,428 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-18 15:40:32,428 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-18 15:40:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-18 15:40:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-18 15:40:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-18 15:40:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-18 15:40:32,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-18 15:40:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-18 15:40:32,433 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-18 15:40:32,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:40:32,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:40:33,096 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:33,096 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:34,326 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:34,327 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:39,430 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:39,430 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:39,553 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:39,553 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:43,796 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:43,796 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:43,821 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:43,821 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:46,274 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:46,274 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:46,284 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:46,284 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:46,289 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:46,290 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:47,215 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:47,215 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:47,226 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:47,226 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:47,254 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:47,254 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:49,384 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:49,384 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:49,430 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:49,430 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:49,450 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:49,450 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:49,462 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:49,463 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:50,274 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:50,274 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:40:58,288 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:40:58,288 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:41:00,360 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:41:00,360 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:41:00,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:41:00,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:41:00 BoogieIcfgContainer [2018-11-18 15:41:00,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:41:00,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:41:00,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:41:00,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:41:00,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:40:30" (1/3) ... [2018-11-18 15:41:00,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31126124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:41:00, skipping insertion in model container [2018-11-18 15:41:00,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:40:32" (2/3) ... [2018-11-18 15:41:00,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31126124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:41:00, skipping insertion in model container [2018-11-18 15:41:00,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:41:00" (3/3) ... [2018-11-18 15:41:00,389 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-18 15:41:00,399 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:41:00,406 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:41:00,419 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:41:00,447 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:41:00,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:41:00,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:41:00,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:41:00,448 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:41:00,448 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:41:00,448 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:41:00,448 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:41:00,448 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:41:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states. [2018-11-18 15:41:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:41:00,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:00,472 INFO L375 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] [2018-11-18 15:41:00,474 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:00,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:00,477 INFO L82 PathProgramCache]: Analyzing trace with hash -182646718, now seen corresponding path program 1 times [2018-11-18 15:41:00,482 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:00,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:00,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:00,806 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-18 15:41:00,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:00,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:00,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:00,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:00,828 INFO L87 Difference]: Start difference. First operand 672 states. Second operand 3 states. [2018-11-18 15:41:01,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:01,144 INFO L93 Difference]: Finished difference Result 1263 states and 1871 transitions. [2018-11-18 15:41:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:01,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 15:41:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:01,161 INFO L225 Difference]: With dead ends: 1263 [2018-11-18 15:41:01,161 INFO L226 Difference]: Without dead ends: 666 [2018-11-18 15:41:01,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-18 15:41:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-18 15:41:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2018-11-18 15:41:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-18 15:41:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 924 transitions. [2018-11-18 15:41:01,241 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 924 transitions. Word has length 31 [2018-11-18 15:41:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:01,241 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 924 transitions. [2018-11-18 15:41:01,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 924 transitions. [2018-11-18 15:41:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 15:41:01,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:01,243 INFO L375 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] [2018-11-18 15:41:01,243 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:01,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:01,244 INFO L82 PathProgramCache]: Analyzing trace with hash -199001135, now seen corresponding path program 1 times [2018-11-18 15:41:01,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:01,245 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:01,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:01,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:01,487 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-18 15:41:01,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:01,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:01,494 INFO L87 Difference]: Start difference. First operand 666 states and 924 transitions. Second operand 3 states. [2018-11-18 15:41:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:01,912 INFO L93 Difference]: Finished difference Result 1618 states and 2267 transitions. [2018-11-18 15:41:01,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:01,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 15:41:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:01,924 INFO L225 Difference]: With dead ends: 1618 [2018-11-18 15:41:01,924 INFO L226 Difference]: Without dead ends: 1136 [2018-11-18 15:41:01,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-18 15:41:01,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2018-11-18 15:41:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1117. [2018-11-18 15:41:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-11-18 15:41:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1564 transitions. [2018-11-18 15:41:01,975 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1564 transitions. Word has length 36 [2018-11-18 15:41:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:01,976 INFO L480 AbstractCegarLoop]: Abstraction has 1117 states and 1564 transitions. [2018-11-18 15:41:01,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1564 transitions. [2018-11-18 15:41:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 15:41:01,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:01,979 INFO L375 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] [2018-11-18 15:41:01,979 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:01,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash -293176185, now seen corresponding path program 1 times [2018-11-18 15:41:01,980 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:01,981 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:02,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:02,230 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-18 15:41:02,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:02,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:02,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:02,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:02,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:02,234 INFO L87 Difference]: Start difference. First operand 1117 states and 1564 transitions. Second operand 3 states. [2018-11-18 15:41:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:02,365 INFO L93 Difference]: Finished difference Result 1855 states and 2631 transitions. [2018-11-18 15:41:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:02,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 15:41:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:02,371 INFO L225 Difference]: With dead ends: 1855 [2018-11-18 15:41:02,371 INFO L226 Difference]: Without dead ends: 1836 [2018-11-18 15:41:02,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-18 15:41:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-11-18 15:41:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1774. [2018-11-18 15:41:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2018-11-18 15:41:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2533 transitions. [2018-11-18 15:41:02,422 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2533 transitions. Word has length 48 [2018-11-18 15:41:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:02,422 INFO L480 AbstractCegarLoop]: Abstraction has 1774 states and 2533 transitions. [2018-11-18 15:41:02,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2533 transitions. [2018-11-18 15:41:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:41:02,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:02,425 INFO L375 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] [2018-11-18 15:41:02,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:02,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1409188059, now seen corresponding path program 1 times [2018-11-18 15:41:02,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:02,426 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:02,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:02,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:02,674 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-18 15:41:02,674 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:02,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:02,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:02,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:02,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:02,677 INFO L87 Difference]: Start difference. First operand 1774 states and 2533 transitions. Second operand 3 states. [2018-11-18 15:41:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:02,926 INFO L93 Difference]: Finished difference Result 1823 states and 2602 transitions. [2018-11-18 15:41:02,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:02,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-18 15:41:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:02,932 INFO L225 Difference]: With dead ends: 1823 [2018-11-18 15:41:02,932 INFO L226 Difference]: Without dead ends: 1819 [2018-11-18 15:41:02,933 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-18 15:41:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2018-11-18 15:41:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1811. [2018-11-18 15:41:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2018-11-18 15:41:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2584 transitions. [2018-11-18 15:41:02,973 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2584 transitions. Word has length 49 [2018-11-18 15:41:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:02,973 INFO L480 AbstractCegarLoop]: Abstraction has 1811 states and 2584 transitions. [2018-11-18 15:41:02,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2584 transitions. [2018-11-18 15:41:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:41:02,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:02,975 INFO L375 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] [2018-11-18 15:41:02,975 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:02,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2139697088, now seen corresponding path program 1 times [2018-11-18 15:41:02,976 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:03,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:03,219 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-18 15:41:03,219 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:03,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:03,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:03,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:03,222 INFO L87 Difference]: Start difference. First operand 1811 states and 2584 transitions. Second operand 3 states. [2018-11-18 15:41:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:05,744 INFO L93 Difference]: Finished difference Result 3180 states and 4600 transitions. [2018-11-18 15:41:05,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:05,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-18 15:41:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:05,759 INFO L225 Difference]: With dead ends: 3180 [2018-11-18 15:41:05,759 INFO L226 Difference]: Without dead ends: 3177 [2018-11-18 15:41:05,760 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-18 15:41:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2018-11-18 15:41:05,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2977. [2018-11-18 15:41:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2018-11-18 15:41:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4284 transitions. [2018-11-18 15:41:05,879 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4284 transitions. Word has length 49 [2018-11-18 15:41:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:05,879 INFO L480 AbstractCegarLoop]: Abstraction has 2977 states and 4284 transitions. [2018-11-18 15:41:05,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4284 transitions. [2018-11-18 15:41:05,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 15:41:05,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:05,880 INFO L375 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] [2018-11-18 15:41:05,882 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:05,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash -622679882, now seen corresponding path program 1 times [2018-11-18 15:41:05,883 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:05,883 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:05,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:06,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:06,153 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-18 15:41:06,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:06,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:06,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:06,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:06,157 INFO L87 Difference]: Start difference. First operand 2977 states and 4284 transitions. Second operand 3 states. [2018-11-18 15:41:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:06,435 INFO L93 Difference]: Finished difference Result 3586 states and 5201 transitions. [2018-11-18 15:41:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:06,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 15:41:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:06,450 INFO L225 Difference]: With dead ends: 3586 [2018-11-18 15:41:06,450 INFO L226 Difference]: Without dead ends: 3581 [2018-11-18 15:41:06,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-18 15:41:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2018-11-18 15:41:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 3509. [2018-11-18 15:41:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3509 states. [2018-11-18 15:41:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5060 transitions. [2018-11-18 15:41:06,568 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5060 transitions. Word has length 50 [2018-11-18 15:41:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:06,568 INFO L480 AbstractCegarLoop]: Abstraction has 3509 states and 5060 transitions. [2018-11-18 15:41:06,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5060 transitions. [2018-11-18 15:41:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 15:41:06,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:06,569 INFO L375 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] [2018-11-18 15:41:06,570 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:06,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1667908896, now seen corresponding path program 1 times [2018-11-18 15:41:06,571 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:06,571 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:06,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:06,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:06,915 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-18 15:41:06,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:06,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:06,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:06,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:06,926 INFO L87 Difference]: Start difference. First operand 3509 states and 5060 transitions. Second operand 5 states. [2018-11-18 15:41:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:12,255 INFO L93 Difference]: Finished difference Result 6795 states and 9786 transitions. [2018-11-18 15:41:12,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:41:12,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 15:41:12,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:12,266 INFO L225 Difference]: With dead ends: 6795 [2018-11-18 15:41:12,266 INFO L226 Difference]: Without dead ends: 3565 [2018-11-18 15:41:12,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2018-11-18 15:41:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3503. [2018-11-18 15:41:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-11-18 15:41:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5046 transitions. [2018-11-18 15:41:12,408 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5046 transitions. Word has length 50 [2018-11-18 15:41:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:12,408 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 5046 transitions. [2018-11-18 15:41:12,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5046 transitions. [2018-11-18 15:41:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 15:41:12,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:12,409 INFO L375 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] [2018-11-18 15:41:12,410 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:12,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1672166653, now seen corresponding path program 1 times [2018-11-18 15:41:12,411 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:12,411 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:12,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:12,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:12,672 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-18 15:41:12,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:12,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:12,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:12,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:12,676 INFO L87 Difference]: Start difference. First operand 3503 states and 5046 transitions. Second operand 5 states. [2018-11-18 15:41:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:15,804 INFO L93 Difference]: Finished difference Result 3581 states and 5186 transitions. [2018-11-18 15:41:15,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:41:15,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-18 15:41:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:15,813 INFO L225 Difference]: With dead ends: 3581 [2018-11-18 15:41:15,813 INFO L226 Difference]: Without dead ends: 3575 [2018-11-18 15:41:15,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2018-11-18 15:41:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3503. [2018-11-18 15:41:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-11-18 15:41:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5045 transitions. [2018-11-18 15:41:15,916 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5045 transitions. Word has length 51 [2018-11-18 15:41:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:15,916 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 5045 transitions. [2018-11-18 15:41:15,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5045 transitions. [2018-11-18 15:41:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:41:15,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:15,917 INFO L375 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] [2018-11-18 15:41:15,918 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:15,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1641469421, now seen corresponding path program 1 times [2018-11-18 15:41:15,918 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:15,919 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:15,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:16,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:16,174 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-18 15:41:16,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (10)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 15:41:16,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:16,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:16,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:16,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:16,179 INFO L87 Difference]: Start difference. First operand 3503 states and 5045 transitions. Second operand 5 states. [2018-11-18 15:41:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:19,282 INFO L93 Difference]: Finished difference Result 3581 states and 5185 transitions. [2018-11-18 15:41:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:41:19,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 15:41:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:19,294 INFO L225 Difference]: With dead ends: 3581 [2018-11-18 15:41:19,294 INFO L226 Difference]: Without dead ends: 3575 [2018-11-18 15:41:19,296 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2018-11-18 15:41:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3503. [2018-11-18 15:41:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3503 states. [2018-11-18 15:41:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 5044 transitions. [2018-11-18 15:41:19,489 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 5044 transitions. Word has length 53 [2018-11-18 15:41:19,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:19,490 INFO L480 AbstractCegarLoop]: Abstraction has 3503 states and 5044 transitions. [2018-11-18 15:41:19,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:19,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 5044 transitions. [2018-11-18 15:41:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:41:19,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:19,491 INFO L375 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] [2018-11-18 15:41:19,492 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:19,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1479732052, now seen corresponding path program 1 times [2018-11-18 15:41:19,493 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:19,493 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:19,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:19,795 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-18 15:41:19,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:19,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:19,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:19,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:19,798 INFO L87 Difference]: Start difference. First operand 3503 states and 5044 transitions. Second operand 5 states. [2018-11-18 15:41:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:19,940 INFO L93 Difference]: Finished difference Result 3518 states and 5060 transitions. [2018-11-18 15:41:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:19,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 15:41:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:19,953 INFO L225 Difference]: With dead ends: 3518 [2018-11-18 15:41:19,953 INFO L226 Difference]: Without dead ends: 3501 [2018-11-18 15:41:19,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2018-11-18 15:41:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2018-11-18 15:41:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3501 states. [2018-11-18 15:41:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 5040 transitions. [2018-11-18 15:41:20,119 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 5040 transitions. Word has length 53 [2018-11-18 15:41:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:20,119 INFO L480 AbstractCegarLoop]: Abstraction has 3501 states and 5040 transitions. [2018-11-18 15:41:20,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 5040 transitions. [2018-11-18 15:41:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 15:41:20,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:20,121 INFO L375 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] [2018-11-18 15:41:20,121 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:20,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:20,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1446696274, now seen corresponding path program 1 times [2018-11-18 15:41:20,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:20,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:20,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:20,495 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-18 15:41:20,495 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (12)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 15:41:20,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:20,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:20,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:20,500 INFO L87 Difference]: Start difference. First operand 3501 states and 5040 transitions. Second operand 3 states. [2018-11-18 15:41:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:20,818 INFO L93 Difference]: Finished difference Result 9839 states and 14358 transitions. [2018-11-18 15:41:20,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:20,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-18 15:41:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:20,839 INFO L225 Difference]: With dead ends: 9839 [2018-11-18 15:41:20,840 INFO L226 Difference]: Without dead ends: 6575 [2018-11-18 15:41:20,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-18 15:41:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6575 states. [2018-11-18 15:41:21,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6575 to 6521. [2018-11-18 15:41:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6521 states. [2018-11-18 15:41:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 9503 transitions. [2018-11-18 15:41:21,224 INFO L78 Accepts]: Start accepts. Automaton has 6521 states and 9503 transitions. Word has length 55 [2018-11-18 15:41:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:21,224 INFO L480 AbstractCegarLoop]: Abstraction has 6521 states and 9503 transitions. [2018-11-18 15:41:21,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6521 states and 9503 transitions. [2018-11-18 15:41:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 15:41:21,225 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:21,225 INFO L375 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] [2018-11-18 15:41:21,226 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:21,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:21,226 INFO L82 PathProgramCache]: Analyzing trace with hash 736994140, now seen corresponding path program 1 times [2018-11-18 15:41:21,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:21,227 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:21,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:21,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:21,445 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-18 15:41:21,445 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:21,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:21,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:21,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:21,448 INFO L87 Difference]: Start difference. First operand 6521 states and 9503 transitions. Second operand 5 states. [2018-11-18 15:41:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:21,654 INFO L93 Difference]: Finished difference Result 6536 states and 9519 transitions. [2018-11-18 15:41:21,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:21,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-18 15:41:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:21,675 INFO L225 Difference]: With dead ends: 6536 [2018-11-18 15:41:21,675 INFO L226 Difference]: Without dead ends: 6514 [2018-11-18 15:41:21,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2018-11-18 15:41:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6514. [2018-11-18 15:41:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6514 states. [2018-11-18 15:41:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 9494 transitions. [2018-11-18 15:41:21,912 INFO L78 Accepts]: Start accepts. Automaton has 6514 states and 9494 transitions. Word has length 54 [2018-11-18 15:41:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:21,912 INFO L480 AbstractCegarLoop]: Abstraction has 6514 states and 9494 transitions. [2018-11-18 15:41:21,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 6514 states and 9494 transitions. [2018-11-18 15:41:21,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 15:41:21,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:21,913 INFO L375 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] [2018-11-18 15:41:21,913 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:21,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:21,914 INFO L82 PathProgramCache]: Analyzing trace with hash 218864070, now seen corresponding path program 1 times [2018-11-18 15:41:21,914 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:21,914 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:21,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:22,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:22,134 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-18 15:41:22,135 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:22,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:22,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:22,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:22,137 INFO L87 Difference]: Start difference. First operand 6514 states and 9494 transitions. Second operand 3 states. [2018-11-18 15:41:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:24,473 INFO L93 Difference]: Finished difference Result 12207 states and 17981 transitions. [2018-11-18 15:41:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:24,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-18 15:41:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:24,488 INFO L225 Difference]: With dead ends: 12207 [2018-11-18 15:41:24,488 INFO L226 Difference]: Without dead ends: 6626 [2018-11-18 15:41:24,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 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-18 15:41:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2018-11-18 15:41:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6600. [2018-11-18 15:41:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6600 states. [2018-11-18 15:41:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 9596 transitions. [2018-11-18 15:41:24,749 INFO L78 Accepts]: Start accepts. Automaton has 6600 states and 9596 transitions. Word has length 55 [2018-11-18 15:41:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:24,749 INFO L480 AbstractCegarLoop]: Abstraction has 6600 states and 9596 transitions. [2018-11-18 15:41:24,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6600 states and 9596 transitions. [2018-11-18 15:41:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 15:41:24,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:24,750 INFO L375 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] [2018-11-18 15:41:24,750 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:24,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1190626927, now seen corresponding path program 1 times [2018-11-18 15:41:24,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:24,752 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:24,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:24,986 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-18 15:41:24,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:24,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:24,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:24,989 INFO L87 Difference]: Start difference. First operand 6600 states and 9596 transitions. Second operand 3 states. [2018-11-18 15:41:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:25,852 INFO L93 Difference]: Finished difference Result 12479 states and 18305 transitions. [2018-11-18 15:41:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:25,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-11-18 15:41:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:25,871 INFO L225 Difference]: With dead ends: 12479 [2018-11-18 15:41:25,871 INFO L226 Difference]: Without dead ends: 6812 [2018-11-18 15:41:25,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-18 15:41:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6812 states. [2018-11-18 15:41:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6812 to 6640. [2018-11-18 15:41:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6640 states. [2018-11-18 15:41:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 9644 transitions. [2018-11-18 15:41:26,178 INFO L78 Accepts]: Start accepts. Automaton has 6640 states and 9644 transitions. Word has length 56 [2018-11-18 15:41:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:26,179 INFO L480 AbstractCegarLoop]: Abstraction has 6640 states and 9644 transitions. [2018-11-18 15:41:26,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6640 states and 9644 transitions. [2018-11-18 15:41:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 15:41:26,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:26,180 INFO L375 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-18 15:41:26,180 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:26,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash -563220113, now seen corresponding path program 1 times [2018-11-18 15:41:26,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:26,182 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:26,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:26,407 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-18 15:41:26,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:26,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:26,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:26,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:26,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:26,411 INFO L87 Difference]: Start difference. First operand 6640 states and 9644 transitions. Second operand 5 states. [2018-11-18 15:41:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:26,604 INFO L93 Difference]: Finished difference Result 6664 states and 9686 transitions. [2018-11-18 15:41:26,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:26,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-18 15:41:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:26,621 INFO L225 Difference]: With dead ends: 6664 [2018-11-18 15:41:26,621 INFO L226 Difference]: Without dead ends: 6648 [2018-11-18 15:41:26,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6648 states. [2018-11-18 15:41:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6648 to 6642. [2018-11-18 15:41:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6642 states. [2018-11-18 15:41:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6642 states to 6642 states and 9650 transitions. [2018-11-18 15:41:26,815 INFO L78 Accepts]: Start accepts. Automaton has 6642 states and 9650 transitions. Word has length 58 [2018-11-18 15:41:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:26,815 INFO L480 AbstractCegarLoop]: Abstraction has 6642 states and 9650 transitions. [2018-11-18 15:41:26,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 6642 states and 9650 transitions. [2018-11-18 15:41:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 15:41:26,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:26,817 INFO L375 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, 1] [2018-11-18 15:41:26,817 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:26,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -344400594, now seen corresponding path program 1 times [2018-11-18 15:41:26,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:26,818 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:26,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:27,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:27,063 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-18 15:41:27,063 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:27,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:27,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:27,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:27,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:27,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:27,066 INFO L87 Difference]: Start difference. First operand 6642 states and 9650 transitions. Second operand 5 states. [2018-11-18 15:41:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:27,248 INFO L93 Difference]: Finished difference Result 6660 states and 9669 transitions. [2018-11-18 15:41:27,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:27,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-18 15:41:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:27,260 INFO L225 Difference]: With dead ends: 6660 [2018-11-18 15:41:27,260 INFO L226 Difference]: Without dead ends: 6640 [2018-11-18 15:41:27,262 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2018-11-18 15:41:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6640. [2018-11-18 15:41:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6640 states. [2018-11-18 15:41:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 9646 transitions. [2018-11-18 15:41:27,449 INFO L78 Accepts]: Start accepts. Automaton has 6640 states and 9646 transitions. Word has length 59 [2018-11-18 15:41:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:27,449 INFO L480 AbstractCegarLoop]: Abstraction has 6640 states and 9646 transitions. [2018-11-18 15:41:27,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6640 states and 9646 transitions. [2018-11-18 15:41:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-18 15:41:27,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:27,450 INFO L375 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, 1, 1, 1] [2018-11-18 15:41:27,451 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:27,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1727839769, now seen corresponding path program 1 times [2018-11-18 15:41:27,452 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:27,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:27,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:27,671 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-18 15:41:27,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:27,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:27,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:27,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:27,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:27,674 INFO L87 Difference]: Start difference. First operand 6640 states and 9646 transitions. Second operand 5 states. [2018-11-18 15:41:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:27,911 INFO L93 Difference]: Finished difference Result 6655 states and 9662 transitions. [2018-11-18 15:41:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:27,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-18 15:41:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:27,921 INFO L225 Difference]: With dead ends: 6655 [2018-11-18 15:41:27,921 INFO L226 Difference]: Without dead ends: 6635 [2018-11-18 15:41:27,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6635 states. [2018-11-18 15:41:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6635 to 6635. [2018-11-18 15:41:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6635 states. [2018-11-18 15:41:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 9639 transitions. [2018-11-18 15:41:28,097 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 9639 transitions. Word has length 61 [2018-11-18 15:41:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:28,098 INFO L480 AbstractCegarLoop]: Abstraction has 6635 states and 9639 transitions. [2018-11-18 15:41:28,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 9639 transitions. [2018-11-18 15:41:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 15:41:28,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:28,099 INFO L375 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, 1, 1, 1, 1] [2018-11-18 15:41:28,099 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:28,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash -405016589, now seen corresponding path program 1 times [2018-11-18 15:41:28,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:28,100 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:28,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:28,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:28,321 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-18 15:41:28,321 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:28,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:28,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:28,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:28,324 INFO L87 Difference]: Start difference. First operand 6635 states and 9639 transitions. Second operand 3 states. [2018-11-18 15:41:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:28,801 INFO L93 Difference]: Finished difference Result 9298 states and 13677 transitions. [2018-11-18 15:41:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:28,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-18 15:41:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:28,823 INFO L225 Difference]: With dead ends: 9298 [2018-11-18 15:41:28,823 INFO L226 Difference]: Without dead ends: 9290 [2018-11-18 15:41:28,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-18 15:41:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9290 states. [2018-11-18 15:41:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9290 to 7871. [2018-11-18 15:41:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7871 states. [2018-11-18 15:41:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7871 states to 7871 states and 11451 transitions. [2018-11-18 15:41:29,175 INFO L78 Accepts]: Start accepts. Automaton has 7871 states and 11451 transitions. Word has length 62 [2018-11-18 15:41:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:29,175 INFO L480 AbstractCegarLoop]: Abstraction has 7871 states and 11451 transitions. [2018-11-18 15:41:29,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7871 states and 11451 transitions. [2018-11-18 15:41:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 15:41:29,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:29,176 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 15:41:29,176 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:29,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash 529836039, now seen corresponding path program 1 times [2018-11-18 15:41:29,178 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:29,178 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:29,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:29,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:29,430 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-18 15:41:29,430 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:29,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:29,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:29,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:41:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:29,433 INFO L87 Difference]: Start difference. First operand 7871 states and 11451 transitions. Second operand 5 states. [2018-11-18 15:41:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:31,538 INFO L93 Difference]: Finished difference Result 14850 states and 21832 transitions. [2018-11-18 15:41:31,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:31,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-18 15:41:31,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:31,550 INFO L225 Difference]: With dead ends: 14850 [2018-11-18 15:41:31,551 INFO L226 Difference]: Without dead ends: 8059 [2018-11-18 15:41:31,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8059 states. [2018-11-18 15:41:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8059 to 7927. [2018-11-18 15:41:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7927 states. [2018-11-18 15:41:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7927 states to 7927 states and 11556 transitions. [2018-11-18 15:41:31,794 INFO L78 Accepts]: Start accepts. Automaton has 7927 states and 11556 transitions. Word has length 63 [2018-11-18 15:41:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:31,795 INFO L480 AbstractCegarLoop]: Abstraction has 7927 states and 11556 transitions. [2018-11-18 15:41:31,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:41:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 11556 transitions. [2018-11-18 15:41:31,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 15:41:31,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:31,797 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 15:41:31,797 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:31,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:31,797 INFO L82 PathProgramCache]: Analyzing trace with hash 780704964, now seen corresponding path program 1 times [2018-11-18 15:41:31,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:31,798 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:31,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:31,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:32,035 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-18 15:41:32,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:32,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:32,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:41:32,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:41:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:41:32,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:41:32,038 INFO L87 Difference]: Start difference. First operand 7927 states and 11556 transitions. Second operand 6 states. [2018-11-18 15:41:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:51,824 INFO L93 Difference]: Finished difference Result 13827 states and 20397 transitions. [2018-11-18 15:41:51,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:41:51,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-18 15:41:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:51,835 INFO L225 Difference]: With dead ends: 13827 [2018-11-18 15:41:51,835 INFO L226 Difference]: Without dead ends: 9473 [2018-11-18 15:41:51,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:41:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states. [2018-11-18 15:41:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 8686. [2018-11-18 15:41:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8686 states. [2018-11-18 15:41:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8686 states to 8686 states and 12718 transitions. [2018-11-18 15:41:52,122 INFO L78 Accepts]: Start accepts. Automaton has 8686 states and 12718 transitions. Word has length 63 [2018-11-18 15:41:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:52,123 INFO L480 AbstractCegarLoop]: Abstraction has 8686 states and 12718 transitions. [2018-11-18 15:41:52,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:41:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8686 states and 12718 transitions. [2018-11-18 15:41:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 15:41:52,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:52,124 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-18 15:41:52,125 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:52,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1022234862, now seen corresponding path program 1 times [2018-11-18 15:41:52,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:52,126 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:52,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:52,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:52,357 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-18 15:41:52,357 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:52,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:52,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:41:52,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:52,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:52,359 INFO L87 Difference]: Start difference. First operand 8686 states and 12718 transitions. Second operand 3 states. [2018-11-18 15:41:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:53,126 INFO L93 Difference]: Finished difference Result 16279 states and 24117 transitions. [2018-11-18 15:41:53,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:53,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 15:41:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:41:53,140 INFO L225 Difference]: With dead ends: 16279 [2018-11-18 15:41:53,140 INFO L226 Difference]: Without dead ends: 8804 [2018-11-18 15:41:53,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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-18 15:41:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8804 states. [2018-11-18 15:41:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8804 to 8686. [2018-11-18 15:41:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8686 states. [2018-11-18 15:41:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8686 states to 8686 states and 12718 transitions. [2018-11-18 15:41:53,470 INFO L78 Accepts]: Start accepts. Automaton has 8686 states and 12718 transitions. Word has length 63 [2018-11-18 15:41:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:41:53,470 INFO L480 AbstractCegarLoop]: Abstraction has 8686 states and 12718 transitions. [2018-11-18 15:41:53,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:41:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 8686 states and 12718 transitions. [2018-11-18 15:41:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:41:53,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:41:53,472 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:53,472 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:41:53,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1570650670, now seen corresponding path program 1 times [2018-11-18 15:41:53,473 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:41:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:41:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:53,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:53,743 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-18 15:41:53,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:41:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:41:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:41:53,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:41:53,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:41:53,746 INFO L87 Difference]: Start difference. First operand 8686 states and 12718 transitions. Second operand 6 states. [2018-11-18 15:42:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:06,393 INFO L93 Difference]: Finished difference Result 12397 states and 18149 transitions. [2018-11-18 15:42:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:42:06,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-18 15:42:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:06,405 INFO L225 Difference]: With dead ends: 12397 [2018-11-18 15:42:06,406 INFO L226 Difference]: Without dead ends: 8603 [2018-11-18 15:42:06,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:42:06,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8603 states. [2018-11-18 15:42:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8603 to 7953. [2018-11-18 15:42:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2018-11-18 15:42:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 11503 transitions. [2018-11-18 15:42:06,691 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 11503 transitions. Word has length 64 [2018-11-18 15:42:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:06,691 INFO L480 AbstractCegarLoop]: Abstraction has 7953 states and 11503 transitions. [2018-11-18 15:42:06,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:42:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 11503 transitions. [2018-11-18 15:42:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:42:06,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:06,693 INFO L375 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, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:06,693 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:06,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash -276801234, now seen corresponding path program 1 times [2018-11-18 15:42:06,694 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:06,694 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:06,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:06,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:06,882 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-18 15:42:06,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:06,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:06,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:42:06,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:42:06,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:42:06,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:06,884 INFO L87 Difference]: Start difference. First operand 7953 states and 11503 transitions. Second operand 3 states. [2018-11-18 15:42:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:07,490 INFO L93 Difference]: Finished difference Result 10569 states and 15434 transitions. [2018-11-18 15:42:07,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:42:07,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-18 15:42:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:07,503 INFO L225 Difference]: With dead ends: 10569 [2018-11-18 15:42:07,503 INFO L226 Difference]: Without dead ends: 10556 [2018-11-18 15:42:07,506 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-18 15:42:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2018-11-18 15:42:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 7404. [2018-11-18 15:42:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7404 states. [2018-11-18 15:42:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 10693 transitions. [2018-11-18 15:42:07,786 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 10693 transitions. Word has length 64 [2018-11-18 15:42:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:07,786 INFO L480 AbstractCegarLoop]: Abstraction has 7404 states and 10693 transitions. [2018-11-18 15:42:07,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:42:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 10693 transitions. [2018-11-18 15:42:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:42:07,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:07,787 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:07,787 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:07,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash 460413673, now seen corresponding path program 1 times [2018-11-18 15:42:07,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:07,788 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:07,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:08,024 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-18 15:42:08,024 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:08,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:08,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:42:08,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:42:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:42:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:42:08,026 INFO L87 Difference]: Start difference. First operand 7404 states and 10693 transitions. Second operand 8 states. [2018-11-18 15:42:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:20,713 INFO L93 Difference]: Finished difference Result 7428 states and 10754 transitions. [2018-11-18 15:42:20,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:42:20,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-18 15:42:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:20,729 INFO L225 Difference]: With dead ends: 7428 [2018-11-18 15:42:20,729 INFO L226 Difference]: Without dead ends: 7424 [2018-11-18 15:42:20,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:42:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7424 states. [2018-11-18 15:42:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7424 to 7414. [2018-11-18 15:42:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7414 states. [2018-11-18 15:42:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 10718 transitions. [2018-11-18 15:42:21,008 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 10718 transitions. Word has length 65 [2018-11-18 15:42:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:21,008 INFO L480 AbstractCegarLoop]: Abstraction has 7414 states and 10718 transitions. [2018-11-18 15:42:21,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:42:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 10718 transitions. [2018-11-18 15:42:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:42:21,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:21,009 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:21,009 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:21,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:21,009 INFO L82 PathProgramCache]: Analyzing trace with hash 460136843, now seen corresponding path program 1 times [2018-11-18 15:42:21,010 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:21,010 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:21,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:21,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:21,230 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-18 15:42:21,230 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:21,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:21,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:42:21,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:42:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:42:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:42:21,233 INFO L87 Difference]: Start difference. First operand 7414 states and 10718 transitions. Second operand 5 states. [2018-11-18 15:42:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:26,444 INFO L93 Difference]: Finished difference Result 8844 states and 12888 transitions. [2018-11-18 15:42:26,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:42:26,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-18 15:42:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:26,456 INFO L225 Difference]: With dead ends: 8844 [2018-11-18 15:42:26,456 INFO L226 Difference]: Without dead ends: 8830 [2018-11-18 15:42:26,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:42:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8830 states. [2018-11-18 15:42:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8830 to 7408. [2018-11-18 15:42:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2018-11-18 15:42:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 10709 transitions. [2018-11-18 15:42:26,746 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 10709 transitions. Word has length 65 [2018-11-18 15:42:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:26,746 INFO L480 AbstractCegarLoop]: Abstraction has 7408 states and 10709 transitions. [2018-11-18 15:42:26,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:42:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 10709 transitions. [2018-11-18 15:42:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:42:26,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:26,748 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:26,748 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:26,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:26,748 INFO L82 PathProgramCache]: Analyzing trace with hash 301337160, now seen corresponding path program 1 times [2018-11-18 15:42:26,749 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:26,749 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:26,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:26,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:27,012 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-18 15:42:27,012 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:27,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:27,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:42:27,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:42:27,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:42:27,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:42:27,014 INFO L87 Difference]: Start difference. First operand 7408 states and 10709 transitions. Second operand 8 states. [2018-11-18 15:42:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:39,528 INFO L93 Difference]: Finished difference Result 7421 states and 10723 transitions. [2018-11-18 15:42:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:42:39,529 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-18 15:42:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:39,543 INFO L225 Difference]: With dead ends: 7421 [2018-11-18 15:42:39,543 INFO L226 Difference]: Without dead ends: 7371 [2018-11-18 15:42:39,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:42:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2018-11-18 15:42:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 7371. [2018-11-18 15:42:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7371 states. [2018-11-18 15:42:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7371 states to 7371 states and 10659 transitions. [2018-11-18 15:42:39,882 INFO L78 Accepts]: Start accepts. Automaton has 7371 states and 10659 transitions. Word has length 65 [2018-11-18 15:42:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:39,882 INFO L480 AbstractCegarLoop]: Abstraction has 7371 states and 10659 transitions. [2018-11-18 15:42:39,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:42:39,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7371 states and 10659 transitions. [2018-11-18 15:42:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 15:42:39,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:39,884 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:39,884 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:39,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:39,884 INFO L82 PathProgramCache]: Analyzing trace with hash -499378748, now seen corresponding path program 1 times [2018-11-18 15:42:39,885 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:39,885 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:39,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:40,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:40,083 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-18 15:42:40,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:40,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:42:40,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:42:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:42:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:40,086 INFO L87 Difference]: Start difference. First operand 7371 states and 10659 transitions. Second operand 3 states. [2018-11-18 15:42:42,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:42,437 INFO L93 Difference]: Finished difference Result 10662 states and 15469 transitions. [2018-11-18 15:42:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:42:42,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 15:42:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:42,447 INFO L225 Difference]: With dead ends: 10662 [2018-11-18 15:42:42,447 INFO L226 Difference]: Without dead ends: 7272 [2018-11-18 15:42:42,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-18 15:42:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7272 states. [2018-11-18 15:42:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7272 to 7209. [2018-11-18 15:42:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7209 states. [2018-11-18 15:42:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7209 states to 7209 states and 10406 transitions. [2018-11-18 15:42:42,737 INFO L78 Accepts]: Start accepts. Automaton has 7209 states and 10406 transitions. Word has length 68 [2018-11-18 15:42:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:42,738 INFO L480 AbstractCegarLoop]: Abstraction has 7209 states and 10406 transitions. [2018-11-18 15:42:42,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:42:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 7209 states and 10406 transitions. [2018-11-18 15:42:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 15:42:42,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:42,739 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:42,739 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:42,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:42,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1706339903, now seen corresponding path program 1 times [2018-11-18 15:42:42,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:42,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:42,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:42,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:42,938 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-18 15:42:42,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:42,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:42,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:42:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:42:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:42:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:42,941 INFO L87 Difference]: Start difference. First operand 7209 states and 10406 transitions. Second operand 3 states. [2018-11-18 15:42:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:45,337 INFO L93 Difference]: Finished difference Result 13444 states and 19602 transitions. [2018-11-18 15:42:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:42:45,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-18 15:42:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:45,349 INFO L225 Difference]: With dead ends: 13444 [2018-11-18 15:42:45,350 INFO L226 Difference]: Without dead ends: 7259 [2018-11-18 15:42:45,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-18 15:42:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2018-11-18 15:42:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 7085. [2018-11-18 15:42:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-11-18 15:42:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 10240 transitions. [2018-11-18 15:42:45,681 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 10240 transitions. Word has length 68 [2018-11-18 15:42:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:45,681 INFO L480 AbstractCegarLoop]: Abstraction has 7085 states and 10240 transitions. [2018-11-18 15:42:45,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:42:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 10240 transitions. [2018-11-18 15:42:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 15:42:45,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:45,682 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:45,682 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:45,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1069362388, now seen corresponding path program 1 times [2018-11-18 15:42:45,683 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:45,683 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:45,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:45,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:45,883 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-18 15:42:45,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:45,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:45,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:42:45,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:42:45,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:42:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:45,885 INFO L87 Difference]: Start difference. First operand 7085 states and 10240 transitions. Second operand 3 states. [2018-11-18 15:42:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:46,946 INFO L93 Difference]: Finished difference Result 13260 states and 19398 transitions. [2018-11-18 15:42:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:42:46,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 15:42:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:46,957 INFO L225 Difference]: With dead ends: 13260 [2018-11-18 15:42:46,957 INFO L226 Difference]: Without dead ends: 7199 [2018-11-18 15:42:46,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-18 15:42:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2018-11-18 15:42:47,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 7085. [2018-11-18 15:42:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2018-11-18 15:42:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 10240 transitions. [2018-11-18 15:42:47,243 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 10240 transitions. Word has length 66 [2018-11-18 15:42:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:47,243 INFO L480 AbstractCegarLoop]: Abstraction has 7085 states and 10240 transitions. [2018-11-18 15:42:47,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:42:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 10240 transitions. [2018-11-18 15:42:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:42:47,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:47,245 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:47,245 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:47,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash 310207976, now seen corresponding path program 1 times [2018-11-18 15:42:47,246 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:47,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:47,503 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-18 15:42:47,503 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:47,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:47,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:42:47,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:42:47,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:42:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:47,506 INFO L87 Difference]: Start difference. First operand 7085 states and 10240 transitions. Second operand 3 states. [2018-11-18 15:42:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:49,796 INFO L93 Difference]: Finished difference Result 8900 states and 12818 transitions. [2018-11-18 15:42:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:42:49,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-18 15:42:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:49,803 INFO L225 Difference]: With dead ends: 8900 [2018-11-18 15:42:49,803 INFO L226 Difference]: Without dead ends: 5199 [2018-11-18 15:42:49,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2018-11-18 15:42:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4686. [2018-11-18 15:42:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4686 states. [2018-11-18 15:42:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6686 transitions. [2018-11-18 15:42:50,031 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6686 transitions. Word has length 73 [2018-11-18 15:42:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:50,031 INFO L480 AbstractCegarLoop]: Abstraction has 4686 states and 6686 transitions. [2018-11-18 15:42:50,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:42:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6686 transitions. [2018-11-18 15:42:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 15:42:50,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:50,032 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:50,033 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -693203350, now seen corresponding path program 1 times [2018-11-18 15:42:50,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:50,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:50,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:50,318 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-18 15:42:50,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:50,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:50,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:42:50,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:42:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:42:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:42:50,320 INFO L87 Difference]: Start difference. First operand 4686 states and 6686 transitions. Second operand 8 states. [2018-11-18 15:43:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:02,917 INFO L93 Difference]: Finished difference Result 4702 states and 6703 transitions. [2018-11-18 15:43:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:43:02,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-18 15:43:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:02,923 INFO L225 Difference]: With dead ends: 4702 [2018-11-18 15:43:02,923 INFO L226 Difference]: Without dead ends: 4682 [2018-11-18 15:43:02,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:43:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2018-11-18 15:43:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4682. [2018-11-18 15:43:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4682 states. [2018-11-18 15:43:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4682 states to 4682 states and 6680 transitions. [2018-11-18 15:43:03,141 INFO L78 Accepts]: Start accepts. Automaton has 4682 states and 6680 transitions. Word has length 71 [2018-11-18 15:43:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:03,142 INFO L480 AbstractCegarLoop]: Abstraction has 4682 states and 6680 transitions. [2018-11-18 15:43:03,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:43:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4682 states and 6680 transitions. [2018-11-18 15:43:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:43:03,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:03,143 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:03,143 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:03,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash -396799950, now seen corresponding path program 1 times [2018-11-18 15:43:03,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:03,144 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:03,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:03,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:03,361 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-18 15:43:03,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:03,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:43:03,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:43:03,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:43:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:43:03,363 INFO L87 Difference]: Start difference. First operand 4682 states and 6680 transitions. Second operand 6 states. [2018-11-18 15:43:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:05,624 INFO L93 Difference]: Finished difference Result 4798 states and 6826 transitions. [2018-11-18 15:43:05,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:43:05,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-18 15:43:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:05,630 INFO L225 Difference]: With dead ends: 4798 [2018-11-18 15:43:05,630 INFO L226 Difference]: Without dead ends: 4782 [2018-11-18 15:43:05,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:43:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2018-11-18 15:43:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4705. [2018-11-18 15:43:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2018-11-18 15:43:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6707 transitions. [2018-11-18 15:43:05,832 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6707 transitions. Word has length 72 [2018-11-18 15:43:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:05,832 INFO L480 AbstractCegarLoop]: Abstraction has 4705 states and 6707 transitions. [2018-11-18 15:43:05,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:43:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6707 transitions. [2018-11-18 15:43:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:43:05,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:05,833 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:05,833 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:05,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1567544663, now seen corresponding path program 1 times [2018-11-18 15:43:05,834 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:05,834 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:06,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:06,056 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-18 15:43:06,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:06,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:06,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:43:06,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:43:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:43:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:43:06,062 INFO L87 Difference]: Start difference. First operand 4705 states and 6707 transitions. Second operand 6 states. [2018-11-18 15:43:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:07,611 INFO L93 Difference]: Finished difference Result 4821 states and 6853 transitions. [2018-11-18 15:43:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:43:07,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-18 15:43:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:07,618 INFO L225 Difference]: With dead ends: 4821 [2018-11-18 15:43:07,618 INFO L226 Difference]: Without dead ends: 4805 [2018-11-18 15:43:07,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:43:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2018-11-18 15:43:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 4705. [2018-11-18 15:43:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2018-11-18 15:43:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 6707 transitions. [2018-11-18 15:43:07,852 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 6707 transitions. Word has length 73 [2018-11-18 15:43:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:07,853 INFO L480 AbstractCegarLoop]: Abstraction has 4705 states and 6707 transitions. [2018-11-18 15:43:07,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:43:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 6707 transitions. [2018-11-18 15:43:07,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:43:07,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:07,854 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:43:07,854 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:07,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash 345170117, now seen corresponding path program 1 times [2018-11-18 15:43:07,855 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:07,855 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:07,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:08,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:43:08,069 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:08,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:08,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:43:08,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:43:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:43:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:43:08,072 INFO L87 Difference]: Start difference. First operand 4705 states and 6707 transitions. Second operand 5 states. [2018-11-18 15:43:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:09,842 INFO L93 Difference]: Finished difference Result 9090 states and 13071 transitions. [2018-11-18 15:43:09,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:43:09,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 15:43:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:09,850 INFO L225 Difference]: With dead ends: 9090 [2018-11-18 15:43:09,851 INFO L226 Difference]: Without dead ends: 4964 [2018-11-18 15:43:09,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:43:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2018-11-18 15:43:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 4765. [2018-11-18 15:43:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4765 states. [2018-11-18 15:43:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 6793 transitions. [2018-11-18 15:43:10,079 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 6793 transitions. Word has length 73 [2018-11-18 15:43:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:10,080 INFO L480 AbstractCegarLoop]: Abstraction has 4765 states and 6793 transitions. [2018-11-18 15:43:10,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:43:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 6793 transitions. [2018-11-18 15:43:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:43:10,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:10,081 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:10,081 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:10,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:10,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1917394937, now seen corresponding path program 1 times [2018-11-18 15:43:10,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:10,082 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:10,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:10,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:10,302 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-18 15:43:10,303 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:10,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:10,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:43:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:43:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:43:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:43:10,305 INFO L87 Difference]: Start difference. First operand 4765 states and 6793 transitions. Second operand 5 states. [2018-11-18 15:43:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:11,322 INFO L93 Difference]: Finished difference Result 9071 states and 13082 transitions. [2018-11-18 15:43:11,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:43:11,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-18 15:43:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:11,329 INFO L225 Difference]: With dead ends: 9071 [2018-11-18 15:43:11,329 INFO L226 Difference]: Without dead ends: 4885 [2018-11-18 15:43:11,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:43:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2018-11-18 15:43:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4773. [2018-11-18 15:43:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4773 states. [2018-11-18 15:43:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4773 states to 4773 states and 6801 transitions. [2018-11-18 15:43:11,537 INFO L78 Accepts]: Start accepts. Automaton has 4773 states and 6801 transitions. Word has length 73 [2018-11-18 15:43:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:11,537 INFO L480 AbstractCegarLoop]: Abstraction has 4773 states and 6801 transitions. [2018-11-18 15:43:11,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:43:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4773 states and 6801 transitions. [2018-11-18 15:43:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 15:43:11,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:11,538 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:11,539 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:11,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1026458884, now seen corresponding path program 1 times [2018-11-18 15:43:11,540 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:11,540 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:11,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:11,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:11,777 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-18 15:43:11,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:11,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:43:11,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:43:11,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:43:11,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:43:11,780 INFO L87 Difference]: Start difference. First operand 4773 states and 6801 transitions. Second operand 3 states. [2018-11-18 15:43:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:12,095 INFO L93 Difference]: Finished difference Result 8030 states and 11460 transitions. [2018-11-18 15:43:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:43:12,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-18 15:43:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:12,103 INFO L225 Difference]: With dead ends: 8030 [2018-11-18 15:43:12,103 INFO L226 Difference]: Without dead ends: 4744 [2018-11-18 15:43:12,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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-18 15:43:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2018-11-18 15:43:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4742. [2018-11-18 15:43:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4742 states. [2018-11-18 15:43:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4742 states to 4742 states and 6748 transitions. [2018-11-18 15:43:12,348 INFO L78 Accepts]: Start accepts. Automaton has 4742 states and 6748 transitions. Word has length 79 [2018-11-18 15:43:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:12,348 INFO L480 AbstractCegarLoop]: Abstraction has 4742 states and 6748 transitions. [2018-11-18 15:43:12,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:43:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4742 states and 6748 transitions. [2018-11-18 15:43:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 15:43:12,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:12,349 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:12,349 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:12,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:12,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1844953435, now seen corresponding path program 1 times [2018-11-18 15:43:12,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:12,350 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:12,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:12,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:12,578 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-18 15:43:12,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:12,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:12,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:43:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:43:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:43:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:43:12,581 INFO L87 Difference]: Start difference. First operand 4742 states and 6748 transitions. Second operand 6 states. [2018-11-18 15:43:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:12,835 INFO L93 Difference]: Finished difference Result 4763 states and 6771 transitions. [2018-11-18 15:43:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:43:12,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-18 15:43:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:12,842 INFO L225 Difference]: With dead ends: 4763 [2018-11-18 15:43:12,842 INFO L226 Difference]: Without dead ends: 4741 [2018-11-18 15:43:12,843 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:43:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2018-11-18 15:43:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 4741. [2018-11-18 15:43:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4741 states. [2018-11-18 15:43:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6745 transitions. [2018-11-18 15:43:13,041 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6745 transitions. Word has length 74 [2018-11-18 15:43:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:13,041 INFO L480 AbstractCegarLoop]: Abstraction has 4741 states and 6745 transitions. [2018-11-18 15:43:13,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:43:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6745 transitions. [2018-11-18 15:43:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 15:43:13,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:13,042 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:13,042 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:13,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1258656272, now seen corresponding path program 1 times [2018-11-18 15:43:13,043 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:13,043 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:13,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:13,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:13,275 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-18 15:43:13,275 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:13,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:13,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:43:13,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:43:13,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:43:13,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:43:13,277 INFO L87 Difference]: Start difference. First operand 4741 states and 6745 transitions. Second operand 6 states. [2018-11-18 15:43:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:14,146 INFO L93 Difference]: Finished difference Result 4777 states and 6803 transitions. [2018-11-18 15:43:14,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:43:14,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-18 15:43:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:14,154 INFO L225 Difference]: With dead ends: 4777 [2018-11-18 15:43:14,154 INFO L226 Difference]: Without dead ends: 4761 [2018-11-18 15:43:14,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:43:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2018-11-18 15:43:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4741. [2018-11-18 15:43:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4741 states. [2018-11-18 15:43:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6745 transitions. [2018-11-18 15:43:14,355 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6745 transitions. Word has length 77 [2018-11-18 15:43:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:14,355 INFO L480 AbstractCegarLoop]: Abstraction has 4741 states and 6745 transitions. [2018-11-18 15:43:14,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:43:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6745 transitions. [2018-11-18 15:43:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 15:43:14,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:14,356 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:14,356 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:14,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash 121385763, now seen corresponding path program 1 times [2018-11-18 15:43:14,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:14,357 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:14,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:14,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:14,611 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-18 15:43:14,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:43:14,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:43:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:43:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:43:14,613 INFO L87 Difference]: Start difference. First operand 4741 states and 6745 transitions. Second operand 8 states. [2018-11-18 15:43:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:16,846 INFO L93 Difference]: Finished difference Result 9058 states and 13061 transitions. [2018-11-18 15:43:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:43:16,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-11-18 15:43:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:16,853 INFO L225 Difference]: With dead ends: 9058 [2018-11-18 15:43:16,853 INFO L226 Difference]: Without dead ends: 4845 [2018-11-18 15:43:16,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:43:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2018-11-18 15:43:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4797. [2018-11-18 15:43:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4797 states. [2018-11-18 15:43:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4797 states to 4797 states and 6801 transitions. [2018-11-18 15:43:17,089 INFO L78 Accepts]: Start accepts. Automaton has 4797 states and 6801 transitions. Word has length 76 [2018-11-18 15:43:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:17,089 INFO L480 AbstractCegarLoop]: Abstraction has 4797 states and 6801 transitions. [2018-11-18 15:43:17,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:43:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4797 states and 6801 transitions. [2018-11-18 15:43:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 15:43:17,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:17,090 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:17,090 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:17,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1893783966, now seen corresponding path program 1 times [2018-11-18 15:43:17,091 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:17,091 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:17,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:17,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:17,346 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-18 15:43:17,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:17,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:43:17,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:43:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:43:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:43:17,348 INFO L87 Difference]: Start difference. First operand 4797 states and 6801 transitions. Second operand 8 states. [2018-11-18 15:43:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:20,297 INFO L93 Difference]: Finished difference Result 9214 states and 13358 transitions. [2018-11-18 15:43:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:43:20,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-11-18 15:43:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:20,305 INFO L225 Difference]: With dead ends: 9214 [2018-11-18 15:43:20,305 INFO L226 Difference]: Without dead ends: 4945 [2018-11-18 15:43:20,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:43:20,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2018-11-18 15:43:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4825. [2018-11-18 15:43:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2018-11-18 15:43:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6844 transitions. [2018-11-18 15:43:20,516 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6844 transitions. Word has length 76 [2018-11-18 15:43:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:20,517 INFO L480 AbstractCegarLoop]: Abstraction has 4825 states and 6844 transitions. [2018-11-18 15:43:20,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:43:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6844 transitions. [2018-11-18 15:43:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-18 15:43:20,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:20,518 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:43:20,518 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:20,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:20,518 INFO L82 PathProgramCache]: Analyzing trace with hash 693369353, now seen corresponding path program 1 times [2018-11-18 15:43:20,519 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:20,519 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:20,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:43:20,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:20,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:20,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:43:20,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:43:20,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:43:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:43:20,759 INFO L87 Difference]: Start difference. First operand 4825 states and 6844 transitions. Second operand 8 states. [2018-11-18 15:43:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:21,005 INFO L93 Difference]: Finished difference Result 4849 states and 6882 transitions. [2018-11-18 15:43:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:43:21,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-18 15:43:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:21,012 INFO L225 Difference]: With dead ends: 4849 [2018-11-18 15:43:21,012 INFO L226 Difference]: Without dead ends: 4833 [2018-11-18 15:43:21,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:43:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2018-11-18 15:43:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4825. [2018-11-18 15:43:21,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2018-11-18 15:43:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6844 transitions. [2018-11-18 15:43:21,216 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6844 transitions. Word has length 78 [2018-11-18 15:43:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:21,216 INFO L480 AbstractCegarLoop]: Abstraction has 4825 states and 6844 transitions. [2018-11-18 15:43:21,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:43:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6844 transitions. [2018-11-18 15:43:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 15:43:21,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:21,217 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:21,217 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:21,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash -690631208, now seen corresponding path program 1 times [2018-11-18 15:43:21,218 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:21,218 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:21,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:21,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:21,470 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-18 15:43:21,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:21,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:21,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:43:21,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:43:21,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:43:21,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:43:21,473 INFO L87 Difference]: Start difference. First operand 4825 states and 6844 transitions. Second operand 9 states. [2018-11-18 15:43:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:36,137 INFO L93 Difference]: Finished difference Result 4844 states and 6865 transitions. [2018-11-18 15:43:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:43:36,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-11-18 15:43:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:36,143 INFO L225 Difference]: With dead ends: 4844 [2018-11-18 15:43:36,143 INFO L226 Difference]: Without dead ends: 4820 [2018-11-18 15:43:36,145 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:43:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2018-11-18 15:43:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4820. [2018-11-18 15:43:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4820 states. [2018-11-18 15:43:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 6837 transitions. [2018-11-18 15:43:36,390 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 6837 transitions. Word has length 75 [2018-11-18 15:43:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:36,390 INFO L480 AbstractCegarLoop]: Abstraction has 4820 states and 6837 transitions. [2018-11-18 15:43:36,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:43:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 6837 transitions. [2018-11-18 15:43:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 15:43:36,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:36,391 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:36,391 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:36,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash -914822560, now seen corresponding path program 1 times [2018-11-18 15:43:36,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:36,392 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:36,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:36,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:36,648 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-18 15:43:36,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:36,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:36,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:43:36,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:43:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:43:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:43:36,651 INFO L87 Difference]: Start difference. First operand 4820 states and 6837 transitions. Second operand 9 states. [2018-11-18 15:43:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:51,326 INFO L93 Difference]: Finished difference Result 4839 states and 6858 transitions. [2018-11-18 15:43:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:43:51,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-11-18 15:43:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:51,333 INFO L225 Difference]: With dead ends: 4839 [2018-11-18 15:43:51,333 INFO L226 Difference]: Without dead ends: 4816 [2018-11-18 15:43:51,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:43:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2018-11-18 15:43:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4816. [2018-11-18 15:43:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4816 states. [2018-11-18 15:43:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 6831 transitions. [2018-11-18 15:43:51,542 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 6831 transitions. Word has length 75 [2018-11-18 15:43:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:51,542 INFO L480 AbstractCegarLoop]: Abstraction has 4816 states and 6831 transitions. [2018-11-18 15:43:51,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:43:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 6831 transitions. [2018-11-18 15:43:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 15:43:51,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:51,543 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:43:51,543 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:51,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:51,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1864064637, now seen corresponding path program 1 times [2018-11-18 15:43:51,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:51,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:51,845 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-18 15:43:51,845 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:51,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:51,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:43:51,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:43:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:43:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:43:51,847 INFO L87 Difference]: Start difference. First operand 4816 states and 6831 transitions. Second operand 9 states. [2018-11-18 15:44:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:06,537 INFO L93 Difference]: Finished difference Result 4835 states and 6852 transitions. [2018-11-18 15:44:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:44:06,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-11-18 15:44:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:06,544 INFO L225 Difference]: With dead ends: 4835 [2018-11-18 15:44:06,544 INFO L226 Difference]: Without dead ends: 4812 [2018-11-18 15:44:06,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:44:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2018-11-18 15:44:06,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2018-11-18 15:44:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4812 states. [2018-11-18 15:44:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 6825 transitions. [2018-11-18 15:44:06,749 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 6825 transitions. Word has length 76 [2018-11-18 15:44:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:06,749 INFO L480 AbstractCegarLoop]: Abstraction has 4812 states and 6825 transitions. [2018-11-18 15:44:06,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:44:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 6825 transitions. [2018-11-18 15:44:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 15:44:06,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:06,750 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:44:06,750 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:06,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:06,750 INFO L82 PathProgramCache]: Analyzing trace with hash 992171930, now seen corresponding path program 1 times [2018-11-18 15:44:06,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:06,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:06,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:07,009 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-18 15:44:07,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:07,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:07,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:07,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:07,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:07,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:07,012 INFO L87 Difference]: Start difference. First operand 4812 states and 6825 transitions. Second operand 8 states. [2018-11-18 15:44:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:19,595 INFO L93 Difference]: Finished difference Result 4831 states and 6856 transitions. [2018-11-18 15:44:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:44:19,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-11-18 15:44:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:19,602 INFO L225 Difference]: With dead ends: 4831 [2018-11-18 15:44:19,602 INFO L226 Difference]: Without dead ends: 4817 [2018-11-18 15:44:19,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:44:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states. [2018-11-18 15:44:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 4809. [2018-11-18 15:44:19,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4809 states. [2018-11-18 15:44:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6820 transitions. [2018-11-18 15:44:19,831 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6820 transitions. Word has length 77 [2018-11-18 15:44:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:19,831 INFO L480 AbstractCegarLoop]: Abstraction has 4809 states and 6820 transitions. [2018-11-18 15:44:19,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6820 transitions. [2018-11-18 15:44:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 15:44:19,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:19,832 INFO L375 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, 1, 1, 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-18 15:44:19,832 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:19,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1858580195, now seen corresponding path program 1 times [2018-11-18 15:44:19,833 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:19,833 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:19,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:20,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:20,113 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-18 15:44:20,113 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:20,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:20,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:44:20,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:44:20,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:44:20,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:44:20,116 INFO L87 Difference]: Start difference. First operand 4809 states and 6820 transitions. Second operand 5 states. [2018-11-18 15:44:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:20,285 INFO L93 Difference]: Finished difference Result 6898 states and 9797 transitions. [2018-11-18 15:44:20,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:44:20,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-11-18 15:44:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:20,290 INFO L225 Difference]: With dead ends: 6898 [2018-11-18 15:44:20,290 INFO L226 Difference]: Without dead ends: 3579 [2018-11-18 15:44:20,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:44:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2018-11-18 15:44:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3558. [2018-11-18 15:44:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3558 states. [2018-11-18 15:44:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5013 transitions. [2018-11-18 15:44:20,451 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5013 transitions. Word has length 84 [2018-11-18 15:44:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:20,451 INFO L480 AbstractCegarLoop]: Abstraction has 3558 states and 5013 transitions. [2018-11-18 15:44:20,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:44:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5013 transitions. [2018-11-18 15:44:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:44:20,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:20,452 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:44:20,452 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:20,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash -61314031, now seen corresponding path program 1 times [2018-11-18 15:44:20,453 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:20,453 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:20,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:20,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:20,702 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-18 15:44:20,702 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:20,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:20,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:20,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:20,704 INFO L87 Difference]: Start difference. First operand 3558 states and 5013 transitions. Second operand 8 states. [2018-11-18 15:44:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:22,423 INFO L93 Difference]: Finished difference Result 3682 states and 5161 transitions. [2018-11-18 15:44:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:44:22,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2018-11-18 15:44:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:22,428 INFO L225 Difference]: With dead ends: 3682 [2018-11-18 15:44:22,428 INFO L226 Difference]: Without dead ends: 3666 [2018-11-18 15:44:22,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:44:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2018-11-18 15:44:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3560. [2018-11-18 15:44:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2018-11-18 15:44:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 5015 transitions. [2018-11-18 15:44:22,587 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 5015 transitions. Word has length 80 [2018-11-18 15:44:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:22,587 INFO L480 AbstractCegarLoop]: Abstraction has 3560 states and 5015 transitions. [2018-11-18 15:44:22,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:22,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 5015 transitions. [2018-11-18 15:44:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 15:44:22,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:22,588 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:44:22,588 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:22,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:22,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1990963368, now seen corresponding path program 1 times [2018-11-18 15:44:22,589 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:22,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:22,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:44:22,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:22,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:22,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:44:22,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:44:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:44:22,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:44:22,833 INFO L87 Difference]: Start difference. First operand 3560 states and 5015 transitions. Second operand 3 states. [2018-11-18 15:44:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:26,798 INFO L93 Difference]: Finished difference Result 6832 states and 9671 transitions. [2018-11-18 15:44:26,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:44:26,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-18 15:44:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:26,808 INFO L225 Difference]: With dead ends: 6832 [2018-11-18 15:44:26,808 INFO L226 Difference]: Without dead ends: 3646 [2018-11-18 15:44:26,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-18 15:44:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2018-11-18 15:44:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3570. [2018-11-18 15:44:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2018-11-18 15:44:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 5025 transitions. [2018-11-18 15:44:26,975 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 5025 transitions. Word has length 83 [2018-11-18 15:44:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:26,976 INFO L480 AbstractCegarLoop]: Abstraction has 3570 states and 5025 transitions. [2018-11-18 15:44:26,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:44:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 5025 transitions. [2018-11-18 15:44:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:44:26,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:26,977 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:44:26,977 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:26,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash 175553638, now seen corresponding path program 1 times [2018-11-18 15:44:26,978 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:26,979 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:27,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:27,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:27,241 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-18 15:44:27,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:27,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:27,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:44:27,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:44:27,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:44:27,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:44:27,243 INFO L87 Difference]: Start difference. First operand 3570 states and 5025 transitions. Second operand 6 states. [2018-11-18 15:44:28,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:28,659 INFO L93 Difference]: Finished difference Result 3686 states and 5165 transitions. [2018-11-18 15:44:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:44:28,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-18 15:44:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:28,664 INFO L225 Difference]: With dead ends: 3686 [2018-11-18 15:44:28,664 INFO L226 Difference]: Without dead ends: 3670 [2018-11-18 15:44:28,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:44:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2018-11-18 15:44:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3570. [2018-11-18 15:44:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3570 states. [2018-11-18 15:44:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 5025 transitions. [2018-11-18 15:44:28,829 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 5025 transitions. Word has length 80 [2018-11-18 15:44:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:28,829 INFO L480 AbstractCegarLoop]: Abstraction has 3570 states and 5025 transitions. [2018-11-18 15:44:28,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:44:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 5025 transitions. [2018-11-18 15:44:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 15:44:28,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:28,830 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:44:28,830 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:28,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash -927658330, now seen corresponding path program 1 times [2018-11-18 15:44:28,831 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:28,831 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:29,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 15:44:29,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:29,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:29,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:44:29,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:44:29,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:44:29,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:44:29,091 INFO L87 Difference]: Start difference. First operand 3570 states and 5025 transitions. Second operand 4 states. [2018-11-18 15:44:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:32,303 INFO L93 Difference]: Finished difference Result 11484 states and 16860 transitions. [2018-11-18 15:44:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:44:32,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-18 15:44:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:32,315 INFO L225 Difference]: With dead ends: 11484 [2018-11-18 15:44:32,315 INFO L226 Difference]: Without dead ends: 7954 [2018-11-18 15:44:32,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-18 15:44:32,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7954 states. [2018-11-18 15:44:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7954 to 7699. [2018-11-18 15:44:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7699 states. [2018-11-18 15:44:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7699 states to 7699 states and 11215 transitions. [2018-11-18 15:44:32,688 INFO L78 Accepts]: Start accepts. Automaton has 7699 states and 11215 transitions. Word has length 84 [2018-11-18 15:44:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:32,688 INFO L480 AbstractCegarLoop]: Abstraction has 7699 states and 11215 transitions. [2018-11-18 15:44:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:44:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7699 states and 11215 transitions. [2018-11-18 15:44:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-18 15:44:32,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:32,690 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:44:32,690 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:32,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -446578072, now seen corresponding path program 1 times [2018-11-18 15:44:32,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:32,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:32,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:44:32,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:32,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:44:32,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:44:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:44:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:44:32,948 INFO L87 Difference]: Start difference. First operand 7699 states and 11215 transitions. Second operand 5 states. [2018-11-18 15:44:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:33,038 INFO L93 Difference]: Finished difference Result 8299 states and 11957 transitions. [2018-11-18 15:44:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:44:33,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-11-18 15:44:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:33,041 INFO L225 Difference]: With dead ends: 8299 [2018-11-18 15:44:33,041 INFO L226 Difference]: Without dead ends: 840 [2018-11-18 15:44:33,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:44:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-11-18 15:44:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 785. [2018-11-18 15:44:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-11-18 15:44:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 966 transitions. [2018-11-18 15:44:33,088 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 966 transitions. Word has length 84 [2018-11-18 15:44:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:33,089 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 966 transitions. [2018-11-18 15:44:33,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:44:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 966 transitions. [2018-11-18 15:44:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 15:44:33,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:33,090 INFO L375 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, 1, 1, 1, 1, 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-18 15:44:33,090 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:33,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash -368780126, now seen corresponding path program 1 times [2018-11-18 15:44:33,091 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:33,092 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:33,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:33,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:33,381 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-18 15:44:33,381 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:33,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:33,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:33,384 INFO L87 Difference]: Start difference. First operand 785 states and 966 transitions. Second operand 8 states. [2018-11-18 15:44:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:36,586 INFO L93 Difference]: Finished difference Result 853 states and 1051 transitions. [2018-11-18 15:44:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:44:36,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2018-11-18 15:44:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:36,587 INFO L225 Difference]: With dead ends: 853 [2018-11-18 15:44:36,588 INFO L226 Difference]: Without dead ends: 802 [2018-11-18 15:44:36,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:44:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-18 15:44:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 785. [2018-11-18 15:44:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-11-18 15:44:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 966 transitions. [2018-11-18 15:44:36,626 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 966 transitions. Word has length 86 [2018-11-18 15:44:36,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:36,626 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 966 transitions. [2018-11-18 15:44:36,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 966 transitions. [2018-11-18 15:44:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-18 15:44:36,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:36,627 INFO L375 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, 1, 1, 1, 1, 1, 1, 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-18 15:44:36,627 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:36,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1438903992, now seen corresponding path program 1 times [2018-11-18 15:44:36,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:36,628 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:36,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:36,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:36,899 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-18 15:44:36,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:44:36,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:44:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:44:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:44:36,902 INFO L87 Difference]: Start difference. First operand 785 states and 966 transitions. Second operand 4 states. [2018-11-18 15:44:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:39,400 INFO L93 Difference]: Finished difference Result 1104 states and 1368 transitions. [2018-11-18 15:44:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:44:39,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-18 15:44:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:39,403 INFO L225 Difference]: With dead ends: 1104 [2018-11-18 15:44:39,403 INFO L226 Difference]: Without dead ends: 785 [2018-11-18 15:44:39,404 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:44:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-18 15:44:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2018-11-18 15:44:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-11-18 15:44:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 965 transitions. [2018-11-18 15:44:39,444 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 965 transitions. Word has length 88 [2018-11-18 15:44:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:39,444 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 965 transitions. [2018-11-18 15:44:39,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:44:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 965 transitions. [2018-11-18 15:44:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 15:44:39,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:39,446 INFO L375 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, 1, 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-18 15:44:39,446 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:39,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:39,446 INFO L82 PathProgramCache]: Analyzing trace with hash -761627932, now seen corresponding path program 1 times [2018-11-18 15:44:39,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:39,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:39,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:39,753 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-18 15:44:39,753 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:44:39,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:44:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:44:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:44:39,756 INFO L87 Difference]: Start difference. First operand 785 states and 965 transitions. Second operand 6 states. [2018-11-18 15:44:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:41,943 INFO L93 Difference]: Finished difference Result 815 states and 998 transitions. [2018-11-18 15:44:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:44:41,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 15:44:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:41,944 INFO L225 Difference]: With dead ends: 815 [2018-11-18 15:44:41,945 INFO L226 Difference]: Without dead ends: 785 [2018-11-18 15:44:41,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:44:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-18 15:44:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2018-11-18 15:44:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-11-18 15:44:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 960 transitions. [2018-11-18 15:44:42,009 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 960 transitions. Word has length 83 [2018-11-18 15:44:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:42,009 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 960 transitions. [2018-11-18 15:44:42,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:44:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 960 transitions. [2018-11-18 15:44:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 15:44:42,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:42,011 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:42,011 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:42,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1997830221, now seen corresponding path program 1 times [2018-11-18 15:44:42,012 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:42,012 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:42,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:42,302 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-18 15:44:42,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:42,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:42,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:44:42,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:44:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:44:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:44:42,306 INFO L87 Difference]: Start difference. First operand 785 states and 960 transitions. Second operand 3 states. [2018-11-18 15:44:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:42,359 INFO L93 Difference]: Finished difference Result 1122 states and 1384 transitions. [2018-11-18 15:44:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:44:42,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-11-18 15:44:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:42,361 INFO L225 Difference]: With dead ends: 1122 [2018-11-18 15:44:42,361 INFO L226 Difference]: Without dead ends: 803 [2018-11-18 15:44:42,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 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-18 15:44:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-18 15:44:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 788. [2018-11-18 15:44:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-18 15:44:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 963 transitions. [2018-11-18 15:44:42,400 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 963 transitions. Word has length 90 [2018-11-18 15:44:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:42,400 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 963 transitions. [2018-11-18 15:44:42,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:44:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 963 transitions. [2018-11-18 15:44:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-18 15:44:42,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:42,401 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:42,401 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:42,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1223886214, now seen corresponding path program 1 times [2018-11-18 15:44:42,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:42,402 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:42,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:42,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:42,656 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-18 15:44:42,656 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:42,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:42,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:44:42,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:44:42,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:44:42,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:44:42,662 INFO L87 Difference]: Start difference. First operand 788 states and 963 transitions. Second operand 3 states. [2018-11-18 15:44:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:42,718 INFO L93 Difference]: Finished difference Result 1128 states and 1390 transitions. [2018-11-18 15:44:42,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:44:42,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-11-18 15:44:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:42,720 INFO L225 Difference]: With dead ends: 1128 [2018-11-18 15:44:42,721 INFO L226 Difference]: Without dead ends: 806 [2018-11-18 15:44:42,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-18 15:44:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-11-18 15:44:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 788. [2018-11-18 15:44:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-11-18 15:44:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 963 transitions. [2018-11-18 15:44:42,760 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 963 transitions. Word has length 91 [2018-11-18 15:44:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:42,761 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 963 transitions. [2018-11-18 15:44:42,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:44:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 963 transitions. [2018-11-18 15:44:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 15:44:42,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:42,762 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:42,762 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:42,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1261109552, now seen corresponding path program 1 times [2018-11-18 15:44:42,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:42,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:43,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:43,061 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-18 15:44:43,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:43,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:43,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:44:43,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:44:43,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:44:43,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:44:43,064 INFO L87 Difference]: Start difference. First operand 788 states and 963 transitions. Second operand 3 states. [2018-11-18 15:44:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:45,215 INFO L93 Difference]: Finished difference Result 1243 states and 1530 transitions. [2018-11-18 15:44:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:44:45,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-11-18 15:44:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:45,218 INFO L225 Difference]: With dead ends: 1243 [2018-11-18 15:44:45,218 INFO L226 Difference]: Without dead ends: 927 [2018-11-18 15:44:45,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:44:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-11-18 15:44:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 892. [2018-11-18 15:44:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-11-18 15:44:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1094 transitions. [2018-11-18 15:44:45,265 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1094 transitions. Word has length 96 [2018-11-18 15:44:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:45,265 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 1094 transitions. [2018-11-18 15:44:45,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:44:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1094 transitions. [2018-11-18 15:44:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 15:44:45,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:45,266 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:45,266 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:45,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash -37290024, now seen corresponding path program 1 times [2018-11-18 15:44:45,267 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:45,267 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:45,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:45,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:45,540 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-18 15:44:45,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:45,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:45,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:45,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:45,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:45,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:45,543 INFO L87 Difference]: Start difference. First operand 892 states and 1094 transitions. Second operand 8 states. [2018-11-18 15:44:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:47,565 INFO L93 Difference]: Finished difference Result 1052 states and 1285 transitions. [2018-11-18 15:44:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:44:47,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-11-18 15:44:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:47,568 INFO L225 Difference]: With dead ends: 1052 [2018-11-18 15:44:47,568 INFO L226 Difference]: Without dead ends: 890 [2018-11-18 15:44:47,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:47,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-11-18 15:44:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2018-11-18 15:44:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-11-18 15:44:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1090 transitions. [2018-11-18 15:44:47,615 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1090 transitions. Word has length 89 [2018-11-18 15:44:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:47,615 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1090 transitions. [2018-11-18 15:44:47,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1090 transitions. [2018-11-18 15:44:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 15:44:47,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:47,617 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:47,617 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:47,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1274452985, now seen corresponding path program 1 times [2018-11-18 15:44:47,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:47,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:47,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:47,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:47,891 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-18 15:44:47,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:47,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:47,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:47,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:47,893 INFO L87 Difference]: Start difference. First operand 890 states and 1090 transitions. Second operand 8 states. [2018-11-18 15:44:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:52,073 INFO L93 Difference]: Finished difference Result 957 states and 1174 transitions. [2018-11-18 15:44:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:44:52,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-11-18 15:44:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:52,075 INFO L225 Difference]: With dead ends: 957 [2018-11-18 15:44:52,075 INFO L226 Difference]: Without dead ends: 906 [2018-11-18 15:44:52,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:44:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-11-18 15:44:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 889. [2018-11-18 15:44:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-11-18 15:44:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1089 transitions. [2018-11-18 15:44:52,121 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1089 transitions. Word has length 99 [2018-11-18 15:44:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:52,121 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1089 transitions. [2018-11-18 15:44:52,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1089 transitions. [2018-11-18 15:44:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-18 15:44:52,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:52,122 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:52,122 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:52,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash 675625977, now seen corresponding path program 1 times [2018-11-18 15:44:52,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:52,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:52,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:52,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:52,407 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-18 15:44:52,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:52,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:52,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:52,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:52,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:52,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:52,410 INFO L87 Difference]: Start difference. First operand 889 states and 1089 transitions. Second operand 8 states. [2018-11-18 15:44:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:53,909 INFO L93 Difference]: Finished difference Result 956 states and 1173 transitions. [2018-11-18 15:44:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:44:53,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-11-18 15:44:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:53,911 INFO L225 Difference]: With dead ends: 956 [2018-11-18 15:44:53,911 INFO L226 Difference]: Without dead ends: 905 [2018-11-18 15:44:53,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:44:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-11-18 15:44:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 888. [2018-11-18 15:44:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-18 15:44:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1088 transitions. [2018-11-18 15:44:53,957 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1088 transitions. Word has length 89 [2018-11-18 15:44:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:53,957 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1088 transitions. [2018-11-18 15:44:53,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1088 transitions. [2018-11-18 15:44:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 15:44:53,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:53,958 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:53,958 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:53,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1072509969, now seen corresponding path program 1 times [2018-11-18 15:44:53,959 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:53,959 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:53,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:54,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:54,209 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-18 15:44:54,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:54,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:54,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:44:54,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:44:54,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:44:54,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:44:54,211 INFO L87 Difference]: Start difference. First operand 888 states and 1088 transitions. Second operand 8 states. [2018-11-18 15:44:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:56,385 INFO L93 Difference]: Finished difference Result 919 states and 1122 transitions. [2018-11-18 15:44:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:44:56,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-11-18 15:44:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:56,387 INFO L225 Difference]: With dead ends: 919 [2018-11-18 15:44:56,387 INFO L226 Difference]: Without dead ends: 886 [2018-11-18 15:44:56,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:44:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-18 15:44:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-11-18 15:44:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-18 15:44:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1085 transitions. [2018-11-18 15:44:56,433 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1085 transitions. Word has length 90 [2018-11-18 15:44:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:56,433 INFO L480 AbstractCegarLoop]: Abstraction has 886 states and 1085 transitions. [2018-11-18 15:44:56,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:44:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1085 transitions. [2018-11-18 15:44:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 15:44:56,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:56,434 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:56,434 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:56,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:56,434 INFO L82 PathProgramCache]: Analyzing trace with hash 177750591, now seen corresponding path program 1 times [2018-11-18 15:44:56,435 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:56,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:56,668 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-18 15:44:56,668 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:56,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:56,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:44:56,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:44:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:44:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:44:56,670 INFO L87 Difference]: Start difference. First operand 886 states and 1085 transitions. Second operand 5 states. [2018-11-18 15:44:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:56,739 INFO L93 Difference]: Finished difference Result 940 states and 1144 transitions. [2018-11-18 15:44:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:44:56,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-18 15:44:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:56,741 INFO L225 Difference]: With dead ends: 940 [2018-11-18 15:44:56,741 INFO L226 Difference]: Without dead ends: 884 [2018-11-18 15:44:56,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:44:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-11-18 15:44:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2018-11-18 15:44:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-11-18 15:44:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1082 transitions. [2018-11-18 15:44:56,786 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1082 transitions. Word has length 92 [2018-11-18 15:44:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:44:56,786 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1082 transitions. [2018-11-18 15:44:56,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:44:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1082 transitions. [2018-11-18 15:44:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-18 15:44:56,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:44:56,787 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:44:56,787 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:44:56,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:44:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -13299946, now seen corresponding path program 1 times [2018-11-18 15:44:56,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:44:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:56,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:44:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:44:56,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:44:57,084 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-18 15:44:57,084 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:44:57,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:44:57,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:44:57,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:44:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:44:57,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:44:57,087 INFO L87 Difference]: Start difference. First operand 884 states and 1082 transitions. Second operand 11 states. [2018-11-18 15:44:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:44:59,984 INFO L93 Difference]: Finished difference Result 917 states and 1118 transitions. [2018-11-18 15:44:59,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:44:59,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-11-18 15:44:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:44:59,986 INFO L225 Difference]: With dead ends: 917 [2018-11-18 15:44:59,986 INFO L226 Difference]: Without dead ends: 886 [2018-11-18 15:44:59,986 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:44:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-18 15:45:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2018-11-18 15:45:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-11-18 15:45:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1081 transitions. [2018-11-18 15:45:00,031 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1081 transitions. Word has length 93 [2018-11-18 15:45:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:00,031 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1081 transitions. [2018-11-18 15:45:00,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:45:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1081 transitions. [2018-11-18 15:45:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-18 15:45:00,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:00,032 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:00,032 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:00,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1948284359, now seen corresponding path program 1 times [2018-11-18 15:45:00,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:00,033 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:00,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:00,290 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-18 15:45:00,290 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:45:00,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:45:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:45:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:45:00,293 INFO L87 Difference]: Start difference. First operand 884 states and 1081 transitions. Second operand 6 states. [2018-11-18 15:45:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:00,390 INFO L93 Difference]: Finished difference Result 1269 states and 1555 transitions. [2018-11-18 15:45:00,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:45:00,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-11-18 15:45:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:00,393 INFO L225 Difference]: With dead ends: 1269 [2018-11-18 15:45:00,393 INFO L226 Difference]: Without dead ends: 896 [2018-11-18 15:45:00,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:45:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2018-11-18 15:45:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 884. [2018-11-18 15:45:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-11-18 15:45:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1079 transitions. [2018-11-18 15:45:00,438 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1079 transitions. Word has length 107 [2018-11-18 15:45:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:00,439 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1079 transitions. [2018-11-18 15:45:00,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:45:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1079 transitions. [2018-11-18 15:45:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-18 15:45:00,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:00,440 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:00,440 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:00,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1999652003, now seen corresponding path program 1 times [2018-11-18 15:45:00,441 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:00,441 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:00,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:00,711 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-18 15:45:00,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:00,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:00,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:45:00,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:45:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:45:00,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:00,714 INFO L87 Difference]: Start difference. First operand 884 states and 1079 transitions. Second operand 9 states. [2018-11-18 15:45:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:15,176 INFO L93 Difference]: Finished difference Result 903 states and 1099 transitions. [2018-11-18 15:45:15,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:45:15,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-11-18 15:45:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:15,178 INFO L225 Difference]: With dead ends: 903 [2018-11-18 15:45:15,178 INFO L226 Difference]: Without dead ends: 841 [2018-11-18 15:45:15,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-11-18 15:45:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2018-11-18 15:45:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-11-18 15:45:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1030 transitions. [2018-11-18 15:45:15,222 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1030 transitions. Word has length 96 [2018-11-18 15:45:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1030 transitions. [2018-11-18 15:45:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:45:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1030 transitions. [2018-11-18 15:45:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 15:45:15,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:15,223 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:15,223 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:15,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1859367443, now seen corresponding path program 1 times [2018-11-18 15:45:15,224 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:15,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:15,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:15,517 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-18 15:45:15,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:15,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:15,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:45:15,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:45:15,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:45:15,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:45:15,521 INFO L87 Difference]: Start difference. First operand 841 states and 1030 transitions. Second operand 6 states. [2018-11-18 15:45:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:17,643 INFO L93 Difference]: Finished difference Result 1211 states and 1473 transitions. [2018-11-18 15:45:17,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:45:17,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-11-18 15:45:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:17,645 INFO L225 Difference]: With dead ends: 1211 [2018-11-18 15:45:17,645 INFO L226 Difference]: Without dead ends: 853 [2018-11-18 15:45:17,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:45:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-11-18 15:45:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 841. [2018-11-18 15:45:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-11-18 15:45:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1029 transitions. [2018-11-18 15:45:17,689 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1029 transitions. Word has length 104 [2018-11-18 15:45:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:17,690 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1029 transitions. [2018-11-18 15:45:17,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:45:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1029 transitions. [2018-11-18 15:45:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 15:45:17,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:17,690 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:17,691 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:17,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 103456982, now seen corresponding path program 1 times [2018-11-18 15:45:17,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:17,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:17,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:17,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:18,004 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-18 15:45:18,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:18,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:18,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:45:18,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:45:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:45:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:18,006 INFO L87 Difference]: Start difference. First operand 841 states and 1029 transitions. Second operand 11 states. [2018-11-18 15:45:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:19,966 INFO L93 Difference]: Finished difference Result 874 states and 1065 transitions. [2018-11-18 15:45:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:45:19,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2018-11-18 15:45:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:19,968 INFO L225 Difference]: With dead ends: 874 [2018-11-18 15:45:19,968 INFO L226 Difference]: Without dead ends: 843 [2018-11-18 15:45:19,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:45:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-11-18 15:45:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 838. [2018-11-18 15:45:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-18 15:45:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1025 transitions. [2018-11-18 15:45:20,011 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1025 transitions. Word has length 103 [2018-11-18 15:45:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:20,012 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1025 transitions. [2018-11-18 15:45:20,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:45:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1025 transitions. [2018-11-18 15:45:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 15:45:20,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:20,013 INFO L375 BasicCegarLoop]: trace histogram [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-18 15:45:20,013 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:20,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1172043244, now seen corresponding path program 1 times [2018-11-18 15:45:20,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:20,015 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:20,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:20,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:45:20,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:20,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:20,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:45:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:45:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:45:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:45:20,259 INFO L87 Difference]: Start difference. First operand 838 states and 1025 transitions. Second operand 5 states. [2018-11-18 15:45:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:20,953 INFO L93 Difference]: Finished difference Result 918 states and 1127 transitions. [2018-11-18 15:45:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:45:20,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-18 15:45:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:20,955 INFO L225 Difference]: With dead ends: 918 [2018-11-18 15:45:20,955 INFO L226 Difference]: Without dead ends: 858 [2018-11-18 15:45:20,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:45:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-18 15:45:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 854. [2018-11-18 15:45:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-18 15:45:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1044 transitions. [2018-11-18 15:45:20,999 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1044 transitions. Word has length 105 [2018-11-18 15:45:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:20,999 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1044 transitions. [2018-11-18 15:45:20,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:45:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1044 transitions. [2018-11-18 15:45:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 15:45:21,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:21,000 INFO L375 BasicCegarLoop]: trace histogram [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-18 15:45:21,000 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:21,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1185920845, now seen corresponding path program 1 times [2018-11-18 15:45:21,001 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:21,001 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:21,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:21,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:45:21,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:21,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:45:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:45:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:45:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:45:21,247 INFO L87 Difference]: Start difference. First operand 854 states and 1044 transitions. Second operand 5 states. [2018-11-18 15:45:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:23,353 INFO L93 Difference]: Finished difference Result 914 states and 1115 transitions. [2018-11-18 15:45:23,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:45:23,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-11-18 15:45:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:23,354 INFO L225 Difference]: With dead ends: 914 [2018-11-18 15:45:23,354 INFO L226 Difference]: Without dead ends: 830 [2018-11-18 15:45:23,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:45:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2018-11-18 15:45:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 816. [2018-11-18 15:45:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2018-11-18 15:45:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 988 transitions. [2018-11-18 15:45:23,397 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 988 transitions. Word has length 105 [2018-11-18 15:45:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:23,397 INFO L480 AbstractCegarLoop]: Abstraction has 816 states and 988 transitions. [2018-11-18 15:45:23,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:45:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 988 transitions. [2018-11-18 15:45:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 15:45:23,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:23,398 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:23,398 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:23,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash 689354202, now seen corresponding path program 1 times [2018-11-18 15:45:23,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:23,399 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:23,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:23,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:23,669 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-18 15:45:23,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:23,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:23,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:45:23,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:45:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:45:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:45:23,672 INFO L87 Difference]: Start difference. First operand 816 states and 988 transitions. Second operand 8 states. [2018-11-18 15:45:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:24,276 INFO L93 Difference]: Finished difference Result 872 states and 1050 transitions. [2018-11-18 15:45:24,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:45:24,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-18 15:45:24,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:24,278 INFO L225 Difference]: With dead ends: 872 [2018-11-18 15:45:24,278 INFO L226 Difference]: Without dead ends: 803 [2018-11-18 15:45:24,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-18 15:45:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2018-11-18 15:45:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-11-18 15:45:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 972 transitions. [2018-11-18 15:45:24,322 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 972 transitions. Word has length 105 [2018-11-18 15:45:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:24,322 INFO L480 AbstractCegarLoop]: Abstraction has 803 states and 972 transitions. [2018-11-18 15:45:24,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:45:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 972 transitions. [2018-11-18 15:45:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-18 15:45:24,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:24,323 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:24,323 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:24,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:24,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1235393119, now seen corresponding path program 1 times [2018-11-18 15:45:24,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:24,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:24,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:24,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:24,626 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-18 15:45:24,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:24,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:24,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:45:24,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:45:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:45:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:24,629 INFO L87 Difference]: Start difference. First operand 803 states and 972 transitions. Second operand 11 states. [2018-11-18 15:45:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:27,584 INFO L93 Difference]: Finished difference Result 833 states and 1005 transitions. [2018-11-18 15:45:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:45:27,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2018-11-18 15:45:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:27,586 INFO L225 Difference]: With dead ends: 833 [2018-11-18 15:45:27,586 INFO L226 Difference]: Without dead ends: 797 [2018-11-18 15:45:27,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:45:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-11-18 15:45:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2018-11-18 15:45:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-18 15:45:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 963 transitions. [2018-11-18 15:45:27,628 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 963 transitions. Word has length 116 [2018-11-18 15:45:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:27,628 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 963 transitions. [2018-11-18 15:45:27,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:45:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 963 transitions. [2018-11-18 15:45:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 15:45:27,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:27,629 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:27,629 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:27,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash 6814303, now seen corresponding path program 1 times [2018-11-18 15:45:27,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:27,630 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:27,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:27,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:27,951 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-18 15:45:27,951 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:45:27,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:45:27,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:45:27,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:27,954 INFO L87 Difference]: Start difference. First operand 797 states and 963 transitions. Second operand 11 states. [2018-11-18 15:45:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:30,341 INFO L93 Difference]: Finished difference Result 827 states and 996 transitions. [2018-11-18 15:45:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:45:30,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2018-11-18 15:45:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:30,343 INFO L225 Difference]: With dead ends: 827 [2018-11-18 15:45:30,343 INFO L226 Difference]: Without dead ends: 757 [2018-11-18 15:45:30,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:45:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-18 15:45:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2018-11-18 15:45:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-18 15:45:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 901 transitions. [2018-11-18 15:45:30,386 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 901 transitions. Word has length 106 [2018-11-18 15:45:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:30,386 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 901 transitions. [2018-11-18 15:45:30,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:45:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 901 transitions. [2018-11-18 15:45:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 15:45:30,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:30,387 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:30,387 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:30,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1442505070, now seen corresponding path program 1 times [2018-11-18 15:45:30,388 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:30,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:30,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:30,669 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-18 15:45:30,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:30,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:30,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:45:30,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:45:30,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:45:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:45:30,672 INFO L87 Difference]: Start difference. First operand 757 states and 901 transitions. Second operand 5 states. [2018-11-18 15:45:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:43,029 INFO L93 Difference]: Finished difference Result 1132 states and 1359 transitions. [2018-11-18 15:45:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:45:43,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2018-11-18 15:45:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:43,032 INFO L225 Difference]: With dead ends: 1132 [2018-11-18 15:45:43,032 INFO L226 Difference]: Without dead ends: 732 [2018-11-18 15:45:43,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:45:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-18 15:45:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 707. [2018-11-18 15:45:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-11-18 15:45:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 832 transitions. [2018-11-18 15:45:43,092 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 832 transitions. Word has length 117 [2018-11-18 15:45:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:43,092 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 832 transitions. [2018-11-18 15:45:43,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:45:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 832 transitions. [2018-11-18 15:45:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 15:45:43,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:43,093 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:43,093 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:43,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:43,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1695551877, now seen corresponding path program 1 times [2018-11-18 15:45:43,094 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:43,094 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:43,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:43,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:43,421 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-18 15:45:43,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:43,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:43,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:45:43,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:45:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:45:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:43,424 INFO L87 Difference]: Start difference. First operand 707 states and 832 transitions. Second operand 9 states. [2018-11-18 15:45:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:43,634 INFO L93 Difference]: Finished difference Result 803 states and 937 transitions. [2018-11-18 15:45:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:45:43,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-11-18 15:45:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:43,636 INFO L225 Difference]: With dead ends: 803 [2018-11-18 15:45:43,636 INFO L226 Difference]: Without dead ends: 725 [2018-11-18 15:45:43,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:45:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-18 15:45:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 713. [2018-11-18 15:45:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-18 15:45:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 839 transitions. [2018-11-18 15:45:43,692 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 839 transitions. Word has length 125 [2018-11-18 15:45:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:43,692 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 839 transitions. [2018-11-18 15:45:43,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:45:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 839 transitions. [2018-11-18 15:45:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-18 15:45:43,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:43,693 INFO L375 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] [2018-11-18 15:45:43,694 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:43,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 63663102, now seen corresponding path program 1 times [2018-11-18 15:45:43,695 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:43,695 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:43,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:44,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:45:44,052 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:44,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:44,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:45:44,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:45:44,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:45:44,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:45:44,055 INFO L87 Difference]: Start difference. First operand 713 states and 839 transitions. Second operand 6 states. [2018-11-18 15:45:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:44,141 INFO L93 Difference]: Finished difference Result 755 states and 880 transitions. [2018-11-18 15:45:44,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:45:44,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-18 15:45:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:44,143 INFO L225 Difference]: With dead ends: 755 [2018-11-18 15:45:44,143 INFO L226 Difference]: Without dead ends: 645 [2018-11-18 15:45:44,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:45:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-11-18 15:45:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 529. [2018-11-18 15:45:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-18 15:45:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 607 transitions. [2018-11-18 15:45:44,170 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 607 transitions. Word has length 143 [2018-11-18 15:45:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:44,170 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 607 transitions. [2018-11-18 15:45:44,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:45:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 607 transitions. [2018-11-18 15:45:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 15:45:44,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:44,171 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:44,171 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:44,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash 744878200, now seen corresponding path program 1 times [2018-11-18 15:45:44,172 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:44,172 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:44,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:44,463 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-18 15:45:44,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:44,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:44,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:45:44,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:45:44,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:45:44,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:44,466 INFO L87 Difference]: Start difference. First operand 529 states and 607 transitions. Second operand 9 states. [2018-11-18 15:45:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:44,618 INFO L93 Difference]: Finished difference Result 616 states and 699 transitions. [2018-11-18 15:45:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:45:44,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2018-11-18 15:45:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:44,620 INFO L225 Difference]: With dead ends: 616 [2018-11-18 15:45:44,620 INFO L226 Difference]: Without dead ends: 538 [2018-11-18 15:45:44,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-11-18 15:45:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 520. [2018-11-18 15:45:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-18 15:45:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 594 transitions. [2018-11-18 15:45:44,647 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 594 transitions. Word has length 126 [2018-11-18 15:45:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:44,647 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 594 transitions. [2018-11-18 15:45:44,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:45:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 594 transitions. [2018-11-18 15:45:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 15:45:44,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:44,647 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:44,648 INFO L423 AbstractCegarLoop]: === Iteration 77 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:44,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash -714903759, now seen corresponding path program 1 times [2018-11-18 15:45:44,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:44,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:44,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:44,929 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-18 15:45:44,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:44,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:44,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:45:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:45:44,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:45:44,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:45:44,932 INFO L87 Difference]: Start difference. First operand 520 states and 594 transitions. Second operand 8 states. [2018-11-18 15:45:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:46,904 INFO L93 Difference]: Finished difference Result 522 states and 595 transitions. [2018-11-18 15:45:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:45:46,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 118 [2018-11-18 15:45:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:46,906 INFO L225 Difference]: With dead ends: 522 [2018-11-18 15:45:46,906 INFO L226 Difference]: Without dead ends: 371 [2018-11-18 15:45:46,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-18 15:45:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-11-18 15:45:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-18 15:45:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 427 transitions. [2018-11-18 15:45:46,927 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 427 transitions. Word has length 118 [2018-11-18 15:45:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:46,927 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 427 transitions. [2018-11-18 15:45:46,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:45:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 427 transitions. [2018-11-18 15:45:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 15:45:46,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:46,928 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:45:46,929 INFO L423 AbstractCegarLoop]: === Iteration 78 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:46,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:46,929 INFO L82 PathProgramCache]: Analyzing trace with hash -624881269, now seen corresponding path program 1 times [2018-11-18 15:45:46,930 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:46,930 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:46,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:47,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 15:45:47,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:47,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:45:47,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:45:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:45:47,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:45:47,184 INFO L87 Difference]: Start difference. First operand 371 states and 427 transitions. Second operand 8 states. [2018-11-18 15:45:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:48,797 INFO L93 Difference]: Finished difference Result 391 states and 449 transitions. [2018-11-18 15:45:48,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:45:48,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2018-11-18 15:45:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:48,798 INFO L225 Difference]: With dead ends: 391 [2018-11-18 15:45:48,798 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 15:45:48,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 15:45:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-18 15:45:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-18 15:45:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 410 transitions. [2018-11-18 15:45:48,819 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 410 transitions. Word has length 122 [2018-11-18 15:45:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:48,819 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 410 transitions. [2018-11-18 15:45:48,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:45:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 410 transitions. [2018-11-18 15:45:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 15:45:48,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:48,820 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:48,820 INFO L423 AbstractCegarLoop]: === Iteration 79 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:48,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:48,821 INFO L82 PathProgramCache]: Analyzing trace with hash -549216034, now seen corresponding path program 1 times [2018-11-18 15:45:48,822 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:48,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:49,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:49,160 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-18 15:45:49,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:49,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:49,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:45:49,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:45:49,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:45:49,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:49,163 INFO L87 Difference]: Start difference. First operand 356 states and 410 transitions. Second operand 11 states. [2018-11-18 15:45:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:51,341 INFO L93 Difference]: Finished difference Result 488 states and 564 transitions. [2018-11-18 15:45:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:45:51,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-11-18 15:45:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:51,342 INFO L225 Difference]: With dead ends: 488 [2018-11-18 15:45:51,342 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 15:45:51,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:45:51,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 15:45:51,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-18 15:45:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-18 15:45:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 409 transitions. [2018-11-18 15:45:51,361 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 409 transitions. Word has length 126 [2018-11-18 15:45:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:51,362 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 409 transitions. [2018-11-18 15:45:51,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:45:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 409 transitions. [2018-11-18 15:45:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-18 15:45:51,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:51,362 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:51,362 INFO L423 AbstractCegarLoop]: === Iteration 80 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:51,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1729821353, now seen corresponding path program 1 times [2018-11-18 15:45:51,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:51,364 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:51,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:51,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:51,635 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-18 15:45:51,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:51,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:51,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:45:51,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:45:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:45:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:45:51,638 INFO L87 Difference]: Start difference. First operand 356 states and 409 transitions. Second operand 7 states. [2018-11-18 15:45:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:51,893 INFO L93 Difference]: Finished difference Result 655 states and 754 transitions. [2018-11-18 15:45:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:45:51,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2018-11-18 15:45:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:51,895 INFO L225 Difference]: With dead ends: 655 [2018-11-18 15:45:51,895 INFO L226 Difference]: Without dead ends: 596 [2018-11-18 15:45:51,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:45:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-11-18 15:45:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 333. [2018-11-18 15:45:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-18 15:45:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2018-11-18 15:45:51,917 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 135 [2018-11-18 15:45:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2018-11-18 15:45:51,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:45:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2018-11-18 15:45:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 15:45:51,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:51,917 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-11-18 15:45:51,918 INFO L423 AbstractCegarLoop]: === Iteration 81 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:51,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash -735805939, now seen corresponding path program 1 times [2018-11-18 15:45:51,918 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:51,919 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:51,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:52,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 15:45:52,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:52,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:52,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:45:52,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:45:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:45:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:45:52,195 INFO L87 Difference]: Start difference. First operand 333 states and 377 transitions. Second operand 8 states. [2018-11-18 15:45:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:54,286 INFO L93 Difference]: Finished difference Result 348 states and 393 transitions. [2018-11-18 15:45:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:45:54,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2018-11-18 15:45:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:54,287 INFO L225 Difference]: With dead ends: 348 [2018-11-18 15:45:54,287 INFO L226 Difference]: Without dead ends: 246 [2018-11-18 15:45:54,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:45:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-18 15:45:54,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-11-18 15:45:54,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-18 15:45:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2018-11-18 15:45:54,304 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 137 [2018-11-18 15:45:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2018-11-18 15:45:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:45:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2018-11-18 15:45:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-18 15:45:54,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:54,304 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:54,304 INFO L423 AbstractCegarLoop]: === Iteration 82 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:54,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1628382106, now seen corresponding path program 1 times [2018-11-18 15:45:54,306 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:54,306 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:54,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:54,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 15:45:54,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:54,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:54,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 15:45:54,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:45:54,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:45:54,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:45:54,839 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand 15 states. [2018-11-18 15:45:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:57,174 INFO L93 Difference]: Finished difference Result 426 states and 501 transitions. [2018-11-18 15:45:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:45:57,175 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 155 [2018-11-18 15:45:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:57,175 INFO L225 Difference]: With dead ends: 426 [2018-11-18 15:45:57,175 INFO L226 Difference]: Without dead ends: 272 [2018-11-18 15:45:57,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:45:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-18 15:45:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2018-11-18 15:45:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-18 15:45:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 307 transitions. [2018-11-18 15:45:57,193 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 307 transitions. Word has length 155 [2018-11-18 15:45:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:57,193 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 307 transitions. [2018-11-18 15:45:57,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:45:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 307 transitions. [2018-11-18 15:45:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 15:45:57,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:57,194 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:57,194 INFO L423 AbstractCegarLoop]: === Iteration 83 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:57,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1021773875, now seen corresponding path program 1 times [2018-11-18 15:45:57,195 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:45:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:45:57,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:45:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:45:57,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:45:57,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:45:57,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 15:45:57,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:45:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:45:57,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:45:57,634 INFO L87 Difference]: Start difference. First operand 267 states and 307 transitions. Second operand 15 states. [2018-11-18 15:45:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:45:59,923 INFO L93 Difference]: Finished difference Result 415 states and 479 transitions. [2018-11-18 15:45:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:45:59,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 156 [2018-11-18 15:45:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:45:59,924 INFO L225 Difference]: With dead ends: 415 [2018-11-18 15:45:59,924 INFO L226 Difference]: Without dead ends: 264 [2018-11-18 15:45:59,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-18 15:45:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-18 15:45:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-11-18 15:45:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-18 15:45:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 301 transitions. [2018-11-18 15:45:59,953 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 301 transitions. Word has length 156 [2018-11-18 15:45:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:45:59,953 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 301 transitions. [2018-11-18 15:45:59,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:45:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 301 transitions. [2018-11-18 15:45:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:45:59,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:45:59,953 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:45:59,954 INFO L423 AbstractCegarLoop]: === Iteration 84 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:45:59,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:45:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1891559790, now seen corresponding path program 1 times [2018-11-18 15:45:59,955 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:45:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:45:59,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:00,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 15:46:00,330 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:00,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:00,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:46:00,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:46:00,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:46:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:46:00,333 INFO L87 Difference]: Start difference. First operand 264 states and 301 transitions. Second operand 11 states. [2018-11-18 15:46:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:04,537 INFO L93 Difference]: Finished difference Result 359 states and 405 transitions. [2018-11-18 15:46:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:46:04,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 165 [2018-11-18 15:46:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:04,538 INFO L225 Difference]: With dead ends: 359 [2018-11-18 15:46:04,538 INFO L226 Difference]: Without dead ends: 264 [2018-11-18 15:46:04,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:46:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-18 15:46:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-11-18 15:46:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-18 15:46:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 300 transitions. [2018-11-18 15:46:04,558 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 300 transitions. Word has length 165 [2018-11-18 15:46:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:04,558 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 300 transitions. [2018-11-18 15:46:04,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:46:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 300 transitions. [2018-11-18 15:46:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-18 15:46:04,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:04,559 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-18 15:46:04,559 INFO L423 AbstractCegarLoop]: === Iteration 85 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:04,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1563468219, now seen corresponding path program 1 times [2018-11-18 15:46:04,560 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:04,561 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:04,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:05,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:46:05,414 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:05,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:05,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:05,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:05,418 INFO L87 Difference]: Start difference. First operand 264 states and 300 transitions. Second operand 5 states. [2018-11-18 15:46:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:07,514 INFO L93 Difference]: Finished difference Result 506 states and 575 transitions. [2018-11-18 15:46:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:07,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2018-11-18 15:46:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:07,516 INFO L225 Difference]: With dead ends: 506 [2018-11-18 15:46:07,516 INFO L226 Difference]: Without dead ends: 264 [2018-11-18 15:46:07,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-18 15:46:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-11-18 15:46:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-18 15:46:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 299 transitions. [2018-11-18 15:46:07,536 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 299 transitions. Word has length 165 [2018-11-18 15:46:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:07,536 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 299 transitions. [2018-11-18 15:46:07,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 299 transitions. [2018-11-18 15:46:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 15:46:07,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:07,537 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:07,538 INFO L423 AbstractCegarLoop]: === Iteration 86 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:07,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:07,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1100559310, now seen corresponding path program 1 times [2018-11-18 15:46:07,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:07,539 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:07,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:08,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:46:08,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:08,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:08,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:46:08,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:46:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:46:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:46:08,396 INFO L87 Difference]: Start difference. First operand 264 states and 299 transitions. Second operand 4 states. [2018-11-18 15:46:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:08,470 INFO L93 Difference]: Finished difference Result 477 states and 544 transitions. [2018-11-18 15:46:08,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:46:08,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-11-18 15:46:08,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:08,471 INFO L225 Difference]: With dead ends: 477 [2018-11-18 15:46:08,472 INFO L226 Difference]: Without dead ends: 265 [2018-11-18 15:46:08,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-11-18 15:46:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-11-18 15:46:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-18 15:46:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 300 transitions. [2018-11-18 15:46:08,490 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 300 transitions. Word has length 169 [2018-11-18 15:46:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:08,490 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 300 transitions. [2018-11-18 15:46:08,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:46:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 300 transitions. [2018-11-18 15:46:08,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 15:46:08,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:08,491 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:08,491 INFO L423 AbstractCegarLoop]: === Iteration 87 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:08,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1939200178, now seen corresponding path program 1 times [2018-11-18 15:46:08,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:08,492 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 88 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:08,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:09,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:46:09,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:46:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:46:09,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:09,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:46:09,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:10,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 15:46:10,551 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:10,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:10,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5] total 15 [2018-11-18 15:46:10,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:46:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:46:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:46:10,578 INFO L87 Difference]: Start difference. First operand 265 states and 300 transitions. Second operand 15 states. [2018-11-18 15:46:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:13,030 INFO L93 Difference]: Finished difference Result 513 states and 588 transitions. [2018-11-18 15:46:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:46:13,030 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 170 [2018-11-18 15:46:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:13,031 INFO L225 Difference]: With dead ends: 513 [2018-11-18 15:46:13,031 INFO L226 Difference]: Without dead ends: 274 [2018-11-18 15:46:13,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-11-18 15:46:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-18 15:46:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 268. [2018-11-18 15:46:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 15:46:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2018-11-18 15:46:13,052 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 170 [2018-11-18 15:46:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:13,053 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2018-11-18 15:46:13,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:46:13,053 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2018-11-18 15:46:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-18 15:46:13,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:13,054 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 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-18 15:46:13,054 INFO L423 AbstractCegarLoop]: === Iteration 88 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:13,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:13,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1276503649, now seen corresponding path program 1 times [2018-11-18 15:46:13,055 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:13,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:13,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:46:13,502 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:13,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:13,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:46:13,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:46:13,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:46:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:46:13,505 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand 11 states. [2018-11-18 15:46:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:15,682 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2018-11-18 15:46:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:46:15,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 199 [2018-11-18 15:46:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:15,683 INFO L225 Difference]: With dead ends: 305 [2018-11-18 15:46:15,683 INFO L226 Difference]: Without dead ends: 249 [2018-11-18 15:46:15,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:46:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-18 15:46:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-11-18 15:46:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-18 15:46:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2018-11-18 15:46:15,700 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 199 [2018-11-18 15:46:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:15,701 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2018-11-18 15:46:15,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:46:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2018-11-18 15:46:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 15:46:15,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:15,701 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:46:15,701 INFO L423 AbstractCegarLoop]: === Iteration 89 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:15,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1669347009, now seen corresponding path program 1 times [2018-11-18 15:46:15,702 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:15,703 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 91 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:16,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:46:16,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:16,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:16,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:46:16,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:46:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:46:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:46:16,110 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand 11 states. [2018-11-18 15:46:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:18,286 INFO L93 Difference]: Finished difference Result 367 states and 407 transitions. [2018-11-18 15:46:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:46:18,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 203 [2018-11-18 15:46:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:18,287 INFO L225 Difference]: With dead ends: 367 [2018-11-18 15:46:18,287 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 15:46:18,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:46:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 15:46:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-11-18 15:46:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-18 15:46:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2018-11-18 15:46:18,304 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 203 [2018-11-18 15:46:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:18,304 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2018-11-18 15:46:18,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:46:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2018-11-18 15:46:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-18 15:46:18,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:18,305 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:46:18,305 INFO L423 AbstractCegarLoop]: === Iteration 90 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:18,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1255700960, now seen corresponding path program 1 times [2018-11-18 15:46:18,306 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:18,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:18,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-18 15:46:18,715 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:18,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:46:18,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:46:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:46:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:46:18,718 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand 11 states. [2018-11-18 15:46:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:20,831 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-11-18 15:46:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:20,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 203 [2018-11-18 15:46:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:20,832 INFO L225 Difference]: With dead ends: 321 [2018-11-18 15:46:20,832 INFO L226 Difference]: Without dead ends: 224 [2018-11-18 15:46:20,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:46:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-18 15:46:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2018-11-18 15:46:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-18 15:46:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 237 transitions. [2018-11-18 15:46:20,855 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 237 transitions. Word has length 203 [2018-11-18 15:46:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:20,855 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 237 transitions. [2018-11-18 15:46:20,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:46:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 237 transitions. [2018-11-18 15:46:20,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:46:20,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:20,855 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 15:46:20,856 INFO L423 AbstractCegarLoop]: === Iteration 91 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:20,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1187498273, now seen corresponding path program 1 times [2018-11-18 15:46:20,857 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:46:20,857 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/cvc4nyu Starting monitored process 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:46:20,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:21,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:46:21,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:46:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:46:22,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:22,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:46:22,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:23,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:46:23,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:46:23,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:23,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 8] total 15 [2018-11-18 15:46:23,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:46:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:46:23,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:46:23,066 INFO L87 Difference]: Start difference. First operand 218 states and 237 transitions. Second operand 15 states. [2018-11-18 15:46:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:25,725 INFO L93 Difference]: Finished difference Result 321 states and 357 transitions. [2018-11-18 15:46:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:46:25,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 204 [2018-11-18 15:46:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:25,726 INFO L225 Difference]: With dead ends: 321 [2018-11-18 15:46:25,726 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:46:25,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 596 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:46:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:46:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:46:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:46:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:46:25,728 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2018-11-18 15:46:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:25,728 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:46:25,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:46:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:46:25,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:46:25,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:46:25,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:25,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:26,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:27,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:28,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:29,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:29,310 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-18 15:46:29,435 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-11-18 15:46:29,553 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2018-11-18 15:46:29,784 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-11-18 15:46:29,899 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:30,013 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-11-18 15:46:30,791 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2018-11-18 15:46:31,109 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2018-11-18 15:46:31,275 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 1 [2018-11-18 15:46:31,633 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:31,818 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2018-11-18 15:46:33,056 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 159 DAG size of output: 131 [2018-11-18 15:46:33,278 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-11-18 15:46:33,421 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 1 [2018-11-18 15:46:33,577 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2018-11-18 15:46:33,697 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-18 15:46:33,858 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:34,164 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-18 15:46:34,340 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-18 15:46:34,856 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2018-11-18 15:46:35,382 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-18 15:46:35,642 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-11-18 15:46:36,602 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 131 [2018-11-18 15:46:36,896 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2018-11-18 15:46:37,241 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2018-11-18 15:46:37,614 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-18 15:46:37,903 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2018-11-18 15:46:38,073 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-11-18 15:46:38,480 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:38,600 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-18 15:46:38,750 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:38,976 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2018-11-18 15:46:39,143 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-11-18 15:46:39,349 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-11-18 15:46:39,671 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2018-11-18 15:46:39,952 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-11-18 15:46:40,106 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 1 [2018-11-18 15:46:40,403 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2018-11-18 15:46:40,565 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-18 15:46:40,733 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:46:40,977 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2018-11-18 15:46:41,735 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2018-11-18 15:46:42,297 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2018-11-18 15:46:43,021 WARN L180 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2018-11-18 15:46:43,199 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-11-18 15:46:43,465 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-18 15:46:43,821 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71 [2018-11-18 15:46:44,921 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-18 15:46:45,072 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:45,241 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:46:45,364 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-11-18 15:46:45,775 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2018-11-18 15:46:46,026 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:46,212 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:46,430 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2018-11-18 15:46:46,700 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-11-18 15:46:46,873 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:47,090 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-18 15:46:47,251 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2018-11-18 15:46:47,487 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:48,178 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 78 [2018-11-18 15:46:48,718 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-18 15:46:49,820 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 154 DAG size of output: 130 [2018-11-18 15:46:50,006 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:50,352 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 61 [2018-11-18 15:46:50,522 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:46:51,728 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-18 15:46:52,213 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2018-11-18 15:46:52,377 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:46:52,564 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-18 15:46:52,676 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:52,831 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 1 [2018-11-18 15:46:52,941 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-11-18 15:46:53,049 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:53,191 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:53,361 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2018-11-18 15:46:54,195 WARN L180 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 96 [2018-11-18 15:46:54,774 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-11-18 15:46:54,920 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 1 [2018-11-18 15:46:55,237 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 1 [2018-11-18 15:46:55,345 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:55,546 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-18 15:46:55,754 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-11-18 15:46:56,180 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2018-11-18 15:46:56,347 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:46:56,619 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2018-11-18 15:46:56,882 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2018-11-18 15:46:57,244 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2018-11-18 15:46:57,364 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2018-11-18 15:46:57,494 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-11-18 15:46:57,998 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2018-11-18 15:46:58,129 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-18 15:46:58,275 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:58,560 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:46:58,810 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 1 [2018-11-18 15:46:59,040 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-11-18 15:46:59,187 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:46:59,448 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2018-11-18 15:46:59,629 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-11-18 15:46:59,842 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-11-18 15:47:00,156 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2018-11-18 15:47:01,337 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2018-11-18 15:47:01,489 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:47:01,886 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2018-11-18 15:47:02,290 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-11-18 15:47:02,457 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:47:02,573 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2018-11-18 15:47:02,739 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:47:03,086 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:47:03,253 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 1 [2018-11-18 15:47:03,742 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2018-11-18 15:47:03,990 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-11-18 15:47:04,275 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2018-11-18 15:47:04,806 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2018-11-18 15:47:05,140 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-18 15:47:05,442 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2018-11-18 15:47:05,573 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-11-18 15:47:05,837 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-11-18 15:47:05,968 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-11-18 15:47:06,250 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-18 15:47:06,352 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-18 15:47:06,468 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-11-18 15:47:06,739 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2018-11-18 15:47:06,742 INFO L425 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 7527 7536) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L428 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 7527 7536) the Hoare annotation is: true [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 7527 7536) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 7593 7616) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point L7611(lines 7593 7616) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L428 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 7593 7616) the Hoare annotation is: true [2018-11-18 15:47:06,743 INFO L428 ceAbstractionStarter]: At program point L7604(lines 7603 7613) the Hoare annotation is: true [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point L7600(lines 7600 7614) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L428 ceAbstractionStarter]: At program point L7601(lines 7600 7614) the Hoare annotation is: true [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 7605 7612) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 7605 7612) no Hoare annotation was computed. [2018-11-18 15:47:06,743 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2118 2139) no Hoare annotation was computed. [2018-11-18 15:47:06,744 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 2118 2139) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= ~myStatus~0 (_ bv0 32))) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= ~MPR1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= (_ bv0 32) ~compRegistered~0) (= ~IPC~0 ~s~0) (= ~NP~0 ~s~0) (= ~DC~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~UNLOADED~0 ~s~0) (= |old(~s~0)| ~s~0)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,744 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2118 2139) no Hoare annotation was computed. [2018-11-18 15:47:06,744 INFO L421 ceAbstractionStarter]: At program point L6931(line 6931) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,744 INFO L425 ceAbstractionStarter]: For program point L6902-1(lines 6902 6995) no Hoare annotation was computed. [2018-11-18 15:47:06,744 INFO L425 ceAbstractionStarter]: For program point L6927(lines 6927 6970) no Hoare annotation was computed. [2018-11-18 15:47:06,744 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 6890 7003) no Hoare annotation was computed. [2018-11-18 15:47:06,744 INFO L425 ceAbstractionStarter]: For program point L6915-1(line 6915) no Hoare annotation was computed. [2018-11-18 15:47:06,744 INFO L421 ceAbstractionStarter]: At program point L6915(line 6915) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,744 INFO L421 ceAbstractionStarter]: At program point L6944(lines 6943 6966) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,744 INFO L425 ceAbstractionStarter]: For program point L6940(lines 6940 6967) no Hoare annotation was computed. [2018-11-18 15:47:06,745 INFO L421 ceAbstractionStarter]: At program point L6903(line 6903) the Hoare annotation is: (let ((.cse1 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv3 32) ~SKIP1~0))) (.cse5 (not (= (_ bv7 32) ~IPC~0))) (.cse9 (not (= ~NP~0 |old(~s~0)|))) (.cse10 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse12 (or .cse1 (or .cse2 .cse3 .cse5 .cse9 .cse10))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse13 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse11 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse0 (or .cse12 .cse6 .cse7 .cse13 .cse8 .cse11)) (.cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)))) (and (or (not (= |old(~myStatus~0)| (_ bv0 32))) .cse0 (= ~myStatus~0 (_ bv0 32))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse9 .cse10 .cse11) (or .cse12 .cse6 .cse7 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse13 .cse8 .cse11 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse4))))) [2018-11-18 15:47:06,745 INFO L421 ceAbstractionStarter]: At program point L6961(line 6961) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,745 INFO L425 ceAbstractionStarter]: For program point $Ultimate##24(lines 6945 6965) no Hoare annotation was computed. [2018-11-18 15:47:06,745 INFO L425 ceAbstractionStarter]: For program point $Ultimate##23(lines 6945 6965) no Hoare annotation was computed. [2018-11-18 15:47:06,745 INFO L425 ceAbstractionStarter]: For program point L6949-1(line 6949) no Hoare annotation was computed. [2018-11-18 15:47:06,745 INFO L421 ceAbstractionStarter]: At program point L6949(line 6949) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,745 INFO L421 ceAbstractionStarter]: At program point L6974(lines 6902 6995) the Hoare annotation is: (let ((.cse1 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv3 32) ~SKIP1~0))) (.cse5 (not (= (_ bv7 32) ~IPC~0))) (.cse9 (not (= ~NP~0 |old(~s~0)|))) (.cse10 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse12 (or .cse1 (or .cse2 .cse3 .cse5 .cse9 .cse10))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse13 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse11 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse0 (or .cse12 .cse6 .cse7 .cse13 .cse8 .cse11)) (.cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)))) (and (or (not (= |old(~myStatus~0)| (_ bv0 32))) .cse0 (= ~myStatus~0 (_ bv0 32))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse9 .cse10 .cse11) (or .cse12 .cse6 .cse7 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse13 .cse8 .cse11 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse4))))) [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6908-1(lines 6908 6912) no Hoare annotation was computed. [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6908(lines 6908 6912) no Hoare annotation was computed. [2018-11-18 15:47:06,746 INFO L421 ceAbstractionStarter]: At program point L6941(lines 6940 6967) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6937(lines 6937 6968) no Hoare annotation was computed. [2018-11-18 15:47:06,746 INFO L421 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 6890 7003) the Hoare annotation is: (let ((.cse1 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv3 32) ~SKIP1~0))) (.cse5 (not (= (_ bv7 32) ~IPC~0))) (.cse9 (not (= ~NP~0 |old(~s~0)|))) (.cse10 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse12 (or .cse1 (or .cse2 .cse3 .cse5 .cse9 .cse10))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse13 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse11 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse0 (or .cse12 .cse6 .cse7 .cse13 .cse8 .cse11)) (.cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)))) (and (or (not (= |old(~myStatus~0)| (_ bv0 32))) .cse0 (= ~myStatus~0 (_ bv0 32))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse9 .cse10 .cse11) (or .cse12 .cse6 .cse7 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse13 .cse8 .cse11 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse4))))) [2018-11-18 15:47:06,746 INFO L421 ceAbstractionStarter]: At program point L6954(line 6954) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6954-1(line 6954) no Hoare annotation was computed. [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6917-2(lines 6902 6995) no Hoare annotation was computed. [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6979(lines 6979 6985) no Hoare annotation was computed. [2018-11-18 15:47:06,746 INFO L425 ceAbstractionStarter]: For program point L6917(lines 6917 6922) no Hoare annotation was computed. [2018-11-18 15:47:06,747 INFO L421 ceAbstractionStarter]: At program point L6938(lines 6934 6969) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,747 INFO L425 ceAbstractionStarter]: For program point L6934(lines 6934 6969) no Hoare annotation was computed. [2018-11-18 15:47:06,747 INFO L425 ceAbstractionStarter]: For program point L6905(lines 6905 6906) no Hoare annotation was computed. [2018-11-18 15:47:06,747 INFO L421 ceAbstractionStarter]: At program point L6996(lines 6890 7003) the Hoare annotation is: (let ((.cse19 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse18 (= (_ bv2 32) ~DC~0)) (.cse17 (= (_ bv1 32) ~NP~0)) (.cse9 (not .cse19)) (.cse10 (not (= (_ bv6 32) ~MPR3~0))) (.cse11 (not (= (_ bv3 32) ~SKIP1~0))) (.cse12 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= ~NP~0 |old(~s~0)|))) (.cse13 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse7 (= (_ bv1 32) ~pended~0)) (.cse15 (or .cse9 (or .cse10 .cse11 .cse12 .cse6 .cse13))) (.cse3 (not .cse17)) (.cse4 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse16 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv4 32) ~SKIP2~0))) (.cse14 (not .cse18)) (.cse8 (= |old(~s~0)| ~s~0))) (let ((.cse0 (and (= (_ bv0 32) ~pended~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= FloppyProcessQueuedRequests_~headOfList~0.base (_ bv0 32)) (= (_ bv0 32) FloppyProcessQueuedRequests_~headOfList~0.offset) .cse8)) (.cse1 (or .cse15 .cse3 .cse4 .cse16 .cse5 .cse14)) (.cse2 (and (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) .cse17 (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) .cse7 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) .cse18 .cse19 .cse8))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8) .cse9 .cse10 .cse11 .cse0 .cse12 (not (= ~compRegistered~0 (_ bv0 32))) .cse13 .cse14) (or .cse15 .cse3 .cse4 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse16 .cse5 .cse2 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse14) (or (not (= |old(~myStatus~0)| (_ bv0 32))) .cse1 (= ~myStatus~0 (_ bv0 32)) .cse2)))))) [2018-11-18 15:47:06,747 INFO L421 ceAbstractionStarter]: At program point L6926(lines 6902 6995) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4 32) ~SKIP2~0))) (.cse4 (not (= ~NP~0 |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5 .cse9))) [2018-11-18 15:47:06,747 INFO L425 ceAbstractionStarter]: For program point L3896(lines 3896 3906) no Hoare annotation was computed. [2018-11-18 15:47:06,747 INFO L428 ceAbstractionStarter]: At program point L3830(line 3830) the Hoare annotation is: true [2018-11-18 15:47:06,747 INFO L425 ceAbstractionStarter]: For program point L3830-1(line 3830) no Hoare annotation was computed. [2018-11-18 15:47:06,747 INFO L425 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 3815 3909) no Hoare annotation was computed. [2018-11-18 15:47:06,747 INFO L428 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 3815 3909) the Hoare annotation is: true [2018-11-18 15:47:06,747 INFO L425 ceAbstractionStarter]: For program point L3843(lines 3843 3859) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L428 ceAbstractionStarter]: At program point L3844(lines 3840 3860) the Hoare annotation is: true [2018-11-18 15:47:06,748 INFO L428 ceAbstractionStarter]: At program point L3877(lines 3861 3895) the Hoare annotation is: true [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3840(lines 3840 3860) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L428 ceAbstractionStarter]: At program point L3902(line 3902) the Hoare annotation is: true [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3865(lines 3865 3874) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3828(lines 3828 3836) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3861(lines 3861 3895) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 3815 3909) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L428 ceAbstractionStarter]: At program point L3882(line 3882) the Hoare annotation is: true [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3878(lines 3878 3894) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3845(lines 3845 3849) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3878-1(lines 3820 3908) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3845-2(lines 3845 3849) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L428 ceAbstractionStarter]: At program point L3866(lines 3862 3875) the Hoare annotation is: true [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3862(lines 3862 3875) no Hoare annotation was computed. [2018-11-18 15:47:06,748 INFO L425 ceAbstractionStarter]: For program point L3891-1(line 3891) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L428 ceAbstractionStarter]: At program point L3891(line 3891) the Hoare annotation is: true [2018-11-18 15:47:06,749 INFO L428 ceAbstractionStarter]: At program point L3854(line 3854) the Hoare annotation is: true [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point L3854-1(line 3854) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point L7642(lines 7627 7647) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L428 ceAbstractionStarter]: At program point L7635(lines 7634 7644) the Hoare annotation is: true [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 7627 7647) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point L7631(lines 7631 7645) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L428 ceAbstractionStarter]: At program point L7632(lines 7631 7645) the Hoare annotation is: true [2018-11-18 15:47:06,749 INFO L428 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 7627 7647) the Hoare annotation is: true [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 7636 7643) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 7636 7643) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point L3322(lines 3322 3328) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point L3355(lines 3355 3368) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L425 ceAbstractionStarter]: For program point L3322-2(lines 3322 3328) no Hoare annotation was computed. [2018-11-18 15:47:06,749 INFO L421 ceAbstractionStarter]: At program point L3223(lines 3222 3498) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,750 INFO L425 ceAbstractionStarter]: For program point L3405(lines 3405 3411) no Hoare annotation was computed. [2018-11-18 15:47:06,750 INFO L425 ceAbstractionStarter]: For program point L3240(lines 3240 3492) no Hoare annotation was computed. [2018-11-18 15:47:06,750 INFO L421 ceAbstractionStarter]: At program point L3241(lines 3240 3492) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,750 INFO L421 ceAbstractionStarter]: At program point L3489(lines 3245 3490) the Hoare annotation is: (let ((.cse3 (= ~SKIP2~0 ~s~0)) (.cse4 (= (_ bv0 32) ~compRegistered~0)) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= ~DC~0 ~s~0)) (.cse5 (= (_ bv1 32) ~pended~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse0 .cse1 .cse2 (= (_ bv0 32) FloppyPnp_~ntStatus~3)) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse2 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3)) (and (not (bvsge FloppyPnp_~ntStatus~3 (_ bv0 32))) .cse2 .cse0 .cse1) (and .cse0 .cse5) (= (_ bv0 32) ~PagingMutex~0.base))) [2018-11-18 15:47:06,750 INFO L421 ceAbstractionStarter]: At program point L3357(line 3357) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,750 INFO L425 ceAbstractionStarter]: For program point L3225(lines 3225 3497) no Hoare annotation was computed. [2018-11-18 15:47:06,750 INFO L421 ceAbstractionStarter]: At program point L3308(line 3308) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= ~SKIP1~0 ~s~0) (= (_ bv1 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,750 INFO L425 ceAbstractionStarter]: For program point L3308-1(line 3308) no Hoare annotation was computed. [2018-11-18 15:47:06,750 INFO L425 ceAbstractionStarter]: For program point L3457(lines 3457 3465) no Hoare annotation was computed. [2018-11-18 15:47:06,750 INFO L425 ceAbstractionStarter]: For program point L3391-1(line 3391) no Hoare annotation was computed. [2018-11-18 15:47:06,751 INFO L421 ceAbstractionStarter]: At program point L3391(line 3391) the Hoare annotation is: (let ((.cse3 (= (_ bv0 32) FloppyPnp_~ntStatus~3)) (.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= ~NP~0 ~s~0)) (.cse2 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv1 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) (and .cse0 (= ~myStatus~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse4) (= (_ bv0 32) ~PagingMutex~0.base) (and .cse0 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) .cse1 .cse2 .cse4))) [2018-11-18 15:47:06,751 INFO L421 ceAbstractionStarter]: At program point L3457-2(lines 3457 3465) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv1 32) ~pended~0) .cse0 .cse1) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (_ bv0 32) ~pended~0) .cse0 .cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base))) [2018-11-18 15:47:06,751 INFO L425 ceAbstractionStarter]: For program point L3441-1(line 3441) no Hoare annotation was computed. [2018-11-18 15:47:06,751 INFO L421 ceAbstractionStarter]: At program point L3441(line 3441) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0))) (or (and .cse0 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) .cse1) (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and .cse0 (= (_ bv1 32) ~pended~0) .cse1))) [2018-11-18 15:47:06,751 INFO L421 ceAbstractionStarter]: At program point L3342(line 3342) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,751 INFO L425 ceAbstractionStarter]: For program point L3342-1(line 3342) no Hoare annotation was computed. [2018-11-18 15:47:06,751 INFO L425 ceAbstractionStarter]: For program point L3260(lines 3260 3276) no Hoare annotation was computed. [2018-11-18 15:47:06,751 INFO L425 ceAbstractionStarter]: For program point L3409-1(lines 3405 3411) no Hoare annotation was computed. [2018-11-18 15:47:06,751 INFO L421 ceAbstractionStarter]: At program point L3409(line 3409) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,752 INFO L421 ceAbstractionStarter]: At program point L3244(lines 3243 3491) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3211(lines 3211 3221) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3459-1(line 3459) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L421 ceAbstractionStarter]: At program point L3459(line 3459) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv1 32) ~pended~0) .cse0 .cse1) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (_ bv0 32) ~pended~0) .cse0 .cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base))) [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3360(lines 3360 3367) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3360-1(lines 3355 3368) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3228(lines 3228 3496) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3261(lines 3261 3267) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3443(lines 3443 3452) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3377-1(line 3377) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L421 ceAbstractionStarter]: At program point L3377(line 3377) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= (_ bv1 32) ~compRegistered~0) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3443-2(lines 3443 3452) no Hoare annotation was computed. [2018-11-18 15:47:06,752 INFO L425 ceAbstractionStarter]: For program point L3427-1(lines 3245 3488) no Hoare annotation was computed. [2018-11-18 15:47:06,753 INFO L421 ceAbstractionStarter]: At program point L3427(line 3427) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,753 INFO L425 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 3181 3515) no Hoare annotation was computed. [2018-11-18 15:47:06,753 INFO L421 ceAbstractionStarter]: At program point L3229(lines 3225 3497) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,753 INFO L421 ceAbstractionStarter]: At program point L3362(line 3362) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,753 INFO L421 ceAbstractionStarter]: At program point L3395(line 3395) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= ~NP~0 ~s~0)) (.cse2 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) FloppyPnp_~ntStatus~3)) (.cse4 (= (_ bv1 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse0 (= ~myStatus~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse4) (and .cse1 (= (_ bv1 32) ~pended~0)) (= (_ bv0 32) ~PagingMutex~0.base) (and .cse0 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4))) [2018-11-18 15:47:06,753 INFO L425 ceAbstractionStarter]: For program point L3329(lines 3329 3397) no Hoare annotation was computed. [2018-11-18 15:47:06,753 INFO L425 ceAbstractionStarter]: For program point L3445-1(lines 3445 3446) no Hoare annotation was computed. [2018-11-18 15:47:06,753 INFO L421 ceAbstractionStarter]: At program point L3445(lines 3445 3446) the Hoare annotation is: (let ((.cse0 (= ~SKIP2~0 ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv1 32) ~pended~0) .cse0 .cse1) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (_ bv0 32) ~pended~0) .cse0 .cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base))) [2018-11-18 15:47:06,753 INFO L425 ceAbstractionStarter]: For program point L3379(lines 3379 3386) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 3181 3515) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3379-2(lines 3379 3386) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3231(lines 3231 3495) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3248(line 3248) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3281-1(line 3281) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L421 ceAbstractionStarter]: At program point L3281(line 3281) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3298(lines 3298 3304) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3265-1(lines 3261 3267) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L421 ceAbstractionStarter]: At program point L3265(line 3265) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3199(lines 3199 3205) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3199-2(lines 3199 3205) no Hoare annotation was computed. [2018-11-18 15:47:06,754 INFO L421 ceAbstractionStarter]: At program point L3480(line 3480) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,754 INFO L425 ceAbstractionStarter]: For program point L3480-1(lines 3476 3482) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point L3381-1(line 3381) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L421 ceAbstractionStarter]: At program point L3381(line 3381) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (bvadd FloppyPnp_~ntStatus~3 (_ bv4294967037 32)) (_ bv0 32)) (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= ~MPR3~0 ~s~0) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,755 INFO L421 ceAbstractionStarter]: At program point L3216(line 3216) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= ~NP~0 ~s~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point L3216-1(line 3216) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point $Ultimate##21(lines 3245 3490) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point $Ultimate##20(lines 3245 3490) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point L3332(lines 3332 3338) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point L3415-1(line 3415) no Hoare annotation was computed. [2018-11-18 15:47:06,755 INFO L421 ceAbstractionStarter]: At program point L3415(line 3415) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,755 INFO L421 ceAbstractionStarter]: At program point L3316(line 3316) the Hoare annotation is: (let ((.cse0 (= |old(~s~0)| ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) .cse0 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) .cse1) (= (_ bv0 32) ~PagingMutex~0.base) (and (= (_ bv1 32) ~pended~0) .cse0 .cse1))) [2018-11-18 15:47:06,755 INFO L425 ceAbstractionStarter]: For program point L3283(lines 3283 3318) no Hoare annotation was computed. [2018-11-18 15:47:06,756 INFO L425 ceAbstractionStarter]: For program point L3234(lines 3234 3494) no Hoare annotation was computed. [2018-11-18 15:47:06,756 INFO L421 ceAbstractionStarter]: At program point L3350(line 3350) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,756 INFO L421 ceAbstractionStarter]: At program point L3350-1(line 3350) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,756 INFO L425 ceAbstractionStarter]: For program point L3433-1(lines 3429 3435) no Hoare annotation was computed. [2018-11-18 15:47:06,756 INFO L421 ceAbstractionStarter]: At program point L3433(line 3433) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,756 INFO L421 ceAbstractionStarter]: At program point L3235(lines 3231 3495) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,756 INFO L425 ceAbstractionStarter]: For program point L3351(line 3351) no Hoare annotation was computed. [2018-11-18 15:47:06,756 INFO L425 ceAbstractionStarter]: For program point L3285-1(lines 3285 3286) no Hoare annotation was computed. [2018-11-18 15:47:06,756 INFO L421 ceAbstractionStarter]: At program point L3285(lines 3285 3286) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= (_ bv1 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,756 INFO L421 ceAbstractionStarter]: At program point L3302(line 3302) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3302-1(lines 3298 3304) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3253(lines 3253 3259) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3253-2(lines 3253 3259) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L421 ceAbstractionStarter]: At program point L3336(line 3336) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3336-1(lines 3332 3338) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3237(lines 3237 3493) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3469(line 3469) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L421 ceAbstractionStarter]: At program point L3238(lines 3237 3493) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3271-1(line 3271) no Hoare annotation was computed. [2018-11-18 15:47:06,757 INFO L421 ceAbstractionStarter]: At program point L3271(line 3271) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,757 INFO L421 ceAbstractionStarter]: At program point L3486(line 3486) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,757 INFO L425 ceAbstractionStarter]: For program point L3486-1(line 3486) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L3288(lines 3288 3294) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L3222(lines 3222 3498) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L3288-2(lines 3288 3294) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L3503(lines 3503 3509) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L3503-2(lines 3503 3509) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L421 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 3181 3515) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L7104(line 7104) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 7041 7217) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L7096(lines 7096 7133) no Hoare annotation was computed. [2018-11-18 15:47:06,758 INFO L421 ceAbstractionStarter]: At program point L7088(lines 7087 7136) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= (_ bv1 32) ~NP~0) (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0) (= (_ bv0 32) ~compRegistered~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,758 INFO L425 ceAbstractionStarter]: For program point L7171(lines 7171 7181) no Hoare annotation was computed. [2018-11-18 15:47:06,759 INFO L421 ceAbstractionStarter]: At program point L7130(lines 7060 7145) the Hoare annotation is: (let ((.cse0 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse1 (= (_ bv1 32) ~NP~0)) (.cse2 (= ~DC~0 ~s~0)) (.cse3 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse4 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse10 (= (_ bv0 32) ~pended~0)) (.cse6 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse7 (= (_ bv2 32) ~DC~0)) (.cse8 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse5 (= (_ bv1 32) ~pended~0)) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse9 (= (_ bv0 32) ~compRegistered~0)) (.cse11 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 (= ~NP~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (= |old(~NP~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32))) (and .cse11 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= (_ bv3221225558 32) main_~status~4)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9) (and (= (bvadd main_~status~4 (_ bv1073741670 32)) (_ bv0 32)) .cse11) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 (= main_~status~4 ~lowerDriverReturn~0) .cse8 .cse12 .cse9) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= main_~status~4 (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse11) (and .cse11 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (not (= |old(~myStatus~0)| (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse11) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and .cse11 (= (bvadd main_~status~4 (_ bv1073741823 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|)) (and .cse11 (= (_ bv0 32) ~PagingMutex~0.offset) (not (bvsge main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) ~PagingMutex~0.base))) (and .cse11 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32)))))) [2018-11-18 15:47:06,759 INFO L421 ceAbstractionStarter]: At program point L7163(lines 7156 7212) the Hoare annotation is: (let ((.cse0 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse1 (= (_ bv1 32) ~NP~0)) (.cse2 (= ~DC~0 ~s~0)) (.cse3 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse4 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse6 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse7 (= (_ bv2 32) ~DC~0)) (.cse8 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse5 (= (_ bv1 32) ~pended~0)) (.cse10 (= ~SKIP2~0 ~s~0)) (.cse11 (= (_ bv0 32) ~compRegistered~0)) (.cse9 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse9 (= (bvadd main_~status~4 (_ bv1073741823 32)) (_ bv0 32))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (= main_~status~4 (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse9) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse9) (and (= (_ bv0 32) ~PagingMutex~0.offset) .cse9 (not (bvsge main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) ~PagingMutex~0.base))) (and .cse9 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and .cse9 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (and .cse9 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (not (= |old(~myStatus~0)| (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741670 32)) (_ bv0 32)) .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32))) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse10 .cse8 .cse11) (= ~UNLOADED~0 ~s~0) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (= (_ bv3221225558 32) main_~status~4)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse9)))) [2018-11-18 15:47:06,764 INFO L421 ceAbstractionStarter]: At program point L7097(lines 7096 7133) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv1 32) ~NP~0) (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0) (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0))) [2018-11-18 15:47:06,764 INFO L421 ceAbstractionStarter]: At program point L7155(lines 7148 7213) the Hoare annotation is: (let ((.cse0 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse1 (= (_ bv1 32) ~NP~0)) (.cse2 (= ~DC~0 ~s~0)) (.cse3 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse4 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse10 (= (_ bv0 32) ~pended~0)) (.cse6 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse7 (= (_ bv2 32) ~DC~0)) (.cse8 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse5 (= (_ bv1 32) ~pended~0)) (.cse11 (= ~SKIP2~0 ~s~0)) (.cse12 (= (_ bv0 32) ~compRegistered~0)) (.cse9 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and .cse9 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= (_ bv3221225558 32) main_~status~4)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 (= main_~status~4 ~lowerDriverReturn~0) .cse8 .cse11 .cse12) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= main_~status~4 (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741670 32)) (_ bv0 32)) .cse9) (and (= (_ bv0 32) ~PagingMutex~0.offset) (not (bvsge main_~status~4 (_ bv0 32))) .cse9 (not (= (_ bv0 32) ~PagingMutex~0.base))) (and .cse9 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse9) (not (= |old(~myStatus~0)| (_ bv0 32))) (= ~UNLOADED~0 ~s~0) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (and .cse9 (= (bvadd main_~status~4 (_ bv1073741823 32)) (_ bv0 32))) (and .cse9 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32)))))) [2018-11-18 15:47:06,771 INFO L425 ceAbstractionStarter]: For program point L7114(line 7114) no Hoare annotation was computed. [2018-11-18 15:47:06,771 INFO L425 ceAbstractionStarter]: For program point L7172(lines 7172 7178) no Hoare annotation was computed. [2018-11-18 15:47:06,771 INFO L425 ceAbstractionStarter]: For program point L7090(lines 7090 7135) no Hoare annotation was computed. [2018-11-18 15:47:06,771 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 7101 7131) no Hoare annotation was computed. [2018-11-18 15:47:06,771 INFO L421 ceAbstractionStarter]: At program point L7057-1(line 7057) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and (= (_ bv1 32) ~NP~0) (= (_ bv0 32) ~pended~0) (= main_~status~4 (_ bv0 32)) (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= ~MPR3~0 ~s~0)) (= ~UNLOADED~0 ~s~0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,771 INFO L421 ceAbstractionStarter]: At program point L7057(line 7057) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= main_~status~4 (_ bv0 32)) (= ~MPR1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= (_ bv0 32) ~compRegistered~0) (= ~IPC~0 ~s~0) (= ~myStatus~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~DC~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= ~UNLOADED~0 ~s~0) (= |old(~s~0)| ~s~0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,779 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 7041 7217) no Hoare annotation was computed. [2018-11-18 15:47:06,779 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 7101 7131) no Hoare annotation was computed. [2018-11-18 15:47:06,779 INFO L421 ceAbstractionStarter]: At program point L7140(line 7140) the Hoare annotation is: (let ((.cse0 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse1 (= (_ bv1 32) ~NP~0)) (.cse2 (= ~DC~0 ~s~0)) (.cse3 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse4 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse10 (= (_ bv0 32) ~pended~0)) (.cse6 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse7 (= (_ bv2 32) ~DC~0)) (.cse8 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse5 (= (_ bv1 32) ~pended~0)) (.cse12 (= ~SKIP2~0 ~s~0)) (.cse9 (= (_ bv0 32) ~compRegistered~0)) (.cse11 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 (= ~NP~0 ~s~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (not (= |old(~NP~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32))) (and .cse11 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= (_ bv3221225558 32) main_~status~4)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse9) (and (= (bvadd main_~status~4 (_ bv1073741670 32)) (_ bv0 32)) .cse11) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse3 .cse4 .cse10 .cse6 .cse7 (= main_~status~4 ~lowerDriverReturn~0) .cse8 .cse12 .cse9) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 (= main_~status~4 (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse11) (and .cse11 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (not (= |old(~myStatus~0)| (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse11) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and .cse11 (= (bvadd main_~status~4 (_ bv1073741823 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|)) (and .cse11 (= (_ bv0 32) ~PagingMutex~0.offset) (not (bvsge main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) ~PagingMutex~0.base))) (and .cse11 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32)))))) [2018-11-18 15:47:06,779 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 7041 7217) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0) (= ~MPR1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= (_ bv0 32) ~compRegistered~0) (= ~IPC~0 ~s~0) (= ~myStatus~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~DC~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= ~UNLOADED~0 ~s~0) (= |old(~s~0)| ~s~0)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,787 INFO L425 ceAbstractionStarter]: For program point L7058(line 7058) no Hoare annotation was computed. [2018-11-18 15:47:06,787 INFO L421 ceAbstractionStarter]: At program point L7091(lines 7090 7135) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv1 32) ~NP~0) (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,787 INFO L425 ceAbstractionStarter]: For program point L7124(line 7124) no Hoare annotation was computed. [2018-11-18 15:47:06,787 INFO L425 ceAbstractionStarter]: For program point L7157(lines 7157 7161) no Hoare annotation was computed. [2018-11-18 15:47:06,787 INFO L425 ceAbstractionStarter]: For program point L7149(lines 7149 7153) no Hoare annotation was computed. [2018-11-18 15:47:06,788 INFO L421 ceAbstractionStarter]: At program point L7174(line 7174) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,788 INFO L428 ceAbstractionStarter]: At program point L7100(lines 7099 7132) the Hoare annotation is: true [2018-11-18 15:47:06,788 INFO L425 ceAbstractionStarter]: For program point L7191(lines 7191 7207) no Hoare annotation was computed. [2018-11-18 15:47:06,788 INFO L421 ceAbstractionStarter]: At program point L7183(lines 7170 7209) the Hoare annotation is: (let ((.cse11 (= ~DC~0 ~s~0)) (.cse2 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse3 (= (_ bv1 32) ~NP~0)) (.cse4 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse5 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse6 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse7 (= (_ bv2 32) ~DC~0)) (.cse8 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (.cse10 (= (_ bv0 32) ~compRegistered~0))) (let ((.cse0 (= (_ bv1 32) ~pended~0)) (.cse12 (= main_~status~4 (_ bv0 32))) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse1 (or (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse4 .cse5 .cse6 (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse8 .cse10)))) (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse1) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and .cse1 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and .cse1 (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32))) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse12) (and .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32))) (and .cse1 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (and .cse1 .cse12) (and .cse1 (= (bvadd main_~status~4 (_ bv1073741823 32)) (_ bv0 32))) (and .cse1 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse1) (and .cse1 (= (_ bv0 32) ~PagingMutex~0.offset) (not (bvsge main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) ~PagingMutex~0.base))) (and .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 (= (_ bv3221225558 32) main_~status~4)) (and .cse1 .cse9) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse1) (and (= (bvadd main_~status~4 (_ bv1073741670 32)) (_ bv0 32)) .cse1) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-18 15:47:06,806 INFO L425 ceAbstractionStarter]: For program point L7084(lines 7084 7137) no Hoare annotation was computed. [2018-11-18 15:47:06,806 INFO L425 ceAbstractionStarter]: For program point L7109(line 7109) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7167(lines 7167 7210) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7200-1(lines 7148 7213) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7200(lines 7200 7206) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7192(lines 7192 7198) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7060-1(lines 7053 7216) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7060(lines 7060 7147) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L425 ceAbstractionStarter]: For program point L7093(lines 7093 7134) no Hoare annotation was computed. [2018-11-18 15:47:06,807 INFO L421 ceAbstractionStarter]: At program point L7085(lines 7084 7137) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and (= (_ bv1 32) ~NP~0) (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,812 INFO L425 ceAbstractionStarter]: For program point L7077(lines 7060 7145) no Hoare annotation was computed. [2018-11-18 15:47:06,812 INFO L421 ceAbstractionStarter]: At program point L7094(lines 7093 7134) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and (= (_ bv1 32) ~NP~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~PagingMutex~0.offset) (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= (_ bv0 32) ~PagingMutex~0.base)) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,812 INFO L425 ceAbstractionStarter]: For program point L7119(line 7119) no Hoare annotation was computed. [2018-11-18 15:47:06,812 INFO L425 ceAbstractionStarter]: For program point L7185(lines 7185 7189) no Hoare annotation was computed. [2018-11-18 15:47:06,812 INFO L421 ceAbstractionStarter]: At program point L7202(line 7202) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,812 INFO L425 ceAbstractionStarter]: For program point L7070(lines 7070 7075) no Hoare annotation was computed. [2018-11-18 15:47:06,812 INFO L421 ceAbstractionStarter]: At program point L7194(line 7194) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,813 INFO L421 ceAbstractionStarter]: At program point L7070-2(lines 7070 7075) the Hoare annotation is: (or (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~NP~0)| |old(~s~0)|)) (and (= (_ bv1 32) ~NP~0) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~PagingMutex~0.offset) (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= (_ bv0 32) ~PagingMutex~0.base)) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) ~DC~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~DC~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-18 15:47:06,817 INFO L425 ceAbstractionStarter]: For program point L7087(lines 7087 7136) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point L7170(lines 7170 7209) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L428 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 7273 7281) the Hoare annotation is: true [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 7273 7281) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 7273 7281) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 2667 2681) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point L2677-1(line 2677) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L421 ceAbstractionStarter]: At program point L2677(line 2677) the Hoare annotation is: (or (= ~NP~0 ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,818 INFO L421 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 2667 2681) the Hoare annotation is: (or (= ~NP~0 ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 2667 2681) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L425 ceAbstractionStarter]: For program point L7664-1(lines 7656 7669) no Hoare annotation was computed. [2018-11-18 15:47:06,818 INFO L421 ceAbstractionStarter]: At program point L7664(line 7664) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (or (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,818 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 7656 7669) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (= |old(~s~0)| ~s~0) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (or (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,827 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 7656 7669) no Hoare annotation was computed. [2018-11-18 15:47:06,827 INFO L425 ceAbstractionStarter]: For program point L8062(lines 8062 8079) no Hoare annotation was computed. [2018-11-18 15:47:06,827 INFO L425 ceAbstractionStarter]: For program point L8021-1(line 8021) no Hoare annotation was computed. [2018-11-18 15:47:06,828 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 8011 8083) no Hoare annotation was computed. [2018-11-18 15:47:06,828 INFO L421 ceAbstractionStarter]: At program point L8021(line 8021) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,828 INFO L421 ceAbstractionStarter]: At program point L8038(lines 8037 8056) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (= |old(~s~0)| ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,828 INFO L425 ceAbstractionStarter]: For program point L8071(lines 8071 8078) no Hoare annotation was computed. [2018-11-18 15:47:06,828 INFO L425 ceAbstractionStarter]: For program point L8063(lines 8063 8069) no Hoare annotation was computed. [2018-11-18 15:47:06,828 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 8011 8083) no Hoare annotation was computed. [2018-11-18 15:47:06,828 INFO L421 ceAbstractionStarter]: At program point L8026(line 8026) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,828 INFO L421 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 8011 8083) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (= |old(~s~0)| ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,828 INFO L425 ceAbstractionStarter]: For program point L8076-1(lines 8058 8080) no Hoare annotation was computed. [2018-11-18 15:47:06,828 INFO L421 ceAbstractionStarter]: At program point L8076(line 8076) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,836 INFO L421 ceAbstractionStarter]: At program point L8035(lines 8034 8057) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (= |old(~s~0)| ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point L8019-1(lines 8018 8082) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point L8019(lines 8019 8033) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 8042 8054) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 8042 8054) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point L8024(lines 8024 8030) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L421 ceAbstractionStarter]: At program point L8053(lines 8018 8082) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (= |old(~s~0)| ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,837 INFO L421 ceAbstractionStarter]: At program point L8041(lines 8040 8055) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (= |old(~s~0)| ~s~0) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point L8037(lines 8037 8056) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 7284 7291) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L428 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 7284 7291) the Hoare annotation is: true [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 7284 7291) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L425 ceAbstractionStarter]: For program point L3772(lines 3772 3778) no Hoare annotation was computed. [2018-11-18 15:47:06,837 INFO L421 ceAbstractionStarter]: At program point L3706(lines 3705 3796) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (= |old(~s~0)| ~s~0) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,838 INFO L425 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 3688 3814) no Hoare annotation was computed. [2018-11-18 15:47:06,838 INFO L421 ceAbstractionStarter]: At program point L3810(line 3810) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (= ~SKIP1~0 ~s~0) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,847 INFO L425 ceAbstractionStarter]: For program point L3810-1(line 3810) no Hoare annotation was computed. [2018-11-18 15:47:06,847 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 3713 3793) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L421 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 3688 3814) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (= |old(~s~0)| ~s~0) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3757(lines 3757 3767) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3757-2(lines 3757 3767) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3753(lines 3753 3784) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L421 ceAbstractionStarter]: At program point L3774(line 3774) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (= |old(~s~0)| ~s~0) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3708(lines 3708 3795) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3741-1(line 3741) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L421 ceAbstractionStarter]: At program point L3741(line 3741) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (= ~NP~0 ~s~0) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3774-1(line 3774) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point L3717-1(lines 3717 3726) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 3713 3793) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L425 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 3688 3814) no Hoare annotation was computed. [2018-11-18 15:47:06,848 INFO L421 ceAbstractionStarter]: At program point L3804(line 3804) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,848 INFO L421 ceAbstractionStarter]: At program point L3709(lines 3708 3795) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (= |old(~s~0)| ~s~0) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,858 INFO L425 ceAbstractionStarter]: For program point L3771(lines 3771 3781) no Hoare annotation was computed. [2018-11-18 15:47:06,858 INFO L425 ceAbstractionStarter]: For program point L3804-1(lines 3800 3806) no Hoare annotation was computed. [2018-11-18 15:47:06,858 INFO L425 ceAbstractionStarter]: For program point L3705(lines 3705 3796) no Hoare annotation was computed. [2018-11-18 15:47:06,858 INFO L425 ceAbstractionStarter]: For program point L3730(lines 3730 3746) no Hoare annotation was computed. [2018-11-18 15:47:06,859 INFO L421 ceAbstractionStarter]: At program point L3792(lines 3696 3813) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (= ~NP~0 ~s~0) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,859 INFO L425 ceAbstractionStarter]: For program point L3718(lines 3718 3723) no Hoare annotation was computed. [2018-11-18 15:47:06,859 INFO L428 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 3678 3687) the Hoare annotation is: true [2018-11-18 15:47:06,859 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 3678 3687) no Hoare annotation was computed. [2018-11-18 15:47:06,859 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 3678 3687) no Hoare annotation was computed. [2018-11-18 15:47:06,859 INFO L425 ceAbstractionStarter]: For program point L3683-1(line 3683) no Hoare annotation was computed. [2018-11-18 15:47:06,859 INFO L428 ceAbstractionStarter]: At program point L3683(line 3683) the Hoare annotation is: true [2018-11-18 15:47:06,859 INFO L421 ceAbstractionStarter]: At program point L7866(lines 7858 7879) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse9 (not (= (_ bv0 32) ~pended~0))) (.cse10 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse7 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse13 (or (or .cse0 .cse2 (or .cse1 .cse4 .cse6 .cse9)) .cse10)) (.cse17 (not (= |old(~s~0)| ~MPR3~0))) (.cse11 (not (= ~PagingMutex~0.offset (_ bv0 32)))) (.cse5 (not (= (_ bv1 32) ~NP~0))) (.cse14 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse15 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse16 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= ~NP~0 |old(~s~0)|))) (.cse12 (= (_ bv0 32) ~PagingMutex~0.base)) (.cse3 (= |old(~s~0)| ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse3 .cse6 .cse7 .cse8 (not (= (_ bv1 32) ~pended~0)) .cse10) (or .cse11 .cse12 (or .cse13 .cse5 .cse14 .cse15 .cse16 .cse17)) (or .cse13 (not (= ~myStatus~0 (_ bv0 32))) .cse5 .cse14 .cse15 .cse16 .cse17) (or .cse11 (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10) .cse12 (and (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse3))))) [2018-11-18 15:47:06,859 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 7853 7896) no Hoare annotation was computed. [2018-11-18 15:47:06,859 INFO L425 ceAbstractionStarter]: For program point L7858(lines 7858 7879) no Hoare annotation was computed. [2018-11-18 15:47:06,864 INFO L425 ceAbstractionStarter]: For program point L7891(lines 7853 7896) no Hoare annotation was computed. [2018-11-18 15:47:06,864 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 7885 7892) no Hoare annotation was computed. [2018-11-18 15:47:06,864 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 7885 7892) no Hoare annotation was computed. [2018-11-18 15:47:06,864 INFO L421 ceAbstractionStarter]: At program point L7881(lines 7880 7894) the Hoare annotation is: (let ((.cse9 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse11 (not (= (_ bv3 32) ~SKIP1~0))) (.cse10 (not (= (_ bv6 32) ~MPR3~0))) (.cse12 (not (= (_ bv7 32) ~IPC~0))) (.cse13 (not (= (_ bv4 32) ~SKIP2~0))) (.cse17 (not (= (_ bv0 32) ~pended~0))) (.cse16 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse3 (or (or .cse9 .cse11 (or .cse10 .cse12 .cse13 .cse17)) .cse16)) (.cse8 (not (= |old(~s~0)| ~MPR3~0))) (.cse14 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse1 (= ~NP~0 ~s~0)) (.cse0 (not (= ~PagingMutex~0.offset (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse6 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse15 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (= (_ bv0 32) ~PagingMutex~0.base))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse3 .cse1 (not (= ~myStatus~0 (_ bv0 32))) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse15 (not (= (_ bv1 32) ~pended~0)) .cse16) (or .cse9 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse15 .cse17 .cse16 .cse1) (or .cse0 (and (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (or .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse15 .cse17 .cse16) .cse2)))) [2018-11-18 15:47:06,864 INFO L425 ceAbstractionStarter]: For program point L7871-1(lines 7857 7895) no Hoare annotation was computed. [2018-11-18 15:47:06,864 INFO L425 ceAbstractionStarter]: For program point L7871(lines 7871 7877) no Hoare annotation was computed. [2018-11-18 15:47:06,865 INFO L421 ceAbstractionStarter]: At program point L7873(line 7873) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= (_ bv4 32) ~SKIP2~0))) (.cse16 (not (= (_ bv0 32) ~pended~0))) (.cse8 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse11 (or (or .cse0 .cse2 (or .cse1 .cse3 .cse5 .cse16)) .cse8)) (.cse15 (not (= |old(~s~0)| ~MPR3~0))) (.cse9 (not (= ~PagingMutex~0.offset (_ bv0 32)))) (.cse12 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse13 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse14 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse10 (= (_ bv0 32) ~PagingMutex~0.base)) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse7 (not (= ~NP~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv1 32) ~pended~0)) .cse8) (or .cse9 .cse10 (or .cse11 .cse4 .cse12 .cse13 .cse14 .cse15)) (or .cse11 (not (= ~myStatus~0 (_ bv0 32))) .cse4 .cse12 .cse13 .cse14 .cse15) (or .cse9 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse14 .cse5 .cse7 .cse16 .cse8) .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8)))) [2018-11-18 15:47:06,865 INFO L425 ceAbstractionStarter]: For program point L7859(lines 7859 7864) no Hoare annotation was computed. [2018-11-18 15:47:06,865 INFO L421 ceAbstractionStarter]: At program point L7884(lines 7883 7893) the Hoare annotation is: (let ((.cse9 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse11 (not (= (_ bv3 32) ~SKIP1~0))) (.cse10 (not (= (_ bv6 32) ~MPR3~0))) (.cse12 (not (= (_ bv7 32) ~IPC~0))) (.cse13 (not (= (_ bv4 32) ~SKIP2~0))) (.cse17 (not (= (_ bv0 32) ~pended~0))) (.cse16 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse3 (or (or .cse9 .cse11 (or .cse10 .cse12 .cse13 .cse17)) .cse16)) (.cse8 (not (= |old(~s~0)| ~MPR3~0))) (.cse14 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse1 (= ~NP~0 ~s~0)) (.cse0 (not (= ~PagingMutex~0.offset (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse6 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse15 (not (= ~NP~0 |old(~s~0)|))) (.cse2 (= (_ bv0 32) ~PagingMutex~0.base))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse3 .cse1 (not (= ~myStatus~0 (_ bv0 32))) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse1 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse15 (not (= (_ bv1 32) ~pended~0)) .cse16) (or .cse9 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse15 .cse17 .cse16 .cse1) (or .cse0 (and (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (or .cse9 .cse10 .cse11 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse15 .cse17 .cse16) .cse2)))) [2018-11-18 15:47:06,873 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 7853 7896) the Hoare annotation is: (let ((.cse8 (= |old(~s~0)| ~s~0)) (.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= (_ bv4 32) ~SKIP2~0))) (.cse18 (not (= (_ bv0 32) ~pended~0))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse6 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse13 (or (or .cse0 .cse2 (or .cse1 .cse3 .cse5 .cse18)) .cse9)) (.cse17 (not (= |old(~s~0)| ~MPR3~0))) (.cse10 (not (= ~PagingMutex~0.offset (_ bv0 32)))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse14 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse15 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse16 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse7 (not (= ~NP~0 |old(~s~0)|))) (.cse11 (= (_ bv0 32) ~PagingMutex~0.base)) (.cse12 (and (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse8))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (_ bv1 32) ~pended~0)) .cse9) (or .cse10 .cse11 .cse12 (or .cse13 .cse4 .cse14 .cse15 .cse16 .cse17)) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9) (or .cse13 .cse12 (not (= ~myStatus~0 (_ bv0 32))) .cse4 .cse14 .cse15 .cse16 .cse17) (or .cse10 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse16 .cse5 .cse7 .cse18 .cse9) .cse11 .cse12)))) [2018-11-18 15:47:06,873 INFO L425 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 7822 7829) no Hoare annotation was computed. [2018-11-18 15:47:06,873 INFO L428 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 7822 7829) the Hoare annotation is: true [2018-11-18 15:47:06,873 INFO L425 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 7822 7829) no Hoare annotation was computed. [2018-11-18 15:47:06,873 INFO L425 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 2187 2198) no Hoare annotation was computed. [2018-11-18 15:47:06,873 INFO L428 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 2187 2198) the Hoare annotation is: true [2018-11-18 15:47:06,873 INFO L425 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 2187 2198) no Hoare annotation was computed. [2018-11-18 15:47:06,873 INFO L425 ceAbstractionStarter]: For program point L7756-1(lines 7748 7761) no Hoare annotation was computed. [2018-11-18 15:47:06,884 INFO L421 ceAbstractionStarter]: At program point L7756(line 7756) the Hoare annotation is: (let ((.cse8 (not (= ~NP~0 |old(~s~0)|)))) (let ((.cse4 (or .cse8 (not (= (_ bv0 32) ~pended~0)))) (.cse6 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse0 (not (= (_ bv6 32) ~MPR3~0))) (.cse7 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (not (= (_ bv7 32) ~IPC~0))) (.cse2 (not (= (_ bv1 32) ~NP~0))) (.cse3 (not (= (_ bv4 32) ~SKIP2~0))) (.cse5 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~compRegistered~0 (_ bv0 32))) .cse4 .cse5) (or .cse6 .cse0 .cse7 .cse1 .cse2 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 .cse1 .cse2 .cse3 .cse8 (not (= (_ bv1 32) ~pended~0)) .cse5)))) [2018-11-18 15:47:06,884 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 7748 7761) the Hoare annotation is: (let ((.cse7 (not (= ~NP~0 |old(~s~0)|)))) (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse9 (or .cse7 (not (= (_ bv0 32) ~pended~0)))) (.cse8 (not (= (_ bv2 32) ~DC~0))) (.cse3 (= |old(~s~0)| ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv1 32) ~pended~0)) .cse8) (or .cse1 .cse4 .cse5 .cse6 (not (= ~compRegistered~0 (_ bv0 32))) .cse9 (= ~NP~0 ~s~0) .cse8) (or (or .cse0 .cse1 .cse2 .cse4 .cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse9 .cse8) .cse3)))) [2018-11-18 15:47:06,884 INFO L425 ceAbstractionStarter]: For program point L7752(lines 7752 7758) no Hoare annotation was computed. [2018-11-18 15:47:06,884 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 7748 7761) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 15:47:06,885 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L428 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 1774 1778) the Hoare annotation is: true [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 1774 1778) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 1774 1778) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point L8116(lines 8099 8121) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 8099 8121) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L428 ceAbstractionStarter]: At program point L8106(lines 8105 8119) the Hoare annotation is: true [2018-11-18 15:47:06,885 INFO L428 ceAbstractionStarter]: At program point L8109(lines 8108 8118) the Hoare annotation is: true [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point L8105(lines 8105 8119) no Hoare annotation was computed. [2018-11-18 15:47:06,885 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 8110 8117) no Hoare annotation was computed. [2018-11-18 15:47:06,890 INFO L428 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 8099 8121) the Hoare annotation is: true [2018-11-18 15:47:06,890 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 8110 8117) no Hoare annotation was computed. [2018-11-18 15:47:06,890 INFO L425 ceAbstractionStarter]: For program point L3611-1(lines 3611 3633) no Hoare annotation was computed. [2018-11-18 15:47:06,891 INFO L421 ceAbstractionStarter]: At program point L3545-1(line 3545) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,891 INFO L421 ceAbstractionStarter]: At program point L3611-3(lines 3611 3633) the Hoare annotation is: (let ((.cse2 (= (_ bv1 32) ~NP~0)) (.cse3 (= (_ bv2 32) ~DC~0)) (.cse1 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse0 (and (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) .cse2 (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~NP~0) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) .cse3 (= (_ bv1 32) ~compRegistered~0) .cse1))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (and .cse0 (not (bvsge FloppyStartDevice_~ntStatus~4 (_ bv0 32)))) (or (not .cse1) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not .cse2) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not .cse3)) (and .cse0 (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base) (and .cse0 (= (_ bv0 32) FloppyStartDevice_~InterfaceType~0))))) [2018-11-18 15:47:06,891 INFO L421 ceAbstractionStarter]: At program point L3545(line 3545) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,891 INFO L421 ceAbstractionStarter]: At program point L3603(lines 3589 3636) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,892 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 3516 3677) no Hoare annotation was computed. [2018-11-18 15:47:06,892 INFO L421 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 3516 3677) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,892 INFO L421 ceAbstractionStarter]: At program point L3620(lines 3620 3623) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3554(lines 3554 3561) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3587-1(lines 3587 3669) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3587(lines 3587 3669) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3620-1(lines 3620 3623) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3554-1(lines 3549 3562) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3612(lines 3611 3633) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3546(line 3546) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3604(lines 3604 3608) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3571-1(line 3571) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L425 ceAbstractionStarter]: For program point L3604-2(lines 3604 3608) no Hoare annotation was computed. [2018-11-18 15:47:06,893 INFO L421 ceAbstractionStarter]: At program point L3571(line 3571) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= (_ bv0 32) ~pended~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:06,896 INFO L421 ceAbstractionStarter]: At program point L3662(line 3662) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,896 INFO L421 ceAbstractionStarter]: At program point L3646(lines 3646 3647) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3613(lines 3613 3617) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3646-1(lines 3646 3647) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3638(lines 3638 3644) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3638-2(lines 3638 3644) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L421 ceAbstractionStarter]: At program point L3556(line 3556) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3589(lines 3589 3636) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3573(lines 3573 3580) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3573-2(lines 3573 3580) no Hoare annotation was computed. [2018-11-18 15:47:06,896 INFO L425 ceAbstractionStarter]: For program point L3590(lines 3590 3601) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L425 ceAbstractionStarter]: For program point L3549(lines 3549 3562) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L425 ceAbstractionStarter]: For program point L3673-1(line 3673) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L421 ceAbstractionStarter]: At program point L3673(line 3673) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= ~NP~0 ~s~0)) (.cse2 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse0 .cse1 (not (bvsge FloppyStartDevice_~ntStatus~4 (_ bv0 32))) .cse2 .cse3) (and .cse1 (= (_ bv1 32) ~pended~0)) (= (_ bv0 32) ~PagingMutex~0.base) (and .cse0 .cse1 .cse2 .cse3 (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))))) [2018-11-18 15:47:06,902 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 3516 3677) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L425 ceAbstractionStarter]: For program point L3649(lines 3649 3656) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L425 ceAbstractionStarter]: For program point L3649-2(lines 3649 3656) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L425 ceAbstractionStarter]: For program point L3575-1(line 3575) no Hoare annotation was computed. [2018-11-18 15:47:06,902 INFO L421 ceAbstractionStarter]: At program point L3575(line 3575) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (bvadd FloppyStartDevice_~ntStatus~4 (_ bv4294967037 32)) (_ bv0 32))) (.cse3 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv1 32) ~compRegistered~0))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |old(~s~0)| ~s~0)) (and .cse0 .cse1 .cse2 (= ~MPR3~0 ~s~0) .cse3 .cse4) (= (_ bv0 32) ~PagingMutex~0.base))) [2018-11-18 15:47:06,902 INFO L421 ceAbstractionStarter]: At program point L3592(line 3592) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,903 INFO L425 ceAbstractionStarter]: For program point L3625(lines 3625 3631) no Hoare annotation was computed. [2018-11-18 15:47:06,903 INFO L425 ceAbstractionStarter]: For program point L3592-1(line 3592) no Hoare annotation was computed. [2018-11-18 15:47:06,903 INFO L421 ceAbstractionStarter]: At program point L3584(lines 3584 3585) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,905 INFO L421 ceAbstractionStarter]: At program point L3551(line 3551) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,906 INFO L425 ceAbstractionStarter]: For program point L3584-1(lines 3584 3585) no Hoare annotation was computed. [2018-11-18 15:47:06,906 INFO L421 ceAbstractionStarter]: At program point L3634(lines 3587 3667) the Hoare annotation is: (let ((.cse2 (= (_ bv1 32) ~NP~0)) (.cse3 (= (_ bv2 32) ~DC~0)) (.cse1 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse0 (and (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) .cse2 (= ~NP~0 ~s~0) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~NP~0) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) .cse3 (= (_ bv1 32) ~compRegistered~0) .cse1))) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (and .cse0 (not (bvsge FloppyStartDevice_~ntStatus~4 (_ bv0 32)))) (or (not .cse1) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not .cse2) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not .cse3)) (and .cse0 (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base)))) [2018-11-18 15:47:06,906 INFO L425 ceAbstractionStarter]: For program point L3651-1(lines 3651 3652) no Hoare annotation was computed. [2018-11-18 15:47:06,906 INFO L421 ceAbstractionStarter]: At program point L3651(lines 3651 3652) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (and (= ~NP~0 ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:06,906 INFO L425 ceAbstractionStarter]: For program point L3594(lines 3594 3598) no Hoare annotation was computed. [2018-11-18 15:47:06,906 INFO L425 ceAbstractionStarter]: For program point L7995(lines 7979 8000) no Hoare annotation was computed. [2018-11-18 15:47:06,906 INFO L428 ceAbstractionStarter]: At program point L7988(lines 7987 7997) the Hoare annotation is: true [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point L7984(lines 7984 7998) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L428 ceAbstractionStarter]: At program point L7985(lines 7984 7998) the Hoare annotation is: true [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 7979 8000) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L428 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 7979 8000) the Hoare annotation is: true [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 7989 7996) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 7989 7996) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point L8210(lines 8194 8215) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L428 ceAbstractionStarter]: At program point L8203(lines 8202 8212) the Hoare annotation is: true [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 8194 8215) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L425 ceAbstractionStarter]: For program point L8199(lines 8199 8213) no Hoare annotation was computed. [2018-11-18 15:47:06,912 INFO L428 ceAbstractionStarter]: At program point L8200(lines 8199 8213) the Hoare annotation is: true [2018-11-18 15:47:06,912 INFO L428 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 8194 8215) the Hoare annotation is: true [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 8204 8211) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 8204 8211) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point L7410(lines 7387 7415) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L428 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 7387 7415) the Hoare annotation is: true [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 7387 7415) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L428 ceAbstractionStarter]: At program point L7400(lines 7399 7412) the Hoare annotation is: true [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 7401 7411) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point L7396(lines 7396 7413) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L428 ceAbstractionStarter]: At program point L7397(lines 7396 7413) the Hoare annotation is: true [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 7401 7411) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 7841 7848) the Hoare annotation is: true [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 7841 7848) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 7841 7848) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 7027 7040) no Hoare annotation was computed. [2018-11-18 15:47:06,913 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 7027 7040) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:06,919 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 7027 7040) no Hoare annotation was computed. [2018-11-18 15:47:06,919 INFO L425 ceAbstractionStarter]: For program point L2179-2(lines 2179 2183) no Hoare annotation was computed. [2018-11-18 15:47:06,919 INFO L425 ceAbstractionStarter]: For program point L2174(lines 2174 2178) no Hoare annotation was computed. [2018-11-18 15:47:06,919 INFO L425 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2142 2186) no Hoare annotation was computed. [2018-11-18 15:47:06,919 INFO L425 ceAbstractionStarter]: For program point L2174-2(lines 2174 2178) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2142 2186) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L428 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2142 2186) the Hoare annotation is: true [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point L2163(lines 2163 2167) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L428 ceAbstractionStarter]: At program point L2160(line 2160) the Hoare annotation is: true [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point L2160-1(line 2160) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point L2179(lines 2179 2183) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 15:47:06,920 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 2095 2101) the Hoare annotation is: true [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 2095 2101) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2099) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 2095 2101) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L425 ceAbstractionStarter]: For program point L8254(lines 8254 8268) no Hoare annotation was computed. [2018-11-18 15:47:06,920 INFO L428 ceAbstractionStarter]: At program point L8255(lines 8254 8268) the Hoare annotation is: true [2018-11-18 15:47:06,921 INFO L425 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 8248 8270) no Hoare annotation was computed. [2018-11-18 15:47:06,921 INFO L428 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 8248 8270) the Hoare annotation is: true [2018-11-18 15:47:06,921 INFO L425 ceAbstractionStarter]: For program point L8265(lines 8248 8270) no Hoare annotation was computed. [2018-11-18 15:47:06,925 INFO L428 ceAbstractionStarter]: At program point L8258(lines 8257 8267) the Hoare annotation is: true [2018-11-18 15:47:06,925 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 8259 8266) no Hoare annotation was computed. [2018-11-18 15:47:06,925 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 8259 8266) no Hoare annotation was computed. [2018-11-18 15:47:06,925 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:47:06,925 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 15:47:06,926 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:47:06,926 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:47:06,926 INFO L421 ceAbstractionStarter]: At program point L7703(lines 7702 7717) the Hoare annotation is: (let ((.cse3 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse4 (not (= (_ bv6 32) ~MPR3~0))) (.cse5 (not (= (_ bv3 32) ~SKIP1~0))) (.cse6 (not (= (_ bv7 32) ~IPC~0))) (.cse7 (not (= (_ bv1 32) ~NP~0))) (.cse9 (not (= (_ bv4 32) ~SKIP2~0))) (.cse12 (not (= (_ bv0 32) ~pended~0))) (.cse11 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse2 (= |old(~s~0)| ~s~0)) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse10 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse1 (or .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse9 (or (not (= ~NP~0 |old(~s~0)|)) .cse12) .cse11)) (.cse0 (and (= ~MPR1~0 ~s~0) (= (bvadd IofCallDriver_~compRetStatus1~0 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))))) (and (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse0 .cse1 (= (_ bv0 32) ~PagingMutex~0.base)) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (_ bv1 32) ~pended~0)) .cse11) (or .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (or .cse1 .cse0 (not (= ~myStatus~0 (_ bv0 32))))))) [2018-11-18 15:47:06,926 INFO L425 ceAbstractionStarter]: For program point L7699(lines 7699 7718) no Hoare annotation was computed. [2018-11-18 15:47:06,926 INFO L425 ceAbstractionStarter]: For program point L7724(lines 7724 7741) no Hoare annotation was computed. [2018-11-18 15:47:06,926 INFO L425 ceAbstractionStarter]: For program point L7683-1(line 7683) no Hoare annotation was computed. [2018-11-18 15:47:06,926 INFO L421 ceAbstractionStarter]: At program point L7683(line 7683) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse8 (not (= (_ bv0 32) ~pended~0))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse7 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse10 (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse6 (or (not (= ~NP~0 |old(~s~0)|)) .cse8) .cse9)) (.cse11 (= |old(~s~0)| ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv1 32) ~pended~0)) .cse9) (or .cse10 (not (= ~myStatus~0 (_ bv0 32))) .cse11) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse10 .cse11 (= (_ bv0 32) ~PagingMutex~0.base))))) [2018-11-18 15:47:06,926 INFO L421 ceAbstractionStarter]: At program point L7700(lines 7699 7718) the Hoare annotation is: (let ((.cse17 (= (_ bv2 32) ~DC~0)) (.cse14 (= (_ bv0 32) ~pended~0)) (.cse13 (= (_ bv1 32) ~NP~0)) (.cse15 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse3 (not .cse15)) (.cse4 (not (= (_ bv6 32) ~MPR3~0))) (.cse5 (not (= (_ bv3 32) ~SKIP1~0))) (.cse6 (not (= (_ bv7 32) ~IPC~0))) (.cse7 (not .cse13)) (.cse16 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse9 (not (= (_ bv4 32) ~SKIP2~0))) (.cse12 (not .cse14)) (.cse11 (not .cse17))) (let ((.cse2 (= |old(~s~0)| ~s~0)) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse10 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse0 (or .cse3 .cse4 .cse5 .cse6 .cse7 (not .cse16) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse9 (or (not (= ~NP~0 |old(~s~0)|)) .cse12) .cse11)) (.cse1 (and .cse13 .cse14 (= |old(~s~0)| ~NP~0) (= ~MPR1~0 ~s~0) .cse15 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd IofCallDriver_~compRetStatus1~0 (_ bv1073741802 32)) (_ bv0 32)) .cse16 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32)) .cse17 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ~compRegistered~0)))) (and (or .cse0 (not (= ~myStatus~0 (_ bv0 32))) .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (_ bv1 32) ~pended~0)) .cse11) (or .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse0 (= (_ bv0 32) ~PagingMutex~0.base) .cse1))))) [2018-11-18 15:47:06,935 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 7672 7745) the Hoare annotation is: (let ((.cse1 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv3 32) ~SKIP1~0))) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= (_ bv1 32) ~NP~0))) (.cse7 (not (= (_ bv4 32) ~SKIP2~0))) (.cse10 (not (= (_ bv0 32) ~pended~0))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse6 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse11 (or .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse7 (or (not (= ~NP~0 |old(~s~0)|)) .cse10) .cse9)) (.cse0 (= |old(~s~0)| ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (_ bv1 32) ~pended~0)) .cse9) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9) (or .cse11 (not (= ~myStatus~0 (_ bv0 32))) .cse0) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse11 .cse0 (= (_ bv0 32) ~PagingMutex~0.base))))) [2018-11-18 15:47:06,936 INFO L425 ceAbstractionStarter]: For program point L7733(lines 7733 7740) no Hoare annotation was computed. [2018-11-18 15:47:06,936 INFO L425 ceAbstractionStarter]: For program point L7725(lines 7725 7731) no Hoare annotation was computed. [2018-11-18 15:47:06,936 INFO L421 ceAbstractionStarter]: At program point L7688(line 7688) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse8 (not (= (_ bv0 32) ~pended~0))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse7 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse11 (and (= (bvadd IofCallDriver_~compRetStatus1~0 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0))) (.cse10 (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse6 (or (not (= ~NP~0 |old(~s~0)|)) .cse8) .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (not (= ~myStatus~0 (_ bv0 32))) .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv1 32) ~pended~0)) .cse9) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse11 .cse10 (= (_ bv0 32) ~PagingMutex~0.base))))) [2018-11-18 15:47:06,948 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 7672 7745) no Hoare annotation was computed. [2018-11-18 15:47:06,948 INFO L421 ceAbstractionStarter]: At program point L7738(line 7738) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse8 (not (= (_ bv0 32) ~pended~0))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse7 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse10 (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse6 (or (not (= ~NP~0 |old(~s~0)|)) .cse8) .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (not (= ~myStatus~0 (_ bv0 32)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (_ bv1 32) ~pended~0)) .cse9) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse10 (= (_ bv0 32) ~PagingMutex~0.base))))) [2018-11-18 15:47:06,948 INFO L425 ceAbstractionStarter]: For program point L7738-1(lines 7720 7742) no Hoare annotation was computed. [2018-11-18 15:47:06,948 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 7672 7745) no Hoare annotation was computed. [2018-11-18 15:47:06,948 INFO L421 ceAbstractionStarter]: At program point L7697(lines 7696 7719) the Hoare annotation is: (let ((.cse3 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse4 (not (= (_ bv6 32) ~MPR3~0))) (.cse5 (not (= (_ bv3 32) ~SKIP1~0))) (.cse6 (not (= (_ bv7 32) ~IPC~0))) (.cse7 (not (= (_ bv1 32) ~NP~0))) (.cse9 (not (= (_ bv4 32) ~SKIP2~0))) (.cse12 (not (= (_ bv0 32) ~pended~0))) (.cse11 (not (= (_ bv2 32) ~DC~0)))) (let ((.cse2 (= |old(~s~0)| ~s~0)) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse10 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse1 (or .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse9 (or (not (= ~NP~0 |old(~s~0)|)) .cse12) .cse11)) (.cse0 (and (= ~MPR1~0 ~s~0) (= (bvadd IofCallDriver_~compRetStatus1~0 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))))) (and (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse0 .cse1 (= (_ bv0 32) ~PagingMutex~0.base)) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (_ bv1 32) ~pended~0)) .cse11) (or .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11) (or .cse1 (not (= ~myStatus~0 (_ bv0 32))) .cse0)))) [2018-11-18 15:47:06,960 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 7704 7716) no Hoare annotation was computed. [2018-11-18 15:47:06,961 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 7704 7716) no Hoare annotation was computed. [2018-11-18 15:47:06,961 INFO L425 ceAbstractionStarter]: For program point L7681-1(lines 7680 7744) no Hoare annotation was computed. [2018-11-18 15:47:06,961 INFO L425 ceAbstractionStarter]: For program point L7681(lines 7681 7695) no Hoare annotation was computed. [2018-11-18 15:47:06,961 INFO L425 ceAbstractionStarter]: For program point L7686(lines 7686 7692) no Hoare annotation was computed. [2018-11-18 15:47:06,961 INFO L421 ceAbstractionStarter]: At program point L7715(lines 7680 7744) the Hoare annotation is: (let ((.cse26 (= (_ bv2 32) ~DC~0)) (.cse17 (= (_ bv0 32) ~pended~0)) (.cse16 (= (_ bv1 32) ~NP~0)) (.cse20 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (let ((.cse1 (not .cse20)) (.cse2 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv3 32) ~SKIP1~0))) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not .cse16)) (.cse7 (not (= (_ bv4 32) ~SKIP2~0))) (.cse13 (not .cse17)) (.cse9 (not .cse26)) (.cse14 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse19 (= ~MPR1~0 ~s~0)) (.cse23 (= (bvadd IofCallDriver_~compRetStatus1~0 (_ bv1073741802 32)) (_ bv0 32))) (.cse15 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse0 (= |old(~s~0)| ~s~0)) (.cse6 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse11 (and .cse19 .cse23 .cse15 (= (_ bv259 32) IofCallDriver_~returnVal2~0))) (.cse12 (and .cse15 (let ((.cse18 (= |old(~s~0)| ~NP~0)) (.cse21 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse22 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse24 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse25 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse27 (= (_ bv1 32) ~compRegistered~0))) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= (_ bv3221225473 32) IofCallDriver_~returnVal2~0) .cse22 .cse23 .cse14 .cse24 .cse25 .cse26 .cse27) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= (_ bv0 32) IofCallDriver_~returnVal2~0) .cse14 .cse24 .cse25 .cse26 .cse27))))) (.cse10 (or .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse14) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse7 (or (not (= ~NP~0 |old(~s~0)|)) .cse13) .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (_ bv1 32) ~pended~0)) .cse9) (or .cse10 (not (= ~myStatus~0 (_ bv0 32))) .cse11 .cse12) (or .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9) (or (not (= ~PagingMutex~0.offset (_ bv0 32))) .cse11 .cse12 .cse10 (= (_ bv0 32) ~PagingMutex~0.base)))))) [2018-11-18 15:47:06,971 INFO L425 ceAbstractionStarter]: For program point L2620(lines 2620 2626) no Hoare annotation was computed. [2018-11-18 15:47:06,971 INFO L425 ceAbstractionStarter]: For program point L2620-2(lines 2620 2626) no Hoare annotation was computed. [2018-11-18 15:47:06,971 INFO L425 ceAbstractionStarter]: For program point L2614(lines 2614 2634) no Hoare annotation was computed. [2018-11-18 15:47:06,971 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 2557 2666) no Hoare annotation was computed. [2018-11-18 15:47:06,971 INFO L425 ceAbstractionStarter]: For program point L2641(lines 2641 2645) no Hoare annotation was computed. [2018-11-18 15:47:06,972 INFO L421 ceAbstractionStarter]: At program point L2662(line 2662) the Hoare annotation is: (let ((.cse4 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv6 32) ~MPR3~0))) (.cse6 (not (= (_ bv3 32) ~SKIP1~0))) (.cse7 (not (= (_ bv7 32) ~IPC~0))) (.cse0 (not (= (_ bv1 32) ~NP~0))) (.cse1 (not (= (_ bv4 32) ~SKIP2~0))) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (not (= ~NP~0 ~s~0))) (.cse3 (= (_ bv1 32) ~pended~0)) (.cse9 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse10 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 .cse1 .cse2 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse3) .cse4 .cse5 .cse6 .cse7 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse8 .cse9 .cse10 (and .cse3 (= ~PagingReferenceCount~0 (_ bv0 32)))) (or .cse4 .cse5 .cse6 .cse7 .cse0 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse1 .cse8 .cse2 .cse3 .cse9 .cse10))) [2018-11-18 15:47:06,972 INFO L425 ceAbstractionStarter]: For program point L2596(lines 2596 2602) no Hoare annotation was computed. [2018-11-18 15:47:06,972 INFO L425 ceAbstractionStarter]: For program point L2660(lines 2660 2661) no Hoare annotation was computed. [2018-11-18 15:47:06,982 INFO L425 ceAbstractionStarter]: For program point L2662-1(line 2662) no Hoare annotation was computed. [2018-11-18 15:47:06,982 INFO L425 ceAbstractionStarter]: For program point L2596-2(lines 2596 2602) no Hoare annotation was computed. [2018-11-18 15:47:06,982 INFO L421 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 2557 2666) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv6 32) ~MPR3~0))) (.cse3 (not (= (_ bv3 32) ~SKIP1~0))) (.cse1 (= (_ bv0 32) ~pended~0)) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse7 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse8 (not (= ~NP~0 ~s~0))) (.cse9 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse10 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 (and .cse1 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse1) .cse4 .cse5 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-18 15:47:06,982 INFO L421 ceAbstractionStarter]: At program point L2656(line 2656) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (not (= (_ bv7 32) ~IPC~0))) (.cse4 (not (= (_ bv1 32) ~NP~0))) (.cse5 (not (= (_ bv4 32) ~SKIP2~0))) (.cse6 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse7 (not (= ~NP~0 ~s~0))) (.cse8 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse9 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-11-18 15:47:06,982 INFO L425 ceAbstractionStarter]: For program point L2590(lines 2590 2650) no Hoare annotation was computed. [2018-11-18 15:47:06,982 INFO L421 ceAbstractionStarter]: At program point L2656-1(lines 2652 2658) the Hoare annotation is: (let ((.cse4 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv6 32) ~MPR3~0))) (.cse6 (not (= (_ bv3 32) ~SKIP1~0))) (.cse7 (not (= (_ bv7 32) ~IPC~0))) (.cse0 (not (= (_ bv1 32) ~NP~0))) (.cse1 (not (= (_ bv4 32) ~SKIP2~0))) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (not (= ~NP~0 ~s~0))) (.cse3 (= (_ bv1 32) ~pended~0)) (.cse9 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse10 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 .cse1 .cse2 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse3) .cse4 .cse5 .cse6 .cse7 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse8 .cse9 .cse10 (and .cse3 (= ~PagingReferenceCount~0 (_ bv0 32)))) (or .cse4 .cse5 .cse6 .cse7 .cse0 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse1 .cse8 .cse2 .cse3 .cse9 .cse10))) [2018-11-18 15:47:06,982 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 2557 2666) no Hoare annotation was computed. [2018-11-18 15:47:06,983 INFO L425 ceAbstractionStarter]: For program point L2590-2(lines 2590 2650) no Hoare annotation was computed. [2018-11-18 15:47:06,983 INFO L425 ceAbstractionStarter]: For program point L2652(lines 2652 2658) no Hoare annotation was computed. [2018-11-18 15:47:06,983 INFO L425 ceAbstractionStarter]: For program point L2611-1(lines 2611 2612) no Hoare annotation was computed. [2018-11-18 15:47:06,983 INFO L421 ceAbstractionStarter]: At program point L2611(lines 2611 2612) the Hoare annotation is: (let ((.cse0 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse1 (not (= (_ bv6 32) ~MPR3~0))) (.cse2 (not (= (_ bv3 32) ~SKIP1~0))) (.cse3 (= (_ bv0 32) ~pended~0)) (.cse4 (not (= (_ bv7 32) ~IPC~0))) (.cse5 (not (= (_ bv1 32) ~NP~0))) (.cse6 (not (= (_ bv4 32) ~SKIP2~0))) (.cse7 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse8 (not (= ~NP~0 ~s~0))) (.cse9 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse10 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 .cse1 .cse2 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse3) .cse4 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse7 .cse8 .cse9 .cse10))) [2018-11-18 15:47:06,990 INFO L421 ceAbstractionStarter]: At program point L2638(line 2638) the Hoare annotation is: (let ((.cse3 (not (= (_ bv1 32) ~NP~0))) (.cse4 (not (= (_ bv4 32) ~SKIP2~0))) (.cse5 (not (= ~NP~0 ~s~0))) (.cse7 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse6 (= FlQueueIrpToThread_~status~0 (_ bv0 32))) (.cse8 (not (= (_ bv6 32) ~MPR3~0))) (.cse9 (not (= (_ bv3 32) ~SKIP1~0))) (.cse10 (not (= (_ bv7 32) ~IPC~0))) (.cse11 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0)) (.cse12 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse13 (not (= (_ bv2 32) ~DC~0)))) (and (let ((.cse2 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 (and .cse0 .cse6 .cse2) .cse7 .cse8 .cse9 .cse10 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse11 .cse12 .cse13)) (or .cse3 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse5 .cse7 (and .cse6 .cse0) .cse8 .cse9 .cse10 .cse11 (and .cse0 .cse1) .cse12 .cse13))) [2018-11-18 15:47:06,991 INFO L421 ceAbstractionStarter]: At program point L2636(lines 2636 2637) the Hoare annotation is: (let ((.cse4 (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32)))) (.cse0 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv6 32) ~MPR3~0))) (.cse6 (not (= (_ bv3 32) ~SKIP1~0))) (.cse7 (not (= (_ bv7 32) ~IPC~0))) (.cse1 (not (= (_ bv1 32) ~NP~0))) (.cse2 (not (= (_ bv4 32) ~SKIP2~0))) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (not (= ~NP~0 ~s~0))) (.cse9 (not (= (_ bv0 32) |old(~pended~0)|))) (.cse10 (not (= (_ bv2 32) ~DC~0)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) .cse5 .cse6 .cse7 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse1 .cse2 .cse8 .cse3 .cse9 .cse10))) [2018-11-18 15:47:06,991 INFO L425 ceAbstractionStarter]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2018-11-18 15:47:06,991 INFO L425 ceAbstractionStarter]: For program point L2636-1(lines 2636 2637) no Hoare annotation was computed. [2018-11-18 15:47:06,991 INFO L425 ceAbstractionStarter]: For program point L2568(lines 2568 2580) no Hoare annotation was computed. [2018-11-18 15:47:06,991 INFO L425 ceAbstractionStarter]: For program point L2942(lines 2941 2959) no Hoare annotation was computed. [2018-11-18 15:47:06,991 INFO L425 ceAbstractionStarter]: For program point L2876(lines 2876 2903) no Hoare annotation was computed. [2018-11-18 15:47:06,991 INFO L421 ceAbstractionStarter]: At program point L2992(lines 2992 2993) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:06,998 INFO L425 ceAbstractionStarter]: For program point L2992-1(lines 2992 2993) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L2893(lines 2893 2898) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L421 ceAbstractionStarter]: At program point L2761(lines 2760 3127) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L2943(lines 2943 2947) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L2877(lines 2877 2882) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L2778(lines 2778 3121) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L2745-1(lines 2741 2747) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L421 ceAbstractionStarter]: At program point L2745(line 2745) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:06,999 INFO L421 ceAbstractionStarter]: At program point L3092(line 3092) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L3092-1(line 3092) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L2729(lines 2729 2739) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L3142(lines 3142 3158) no Hoare annotation was computed. [2018-11-18 15:47:06,999 INFO L425 ceAbstractionStarter]: For program point L3109-1(lines 3109 3110) no Hoare annotation was computed. [2018-11-18 15:47:07,000 INFO L421 ceAbstractionStarter]: At program point L3109(lines 3109 3110) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0))) [2018-11-18 15:47:07,012 INFO L425 ceAbstractionStarter]: For program point L2911(line 2911) no Hoare annotation was computed. [2018-11-18 15:47:07,012 INFO L425 ceAbstractionStarter]: For program point L2713(lines 2713 2725) no Hoare annotation was computed. [2018-11-18 15:47:07,012 INFO L425 ceAbstractionStarter]: For program point L2713-2(lines 2713 2725) no Hoare annotation was computed. [2018-11-18 15:47:07,012 INFO L421 ceAbstractionStarter]: At program point L2994(lines 2994 2995) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,012 INFO L425 ceAbstractionStarter]: For program point L2994-1(lines 2994 2995) no Hoare annotation was computed. [2018-11-18 15:47:07,012 INFO L425 ceAbstractionStarter]: For program point L2763(lines 2763 3126) no Hoare annotation was computed. [2018-11-18 15:47:07,012 INFO L421 ceAbstractionStarter]: At program point L3077(lines 2790 3117) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,012 INFO L425 ceAbstractionStarter]: For program point L2714(lines 2714 2722) no Hoare annotation was computed. [2018-11-18 15:47:07,013 INFO L425 ceAbstractionStarter]: For program point L2830(lines 2830 2835) no Hoare annotation was computed. [2018-11-18 15:47:07,013 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 2682 3180) no Hoare annotation was computed. [2018-11-18 15:47:07,013 INFO L425 ceAbstractionStarter]: For program point L3078(lines 3078 3097) no Hoare annotation was computed. [2018-11-18 15:47:07,013 INFO L425 ceAbstractionStarter]: For program point L2847-1(lines 2847 2848) no Hoare annotation was computed. [2018-11-18 15:47:07,013 INFO L421 ceAbstractionStarter]: At program point L2847(lines 2847 2848) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,013 INFO L425 ceAbstractionStarter]: For program point L2781(lines 2781 3120) no Hoare annotation was computed. [2018-11-18 15:47:07,013 INFO L425 ceAbstractionStarter]: For program point L3029(lines 3029 3045) no Hoare annotation was computed. [2018-11-18 15:47:07,019 INFO L425 ceAbstractionStarter]: For program point L2930(lines 2930 2937) no Hoare annotation was computed. [2018-11-18 15:47:07,019 INFO L425 ceAbstractionStarter]: For program point L2930-2(lines 2930 2937) no Hoare annotation was computed. [2018-11-18 15:47:07,019 INFO L425 ceAbstractionStarter]: For program point L3145(lines 3145 3157) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L421 ceAbstractionStarter]: At program point L2980(lines 2980 2981) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L2980-1(lines 2980 2981) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L2815-1(lines 2815 2816) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L421 ceAbstractionStarter]: At program point L2815(lines 2815 2816) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,020 INFO L421 ceAbstractionStarter]: At program point L2716(line 2716) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L2716-1(line 2716) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L3129(lines 3129 3177) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L3063-1(lines 3063 3064) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L421 ceAbstractionStarter]: At program point L3063(lines 3063 3064) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L2964(lines 2964 3076) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L2766(lines 2766 3125) no Hoare annotation was computed. [2018-11-18 15:47:07,020 INFO L425 ceAbstractionStarter]: For program point L2799(lines 2799 2804) no Hoare annotation was computed. [2018-11-18 15:47:07,029 INFO L425 ceAbstractionStarter]: For program point L2849-1(lines 2849 2850) no Hoare annotation was computed. [2018-11-18 15:47:07,030 INFO L421 ceAbstractionStarter]: At program point L2849(lines 2849 2850) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,030 INFO L421 ceAbstractionStarter]: At program point L2866(line 2866) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,030 INFO L425 ceAbstractionStarter]: For program point L2866-1(line 2866) no Hoare annotation was computed. [2018-11-18 15:47:07,030 INFO L421 ceAbstractionStarter]: At program point L2734(line 2734) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~NP~0 ~s~0) (= (_ bv0 32) ~pended~0))) [2018-11-18 15:47:07,030 INFO L421 ceAbstractionStarter]: At program point L2767(lines 2763 3126) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,030 INFO L425 ceAbstractionStarter]: For program point L2734-1(line 2734) no Hoare annotation was computed. [2018-11-18 15:47:07,030 INFO L421 ceAbstractionStarter]: At program point L3114(lines 2705 3179) the Hoare annotation is: (let ((.cse2 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741811 32)) (_ bv0 32))) (.cse5 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741101 32)) (_ bv0 32))) (.cse11 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32))) (.cse6 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741789 32)) (_ bv0 32))) (.cse14 (= (bvadd ~SKIP1~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse9 (= (_ bv1 32) ~NP~0)) (.cse15 (= ~NP~0 ~s~0)) (.cse16 (= (bvadd ~IPC~0 (_ bv4294967289 32)) (_ bv0 32))) (.cse17 (= (bvadd ~SKIP2~0 (_ bv4294967292 32)) (_ bv0 32))) (.cse0 (= (_ bv0 32) ~pended~0)) (.cse18 (= (bvadd ~MPR3~0 (_ bv4294967290 32)) (_ bv0 32))) (.cse10 (= (_ bv2 32) ~DC~0)) (.cse8 (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (.cse1 (= |old(~s~0)| ~s~0)) (.cse19 (= (_ bv0 32) ~compRegistered~0))) (let ((.cse7 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32))) (.cse12 (and .cse14 .cse9 .cse15 .cse16 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) .cse17 .cse0 .cse18 .cse10 .cse8 .cse1 .cse19)) (.cse13 (and (or (and .cse14 (or (and .cse9 .cse15 .cse16 .cse17 .cse0 .cse18 .cse10 .cse2 .cse19) (and .cse9 .cse15 .cse16 .cse17 .cse0 .cse18 .cse10 .cse5 .cse19) (and .cse9 .cse15 .cse16 .cse17 .cse0 .cse18 .cse10 .cse11 .cse19))) (and .cse14 .cse9 .cse15 .cse16 .cse17 .cse0 .cse18 .cse10 .cse6 .cse19)) .cse8 .cse1))) (let ((.cse4 (or (and .cse7 .cse0 .cse1) .cse12 .cse13)) (.cse3 (or .cse12 .cse13))) (or (and .cse0 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse1) (and .cse2 .cse3) (and .cse4 .cse5) (and .cse6 .cse4) (and (= (_ bv1 32) ~pended~0) .cse1) (or (and (= ~PagingReferenceCount~0 (_ bv0 32)) .cse4) (and .cse7 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1))) (or (not .cse8) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not .cse9) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not .cse10)) (and .cse11 .cse3))))) [2018-11-18 15:47:07,039 INFO L425 ceAbstractionStarter]: For program point L3081(lines 3081 3088) no Hoare annotation was computed. [2018-11-18 15:47:07,039 INFO L425 ceAbstractionStarter]: For program point L3015(lines 3015 3047) no Hoare annotation was computed. [2018-11-18 15:47:07,039 INFO L425 ceAbstractionStarter]: For program point L2784(lines 2784 3119) no Hoare annotation was computed. [2018-11-18 15:47:07,039 INFO L425 ceAbstractionStarter]: For program point L2817-1(lines 2817 2818) no Hoare annotation was computed. [2018-11-18 15:47:07,040 INFO L421 ceAbstractionStarter]: At program point L2817(lines 2817 2818) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,040 INFO L425 ceAbstractionStarter]: For program point L2751-1(line 2751) no Hoare annotation was computed. [2018-11-18 15:47:07,040 INFO L421 ceAbstractionStarter]: At program point L2751(line 2751) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= ~SKIP1~0 ~s~0) (= (_ bv0 32) ~pended~0))) [2018-11-18 15:47:07,049 INFO L421 ceAbstractionStarter]: At program point L3098(lines 2793 3116) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,049 INFO L425 ceAbstractionStarter]: For program point L2999-1(line 2999) no Hoare annotation was computed. [2018-11-18 15:47:07,049 INFO L421 ceAbstractionStarter]: At program point L2999(line 2999) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,049 INFO L425 ceAbstractionStarter]: For program point L3148(lines 3148 3156) no Hoare annotation was computed. [2018-11-18 15:47:07,049 INFO L421 ceAbstractionStarter]: At program point L2785(lines 2781 3120) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,049 INFO L425 ceAbstractionStarter]: For program point L3132(lines 3132 3171) no Hoare annotation was computed. [2018-11-18 15:47:07,050 INFO L421 ceAbstractionStarter]: At program point L3066(lines 3066 3067) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,050 INFO L421 ceAbstractionStarter]: At program point L3132-1(lines 3132 3171) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) ~pended~0)) (.cse2 (= |old(~s~0)| ~s~0))) (let ((.cse0 (and .cse1 .cse2))) (let ((.cse3 (or (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and .cse0 (= ~PagingReferenceCount~0 (_ bv0 32)))))) (or (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741789 32)) (_ bv0 32))) (and .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741811 32)) (_ bv0 32)) .cse2) (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741101 32)) (_ bv0 32))) (and .cse3 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32))) (and (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse3) (and (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse0) (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse1 .cse2 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32))) (and (= (_ bv1 32) ~pended~0) .cse2))))) [2018-11-18 15:47:07,058 INFO L421 ceAbstractionStarter]: At program point L3066-1(lines 3066 3067) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2967(lines 2967 2972) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2868(lines 2868 2875) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2868-1(lines 2868 2875) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2769(lines 2769 3124) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point $Ultimate##38(lines 2795 3115) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point $Ultimate##37(lines 2795 3115) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2984(lines 2984 2989) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2885(lines 2885 2900) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L3133(lines 3133 3161) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L2787(lines 2787 3118) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L3068(lines 3068 3069) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L3151(lines 3151 3155) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 2682 3180) no Hoare annotation was computed. [2018-11-18 15:47:07,058 INFO L425 ceAbstractionStarter]: For program point L3052(lines 3052 3061) no Hoare annotation was computed. [2018-11-18 15:47:07,079 INFO L425 ceAbstractionStarter]: For program point L3151-2(lines 3132 3169) no Hoare annotation was computed. [2018-11-18 15:47:07,079 INFO L421 ceAbstractionStarter]: At program point L2788(lines 2787 3118) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,079 INFO L425 ceAbstractionStarter]: For program point L3036(lines 3036 3044) no Hoare annotation was computed. [2018-11-18 15:47:07,079 INFO L425 ceAbstractionStarter]: For program point L3003-1(lines 3003 3005) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L421 ceAbstractionStarter]: At program point L3003(lines 3003 3005) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,080 INFO L421 ceAbstractionStarter]: At program point L2904(lines 2769 3124) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,080 INFO L425 ceAbstractionStarter]: For program point L2772(lines 2772 3123) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L425 ceAbstractionStarter]: For program point L2921(lines 2921 2928) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L425 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L425 ceAbstractionStarter]: For program point L3103-1(lines 3099 3105) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L421 ceAbstractionStarter]: At program point L3103(line 3103) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,080 INFO L425 ceAbstractionStarter]: For program point L2839(lines 2839 2845) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L425 ceAbstractionStarter]: For program point L2740(lines 2740 2756) no Hoare annotation was computed. [2018-11-18 15:47:07,080 INFO L421 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 2682 3180) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,098 INFO L425 ceAbstractionStarter]: For program point L2889(lines 2889 2899) no Hoare annotation was computed. [2018-11-18 15:47:07,098 INFO L425 ceAbstractionStarter]: For program point L2790(lines 2790 3117) no Hoare annotation was computed. [2018-11-18 15:47:07,098 INFO L425 ceAbstractionStarter]: For program point L2757(lines 2757 3128) no Hoare annotation was computed. [2018-11-18 15:47:07,098 INFO L425 ceAbstractionStarter]: For program point L2807(lines 2807 2813) no Hoare annotation was computed. [2018-11-18 15:47:07,098 INFO L425 ceAbstractionStarter]: For program point L2741(lines 2741 2747) no Hoare annotation was computed. [2018-11-18 15:47:07,098 INFO L425 ceAbstractionStarter]: For program point L3022(lines 3022 3046) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L2857(lines 2857 2864) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L421 ceAbstractionStarter]: At program point L2758(lines 2757 3128) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L2973(lines 2973 2978) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L2775(lines 2775 3122) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L3139(lines 3139 3159) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L3007(lines 3007 3014) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L2941-1(lines 2941 2959) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L421 ceAbstractionStarter]: At program point L2941-3(lines 2941 2959) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= |old(~s~0)| ~s~0))) (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and .cse0 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse1) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32))))) [2018-11-18 15:47:07,099 INFO L425 ceAbstractionStarter]: For program point L2991-1(line 2991) no Hoare annotation was computed. [2018-11-18 15:47:07,099 INFO L421 ceAbstractionStarter]: At program point L2991(line 2991) the Hoare annotation is: (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) (and (= (_ bv0 32) ~pended~0) (not (= FloppyDeviceControl_~valueName~0.base (_ bv0 32))) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0))) [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L2826(lines 2826 2836) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L2760(lines 2760 3127) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6497(lines 6497 6505) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6456-1(lines 6455 6463) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6481(lines 6481 6514) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6494(lines 6494 6506) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L428 ceAbstractionStarter]: At program point L6453-3(lines 6453 6465) the Hoare annotation is: true [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6453-1(lines 6453 6465) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L425 ceAbstractionStarter]: For program point L6478(lines 6478 6515) no Hoare annotation was computed. [2018-11-18 15:47:07,111 INFO L428 ceAbstractionStarter]: At program point L6466(lines 6452 6467) the Hoare annotation is: true [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6491(lines 6491 6507) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 6446 6520) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6454(line 6454) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6487(lines 6487 6511) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6487-2(lines 6487 6511) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6475(lines 6475 6516) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6500(lines 6500 6504) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 6446 6520) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6455(lines 6455 6463) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6488(lines 6488 6508) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6484(lines 6484 6513) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L428 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 6446 6520) the Hoare annotation is: true [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6472(lines 6472 6517) no Hoare annotation was computed. [2018-11-18 15:47:07,112 INFO L425 ceAbstractionStarter]: For program point L6468(lines 6468 6518) no Hoare annotation was computed. [2018-11-18 15:47:07,116 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:47:07,116 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~s~0)| ~s~0) [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 10 15) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L428 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 10 15) the Hoare annotation is: true [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 10 15) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L421 ceAbstractionStarter]: At program point L6784-2(lines 6784 6790) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point L6784(lines 6784 6790) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 6774 6845) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L421 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 6774 6845) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point L6810(lines 6810 6816) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L421 ceAbstractionStarter]: At program point L6806(line 6806) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point L6810-2(lines 6810 6816) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 6774 6845) no Hoare annotation was computed. [2018-11-18 15:47:07,117 INFO L425 ceAbstractionStarter]: For program point L6806-1(line 6806) no Hoare annotation was computed. [2018-11-18 15:47:07,118 INFO L425 ceAbstractionStarter]: For program point L6837(lines 6837 6838) no Hoare annotation was computed. [2018-11-18 15:47:07,118 INFO L421 ceAbstractionStarter]: At program point L6798(line 6798) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,121 INFO L425 ceAbstractionStarter]: For program point L6800(lines 6800 6823) no Hoare annotation was computed. [2018-11-18 15:47:07,121 INFO L421 ceAbstractionStarter]: At program point L6833-1(lines 6829 6835) the Hoare annotation is: (or (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ~pended~0) (= |old(~s~0)| ~s~0)) (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,121 INFO L421 ceAbstractionStarter]: At program point L6833(line 6833) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,121 INFO L425 ceAbstractionStarter]: For program point L6794(line 6794) no Hoare annotation was computed. [2018-11-18 15:47:07,121 INFO L425 ceAbstractionStarter]: For program point L6796-1(lines 6796 6842) no Hoare annotation was computed. [2018-11-18 15:47:07,122 INFO L425 ceAbstractionStarter]: For program point L6796(lines 6796 6842) no Hoare annotation was computed. [2018-11-18 15:47:07,122 INFO L425 ceAbstractionStarter]: For program point L6798-1(line 6798) no Hoare annotation was computed. [2018-11-18 15:47:07,122 INFO L425 ceAbstractionStarter]: For program point L6829(lines 6829 6835) no Hoare annotation was computed. [2018-11-18 15:47:07,122 INFO L421 ceAbstractionStarter]: At program point L6825(lines 6796 6842) the Hoare annotation is: (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= (_ bv1 32) ~NP~0)) (not (= (_ bv4 32) ~SKIP2~0)) (not (= ~compRegistered~0 (_ bv0 32))) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) |old(~pended~0)|)) (not (= (_ bv2 32) ~DC~0))) [2018-11-18 15:47:07,122 INFO L425 ceAbstractionStarter]: For program point L6591(lines 6591 6597) no Hoare annotation was computed. [2018-11-18 15:47:07,122 INFO L425 ceAbstractionStarter]: For program point L6588-1(lines 6588 6589) no Hoare annotation was computed. [2018-11-18 15:47:07,122 INFO L421 ceAbstractionStarter]: At program point L6588(lines 6588 6589) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (or (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)))) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (= |old(~s~0)| ~s~0)) [2018-11-18 15:47:07,128 INFO L421 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 6576 6613) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (or (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)))) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base) (= |old(~s~0)| ~s~0)) [2018-11-18 15:47:07,128 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 6576 6613) no Hoare annotation was computed. [2018-11-18 15:47:07,128 INFO L425 ceAbstractionStarter]: For program point L6603(lines 6603 6610) no Hoare annotation was computed. [2018-11-18 15:47:07,128 INFO L425 ceAbstractionStarter]: For program point L6605-1(line 6605) no Hoare annotation was computed. [2018-11-18 15:47:07,128 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 6576 6613) no Hoare annotation was computed. [2018-11-18 15:47:07,128 INFO L421 ceAbstractionStarter]: At program point L6605(line 6605) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (and (= (_ bv259 32) FlFdcDeviceIo_~ntStatus~16) (= ~MPR3~0 ~s~0) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (or (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)))) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= (_ bv2 32) ~DC~0))) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:07,128 INFO L425 ceAbstractionStarter]: For program point L6601-1(line 6601) no Hoare annotation was computed. [2018-11-18 15:47:07,129 INFO L421 ceAbstractionStarter]: At program point L6601(line 6601) the Hoare annotation is: (or (not (= ~PagingMutex~0.offset (_ bv0 32))) (or (or (not (= (bvadd ~MPR1~0 (_ bv4294967291 32)) (_ bv0 32))) (or (not (= (_ bv6 32) ~MPR3~0)) (not (= (_ bv3 32) ~SKIP1~0)) (not (= (_ bv7 32) ~IPC~0)) (not (= ~NP~0 |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0)))) (not (= (_ bv1 32) ~NP~0)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv4 32) ~SKIP2~0)) (not (= (_ bv2 32) ~DC~0))) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~PagingMutex~0.base)) [2018-11-18 15:47:07,129 INFO L425 ceAbstractionStarter]: For program point L6603-2(lines 6603 6610) no Hoare annotation was computed. [2018-11-18 15:47:07,129 INFO L425 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 7237 7249) no Hoare annotation was computed. [2018-11-18 15:47:07,129 INFO L425 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 7237 7249) no Hoare annotation was computed. [2018-11-18 15:47:07,129 INFO L428 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 7237 7249) the Hoare annotation is: true [2018-11-18 15:47:07,137 INFO L425 ceAbstractionStarter]: For program point L2494(lines 2494 2538) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 2483 2556) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L428 ceAbstractionStarter]: At program point L2507(lines 2506 2534) the Hoare annotation is: true [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point L2503(lines 2503 2535) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 2511 2532) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L428 ceAbstractionStarter]: At program point L2501(lines 2500 2536) the Hoare annotation is: true [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point $Ultimate##13(lines 2511 2532) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point L2497(lines 2497 2537) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L428 ceAbstractionStarter]: At program point L2495(lines 2494 2538) the Hoare annotation is: true [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point L2489(lines 2489 2493) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L428 ceAbstractionStarter]: At program point L2510(lines 2509 2533) the Hoare annotation is: true [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point L2506(lines 2506 2534) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L428 ceAbstractionStarter]: At program point L2504(lines 2503 2535) the Hoare annotation is: true [2018-11-18 15:47:07,138 INFO L428 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 2483 2556) the Hoare annotation is: true [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point L2500(lines 2500 2536) no Hoare annotation was computed. [2018-11-18 15:47:07,138 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 2483 2556) no Hoare annotation was computed. [2018-11-18 15:47:07,139 INFO L428 ceAbstractionStarter]: At program point L2498(lines 2497 2537) the Hoare annotation is: true [2018-11-18 15:47:07,139 INFO L428 ceAbstractionStarter]: At program point L2531(lines 2511 2532) the Hoare annotation is: true [2018-11-18 15:47:07,139 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:47:07,139 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~SKIP1~0 ~s~0) (= ~myStatus~0 (_ bv0 32)) (= ~NP~0 ~s~0) (= ~DC~0 ~s~0) (= (_ bv0 32) ~pended~0) (= ~MPR3~0 ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= ~UNLOADED~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= (_ bv0 32) ~compRegistered~0) (= ~IPC~0 ~s~0)) [2018-11-18 15:47:07,139 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:47:07,139 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:47:07,139 INFO L425 ceAbstractionStarter]: For program point L7583(lines 7555 7588) no Hoare annotation was computed. [2018-11-18 15:47:07,139 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 7555 7588) no Hoare annotation was computed. [2018-11-18 15:47:07,139 INFO L428 ceAbstractionStarter]: At program point L7576(lines 7575 7585) the Hoare annotation is: true [2018-11-18 15:47:07,139 INFO L428 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 7555 7588) the Hoare annotation is: true [2018-11-18 15:47:07,139 INFO L425 ceAbstractionStarter]: For program point L7572(lines 7572 7586) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L428 ceAbstractionStarter]: At program point L7573(lines 7572 7586) the Hoare annotation is: true [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 7577 7584) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 7577 7584) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L428 ceAbstractionStarter]: At program point L7486(lines 7485 7499) the Hoare annotation is: true [2018-11-18 15:47:07,148 INFO L428 ceAbstractionStarter]: At program point L7489(lines 7488 7498) the Hoare annotation is: true [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point L7485(lines 7485 7499) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L428 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 7481 7501) the Hoare annotation is: true [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 7481 7501) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point L7496(lines 7481 7501) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 7490 7497) no Hoare annotation was computed. [2018-11-18 15:47:07,148 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 7490 7497) no Hoare annotation was computed. [2018-11-18 15:47:07,149 INFO L425 ceAbstractionStarter]: For program point L8287(lines 8272 8292) no Hoare annotation was computed. [2018-11-18 15:47:07,149 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 8272 8292) the Hoare annotation is: true [2018-11-18 15:47:07,149 INFO L428 ceAbstractionStarter]: At program point L8280(lines 8279 8289) the Hoare annotation is: true [2018-11-18 15:47:07,149 INFO L425 ceAbstractionStarter]: For program point L8276(lines 8276 8290) no Hoare annotation was computed. [2018-11-18 15:47:07,149 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 8272 8292) no Hoare annotation was computed. [2018-11-18 15:47:07,149 INFO L428 ceAbstractionStarter]: At program point L8277(lines 8276 8290) the Hoare annotation is: true [2018-11-18 15:47:07,149 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 8281 8288) no Hoare annotation was computed. [2018-11-18 15:47:07,149 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 8281 8288) no Hoare annotation was computed. [2018-11-18 15:47:07,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:47:07 BoogieIcfgContainer [2018-11-18 15:47:07,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:47:07,241 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:47:07,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:47:07,242 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:47:07,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:41:00" (3/4) ... [2018-11-18 15:47:07,245 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:47:07,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-11-18 15:47:07,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-18 15:47:07,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 15:47:07,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-11-18 15:47:07,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-18 15:47:07,254 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-11-18 15:47:07,255 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-18 15:47:07,256 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-18 15:47:07,257 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-18 15:47:07,258 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-18 15:47:07,290 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1006 nodes and edges [2018-11-18 15:47:07,293 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 505 nodes and edges [2018-11-18 15:47:07,295 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 240 nodes and edges [2018-11-18 15:47:07,298 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2018-11-18 15:47:07,300 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2018-11-18 15:47:07,302 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2018-11-18 15:47:07,304 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-18 15:47:07,306 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 15:47:07,308 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 15:47:07,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(\old(s) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || !(\old(SKIP2) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || (~bvadd64(status, 1073741275bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || ((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == lowerDriverReturn) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || (~bvadd64(status, 1073741670bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((0bv32 == PagingMutex && !~bvsge32(status, 0bv32)) && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !(0bv32 == PagingMutex))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || (~bvadd64(status, 1073741101bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || UNLOADED == s) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741536bv32) == 0bv32) [2018-11-18 15:47:07,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(\old(s) == \old(MPR1))) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || (~bvadd64(status, 1073741275bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((0bv32 == PagingMutex && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !~bvsge32(status, 0bv32)) && !(0bv32 == PagingMutex))) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741536bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || (~bvadd64(status, 1073741670bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || ((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && SKIP2 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) || UNLOADED == s) || ((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended))) || (~bvadd64(status, 1073741101bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) [2018-11-18 15:47:07,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(\old(s) == \old(MPR1)) || (1bv32 == pended && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741275bv32) == 0bv32)) || !(\old(SKIP2) == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((1bv32 == NP && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || ((((((1bv32 == NP && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && status == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741536bv32) == 0bv32)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && 0bv32 == PagingMutex) && !~bvsge32(status, 0bv32)) && !(0bv32 == PagingMutex))) || ((((((1bv32 == NP && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && SKIP2 == s)) || (~bvadd64(status, 1073741101bv32) == 0bv32 && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || (~bvadd64(status, 1073741670bv32) == 0bv32 && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || !(\old(myStatus) == 0bv32)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) [2018-11-18 15:47:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(PagingMutex == 0bv32) || NP == s) || 0bv32 == PagingMutex) || (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s) || !(myStatus == 0bv32)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || NP == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s)) && (((!(PagingMutex == 0bv32) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s)) || ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) [2018-11-18 15:47:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(PagingMutex == 0bv32) || NP == s) || 0bv32 == PagingMutex) || (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s) || !(myStatus == 0bv32)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || NP == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s)) && (((!(PagingMutex == 0bv32) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s)) || ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) [2018-11-18 15:47:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,338 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(PagingMutex == 0bv32) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) && ((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((DC == s && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == ntStatus)) || (((lowerDriverReturn == ntStatus && 0bv32 == pended) && SKIP2 == s) && 0bv32 == compRegistered)) || ((1bv32 == pended && SKIP2 == s) && 0bv32 == compRegistered)) || ((DC == s && 0bv32 == pended) && 3221225473bv32 == ntStatus)) || (((!~bvsge32(ntStatus, 0bv32) && 0bv32 == pended) && DC == s) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || (DC == s && 1bv32 == pended)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || ((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC)) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,339 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC)) && ((((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || (((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 259bv32 == returnVal2)) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && ((((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && 3221225473bv32 == returnVal2) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && 0bv32 == returnVal2) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered))))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && ((((!(PagingMutex == 0bv32) || (((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 259bv32 == returnVal2)) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && ((((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && 3221225473bv32 == returnVal2) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && 0bv32 == returnVal2) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered)))) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) [2018-11-18 15:47:07,358 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered)) && ((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && (((!(PagingMutex == 0bv32) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered)) [2018-11-18 15:47:07,373 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(PagingMutex == 0bv32) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) && ((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) || !(myStatus == 0bv32)) [2018-11-18 15:47:07,391 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(myStatus) == 0bv32) || (((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || myStatus == 0bv32) && (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || ((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC))) && ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) && (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || ((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) [2018-11-18 15:47:07,392 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || (((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 0bv32 == compRegistered)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) [2018-11-18 15:47:07,424 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0bv32 == pended && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && headOfList == 0bv32) && 0bv32 == headOfList) && \old(s) == s) || (((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) && ((((((((((((!(1bv32 == NP) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || (1bv32 == pended && \old(s) == s)) || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || ((((0bv32 == pended && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && headOfList == 0bv32) && 0bv32 == headOfList) && \old(s) == s)) || !(7bv32 == IPC)) || !(compRegistered == 0bv32)) || !(0bv32 == \old(pended))) || !(2bv32 == DC))) && (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) || ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) || !(2bv32 == DC))) && (((!(\old(myStatus) == 0bv32) || (((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || myStatus == 0bv32) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) [2018-11-18 15:47:07,424 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && PagingReferenceCount == 0bv32) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) [2018-11-18 15:47:07,453 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(\old(s) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) || !(\old(NP) == \old(s))) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || !(\old(SKIP2) == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || (~bvadd64(status, 1073741670bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == lowerDriverReturn) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || (~bvadd64(status, 1073741275bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || (~bvadd64(status, 1073741101bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(\old(s) == \old(MPR3))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || !(0bv32 == \old(pended))) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == PagingMutex) && !~bvsge32(status, 0bv32)) && !(0bv32 == PagingMutex))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741536bv32) == 0bv32) [2018-11-18 15:47:07,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || ((((((((((((1bv32 == NP && 0bv32 == pended) && 0bv32 == PagingMutex) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !(0bv32 == PagingMutex)) && 0bv32 == compRegistered) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && PagingReferenceCount == 0bv32)) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) [2018-11-18 15:47:07,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered) [2018-11-18 15:47:07,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || NP == s) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,501 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((0bv32 == pended && ntStatus == 0bv32) && \old(s) == s) || (~bvadd64(ntStatus, 1073741811bv32) == 0bv32 && ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)))) || (((((~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered)) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32)) || (~bvadd64(ntStatus, 1073741789bv32) == 0bv32 && ((((~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered)) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)))) || (1bv32 == pended && \old(s) == s)) || (PagingReferenceCount == 0bv32 && ((((~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered)) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s))) || (~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && (~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (~bvadd64(ntStatus, 2147483643bv32) == 0bv32 && ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s))) [2018-11-18 15:47:07,507 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || \old(s) == s) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || \old(s) == s) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((!(PagingMutex == 0bv32) || 0bv32 == PagingMutex) || (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && (((!(PagingMutex == 0bv32) || ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s)) [2018-11-18 15:47:07,508 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || ((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC) [2018-11-18 15:47:07,508 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((NP == s && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,510 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) [2018-11-18 15:47:07,510 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(PagingMutex == 0bv32) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !~bvsge32(ntStatus, 0bv32))) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ntStatus == 0bv32)) || 0bv32 == PagingMutex) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == InterfaceType) [2018-11-18 15:47:07,510 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(PagingMutex == 0bv32) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !~bvsge32(ntStatus, 0bv32))) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ntStatus == 0bv32)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) [2018-11-18 15:47:07,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) [2018-11-18 15:47:07,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((0bv32 == pended && 0bv32 == compRegistered) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == ntStatus) && \old(s) == s)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || \old(s) == s) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,512 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((0bv32 == pended && 0bv32 == compRegistered) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == ntStatus) && \old(s) == s)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,514 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || \old(s) == s) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC) [2018-11-18 15:47:07,514 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((((0bv32 == pended && 0bv32 == compRegistered) && myStatus == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == ntStatus) && \old(s) == s)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,515 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) [2018-11-18 15:47:07,515 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && \old(s) == s) && 0bv32 == compRegistered)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,515 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) [2018-11-18 15:47:07,515 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,515 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && \old(s) == s) && 0bv32 == compRegistered)) || 0bv32 == PagingMutex [2018-11-18 15:47:07,517 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) [2018-11-18 15:47:07,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) [2018-11-18 15:47:07,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) [2018-11-18 15:47:07,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) [2018-11-18 15:47:07,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) [2018-11-18 15:47:07,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) [2018-11-18 15:47:07,519 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && ntStatus == 0bv32) && \old(s) == s)) || ((0bv32 == pended && \old(s) == s) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) [2018-11-18 15:47:07,650 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c4bbe533-4581-4608-80c1-77056f935799/bin-2019/utaipan/witness.graphml [2018-11-18 15:47:07,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:47:07,650 INFO L168 Benchmark]: Toolchain (without parser) took 397208.36 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 916.5 MB). Free memory was 938.9 MB in the beginning and 720.4 MB in the end (delta: 218.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,651 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:47:07,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1665.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.9 MB in the beginning and 820.1 MB in the end (delta: 118.8 MB). Peak memory consumption was 281.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.40 ms. Allocated memory is still 1.2 GB. Free memory was 820.1 MB in the beginning and 814.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,652 INFO L168 Benchmark]: Boogie Preprocessor took 180.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 814.6 MB in the beginning and 1.2 GB in the end (delta: -365.6 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,652 INFO L168 Benchmark]: RCFGBuilder took 28017.93 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 184.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -139.1 MB). Peak memory consumption was 467.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,652 INFO L168 Benchmark]: TraceAbstraction took 366857.40 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 488.1 MB). Free memory was 1.3 GB in the beginning and 784.6 MB in the end (delta: 534.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,652 INFO L168 Benchmark]: Witness Printer took 408.37 ms. Allocated memory is still 1.9 GB. Free memory was 784.6 MB in the beginning and 720.4 MB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:47:07,654 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1665.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.9 MB in the beginning and 820.1 MB in the end (delta: 118.8 MB). Peak memory consumption was 281.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.40 ms. Allocated memory is still 1.2 GB. Free memory was 820.1 MB in the beginning and 814.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 180.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 814.6 MB in the beginning and 1.2 GB in the end (delta: -365.6 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 28017.93 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 184.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -139.1 MB). Peak memory consumption was 467.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 366857.40 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 488.1 MB). Free memory was 1.3 GB in the beginning and 784.6 MB in the end (delta: 534.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 408.37 ms. Allocated memory is still 1.9 GB. Free memory was 784.6 MB in the beginning and 720.4 MB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2099]: 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: 2497]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3240]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered)) || 0bv32 == PagingMutex - InvariantResult [Line: 7156]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(\old(s) == \old(MPR1))) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || (~bvadd64(status, 1073741275bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((0bv32 == PagingMutex && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !~bvsge32(status, 0bv32)) && !(0bv32 == PagingMutex))) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741536bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || (~bvadd64(status, 1073741670bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || ((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && SKIP2 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) || UNLOADED == s) || ((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended))) || (~bvadd64(status, 1073741101bv32) == 0bv32 && ((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) - InvariantResult [Line: 2511]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6452]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) - InvariantResult [Line: 7631]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8202]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2787]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) - InvariantResult [Line: 2790]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) - InvariantResult [Line: 2500]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7060]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(\old(s) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) || !(\old(NP) == \old(s))) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || !(\old(SKIP2) == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || (~bvadd64(status, 1073741670bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == lowerDriverReturn) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || (~bvadd64(status, 1073741275bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || (~bvadd64(status, 1073741101bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(\old(s) == \old(MPR3))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || !(0bv32 == \old(pended))) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == PagingMutex) && !~bvsge32(status, 0bv32)) && !(0bv32 == PagingMutex))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741536bv32) == 0bv32) - InvariantResult [Line: 7096]: Loop Invariant Derived loop invariant: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered) - InvariantResult [Line: 6902]: Loop Invariant Derived loop invariant: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) - InvariantResult [Line: 3222]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((0bv32 == pended && 0bv32 == compRegistered) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == ntStatus) && \old(s) == s)) || 0bv32 == PagingMutex - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) - InvariantResult [Line: 3705]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || \old(s) == s) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 3587]: Loop Invariant Derived loop invariant: (((!(PagingMutex == 0bv32) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !~bvsge32(ntStatus, 0bv32))) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ntStatus == 0bv32)) || 0bv32 == PagingMutex - InvariantResult [Line: 7099]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8034]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 2705]: Loop Invariant Derived loop invariant: ((((((((0bv32 == pended && ntStatus == 0bv32) && \old(s) == s) || (~bvadd64(ntStatus, 1073741811bv32) == 0bv32 && ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)))) || (((((~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered)) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32)) || (~bvadd64(ntStatus, 1073741789bv32) == 0bv32 && ((((~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered)) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)))) || (1bv32 == pended && \old(s) == s)) || (PagingReferenceCount == 0bv32 && ((((~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered)) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s))) || (~bvadd64(ntStatus, 1073741823bv32) == 0bv32 && (~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (~bvadd64(ntStatus, 2147483643bv32) == 0bv32 && ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(ntStatus, 1073741275bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) || ((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && ((((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741811bv32) == 0bv32) && 0bv32 == compRegistered) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741101bv32) == 0bv32) && 0bv32 == compRegistered)) || ((((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) && 0bv32 == compRegistered))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(ntStatus, 1073741789bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s))) - InvariantResult [Line: 2509]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8018]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 8276]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2494]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3237]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && \old(s) == s) && 0bv32 == compRegistered)) || 0bv32 == PagingMutex - InvariantResult [Line: 2781]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) - InvariantResult [Line: 6902]: Loop Invariant Derived loop invariant: ((((!(\old(myStatus) == 0bv32) || (((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || myStatus == 0bv32) && (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || ((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC))) && ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) && (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || ((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) - InvariantResult [Line: 7148]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(\old(s) == \old(MPR1))) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || !(\old(SKIP2) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || (~bvadd64(status, 1073741275bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || ((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == lowerDriverReturn) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((((((1bv32 == NP && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || (~bvadd64(status, 1073741670bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || (((0bv32 == PagingMutex && !~bvsge32(status, 0bv32)) && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !(0bv32 == PagingMutex))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || (~bvadd64(status, 1073741101bv32) == 0bv32 && (((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || UNLOADED == s) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && DC == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(status, 1073741536bv32) == 0bv32) - InvariantResult [Line: 6890]: Loop Invariant Derived loop invariant: ((((((((0bv32 == pended && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && headOfList == 0bv32) && 0bv32 == headOfList) && \old(s) == s) || (((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) && ((((((((((((!(1bv32 == NP) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || (1bv32 == pended && \old(s) == s)) || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || ((((0bv32 == pended && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && headOfList == 0bv32) && 0bv32 == headOfList) && \old(s) == s)) || !(7bv32 == IPC)) || !(compRegistered == 0bv32)) || !(0bv32 == \old(pended))) || !(2bv32 == DC))) && (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) || ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) || !(2bv32 == DC))) && (((!(\old(myStatus) == 0bv32) || (((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) || myStatus == 0bv32) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && \old(s) == s)) - InvariantResult [Line: 7696]: Loop Invariant Derived loop invariant: (((((!(PagingMutex == 0bv32) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) && ((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) - InvariantResult [Line: 7084]: Loop Invariant Derived loop invariant: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || ((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC)) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3231]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((((0bv32 == pended && 0bv32 == compRegistered) && myStatus == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == ntStatus) && \old(s) == s)) || 0bv32 == PagingMutex - InvariantResult [Line: 2763]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) - InvariantResult [Line: 7600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: ((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || (((!(6bv32 == MPR3) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) - InvariantResult [Line: 7680]: Loop Invariant Derived loop invariant: ((((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC)) && ((((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || (((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 259bv32 == returnVal2)) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && ((((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && 3221225473bv32 == returnVal2) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && 0bv32 == returnVal2) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered))))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && ((((!(PagingMutex == 0bv32) || (((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 259bv32 == returnVal2)) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && ((((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && 3221225473bv32 == returnVal2) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && 0bv32 == returnVal2) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered)))) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) - InvariantResult [Line: 7488]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8279]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7396]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7699]: Loop Invariant Derived loop invariant: (((((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered)) && ((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && (((!(PagingMutex == 0bv32) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) || (((((((((((((1bv32 == NP && 0bv32 == pended) && \old(s) == NP) && MPR1 == s) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered)) - InvariantResult [Line: 7984]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7603]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2506]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3708]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || \old(s) == s) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 3862]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7883]: Loop Invariant Derived loop invariant: ((((((!(PagingMutex == 0bv32) || NP == s) || 0bv32 == PagingMutex) || (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s) || !(myStatus == 0bv32)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || NP == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s)) && (((!(PagingMutex == 0bv32) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s)) || ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) - InvariantResult [Line: 3861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8105]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7399]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6453]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7087]: Loop Invariant Derived loop invariant: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || (((((((1bv32 == NP && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 0bv32 == compRegistered)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7170]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(\old(s) == \old(MPR1)) || (1bv32 == pended && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 2147483643bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741275bv32) == 0bv32)) || !(\old(SKIP2) == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 1bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && SKIP2 == s) && 0bv32 == compRegistered)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((1bv32 == NP && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && status == 0bv32)) || ((((((1bv32 == NP && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(status, 2147483631bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741811bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && status == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741823bv32) == 0bv32)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && ~bvadd64(status, 1073741536bv32) == 0bv32)) || (~bvadd64(status, 1073741789bv32) == 0bv32 && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || (((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && 0bv32 == PagingMutex) && !~bvsge32(status, 0bv32)) && !(0bv32 == PagingMutex))) || ((((((1bv32 == NP && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 3221225558bv32 == status)) || (((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) && SKIP2 == s)) || (~bvadd64(status, 1073741101bv32) == 0bv32 && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || (~bvadd64(status, 1073741670bv32) == 0bv32 && ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && DC == s) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) || ((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && status == lowerDriverReturn) && 2bv32 == DC) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)))) || !(\old(myStatus) == 0bv32)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8257]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7702]: Loop Invariant Derived loop invariant: (((((!(PagingMutex == 0bv32) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) || ((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) && ((((((((((\old(s) == s || !(~bvadd64(MPR1, 4294967291bv32) == 0bv32)) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC))) && (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s)) || !(0bv32 == pended)) || !(2bv32 == DC)) || ((MPR1 == s && ~bvadd64(compRetStatus1, 1073741802bv32) == 0bv32) && ~bvadd64(setEventCalled, 4294967295bv32) == 0bv32)) || !(myStatus == 0bv32)) - InvariantResult [Line: 8037]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 6796]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || ((~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC) - InvariantResult [Line: 3225]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((0bv32 == pended && 0bv32 == compRegistered) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == ntStatus) && \old(s) == s)) || 0bv32 == PagingMutex - InvariantResult [Line: 8254]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3589]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((NP == s && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered)) || 0bv32 == PagingMutex - InvariantResult [Line: 2760]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) - InvariantResult [Line: 3696]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || NP == s) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 7858]: Loop Invariant Derived loop invariant: (((((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || \old(s) == s) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || \old(s) == s) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((!(PagingMutex == 0bv32) || 0bv32 == PagingMutex) || (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(myStatus == 0bv32)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && (((!(PagingMutex == 0bv32) || ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s)) - InvariantResult [Line: 7987]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7090]: Loop Invariant Derived loop invariant: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || ((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && 0bv32 == pended) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && PagingReferenceCount == 0bv32) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == compRegistered)) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2769]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s) - InvariantResult [Line: 2503]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3245]: Loop Invariant Derived loop invariant: (((((((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (((DC == s && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == ntStatus)) || (((lowerDriverReturn == ntStatus && 0bv32 == pended) && SKIP2 == s) && 0bv32 == compRegistered)) || ((1bv32 == pended && SKIP2 == s) && 0bv32 == compRegistered)) || ((DC == s && 0bv32 == pended) && 3221225473bv32 == ntStatus)) || (((!~bvsge32(ntStatus, 0bv32) && 0bv32 == pended) && DC == s) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || (DC == s && 1bv32 == pended)) || 0bv32 == PagingMutex - InvariantResult [Line: 3611]: Loop Invariant Derived loop invariant: ((((!(PagingMutex == 0bv32) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !~bvsge32(ntStatus, 0bv32))) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && ntStatus == 0bv32)) || 0bv32 == PagingMutex) || ((((((((((((~bvadd64(SKIP1, 4294967293bv32) == 0bv32 && 1bv32 == NP) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == NP) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && 1bv32 == compRegistered) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && 0bv32 == InterfaceType) - InvariantResult [Line: 8040]: Loop Invariant Derived loop invariant: (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || \old(s) == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(SKIP1 == \old(s))) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(0bv32 == pended)) || !(2bv32 == DC) - InvariantResult [Line: 7093]: Loop Invariant Derived loop invariant: (((((((((((!(\old(s) == \old(MPR1)) || !(\old(SKIP1) == \old(s))) || !(\old(UNLOADED) == \old(s))) || !(\old(NP) == \old(s))) || ((((((((((((1bv32 == NP && 0bv32 == pended) && 0bv32 == PagingMutex) && ~bvadd64(MPR1, 4294967291bv32) == 0bv32) && !(0bv32 == PagingMutex)) && 0bv32 == compRegistered) && ~bvadd64(SKIP1, 4294967293bv32) == 0bv32) && NP == s) && ~bvadd64(IPC, 4294967289bv32) == 0bv32) && ~bvadd64(SKIP2, 4294967292bv32) == 0bv32) && ~bvadd64(MPR3, 4294967290bv32) == 0bv32) && 2bv32 == DC) && PagingReferenceCount == 0bv32)) || !(\old(SKIP2) == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(DC) == \old(s))) || !(\old(compRegistered) == 0bv32)) || !(\old(s) == \old(IPC))) || !(\old(s) == \old(MPR3))) || !(0bv32 == \old(pended)) - InvariantResult [Line: 2793]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) - InvariantResult [Line: 2941]: Loop Invariant Derived loop invariant: (((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && ntStatus == 0bv32) && \old(s) == s)) || ((0bv32 == pended && \old(s) == s) && ~bvadd64(ntStatus, 2147483643bv32) == 0bv32) - InvariantResult [Line: 7880]: Loop Invariant Derived loop invariant: ((((((!(PagingMutex == 0bv32) || NP == s) || 0bv32 == PagingMutex) || (((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3)) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(3bv32 == SKIP1)) || ((!(6bv32 == MPR3) || !(7bv32 == IPC)) || !(4bv32 == SKIP2)) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s) || !(myStatus == 0bv32)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(\old(s) == MPR3))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || NP == s) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(1bv32 == pended)) || !(2bv32 == DC))) && ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || NP == s)) && (((!(PagingMutex == 0bv32) || (~bvadd64(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s)) || ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(1bv32 == NP)) || !(~bvadd64(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd64(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd64(compRegistered, 4294967295bv32) == 0bv32)) || !(4bv32 == SKIP2)) || !(NP == \old(s))) || !(0bv32 == pended)) || !(2bv32 == DC)) || 0bv32 == PagingMutex) - InvariantResult [Line: 2757]: Loop Invariant Derived loop invariant: ((((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(compRegistered == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || (0bv32 == pended && \old(s) == s) - InvariantResult [Line: 8108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3243]: Loop Invariant Derived loop invariant: ((!(PagingMutex == 0bv32) || (((((((((!(~bvadd64(MPR1, 4294967291bv32) == 0bv32) || !(6bv32 == MPR3)) || !(3bv32 == SKIP1)) || !(7bv32 == IPC)) || !(\old(PagingReferenceCount) == 0bv32)) || !(1bv32 == NP)) || !(4bv32 == SKIP2)) || !(\old(compRegistered) == 0bv32)) || !(NP == \old(s))) || !(0bv32 == \old(pended))) || !(2bv32 == DC)) || ((0bv32 == pended && \old(s) == s) && 0bv32 == compRegistered)) || 0bv32 == PagingMutex - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 710 locations, 1 error locations. SAFE Result, 366.7s OverallTime, 91 OverallIterations, 4 TraceHistogramMax, 282.8s AutomataDifference, 0.0s DeadEndRemovalTime, 41.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 67897 SDtfs, 18957 SDslu, 217061 SDs, 0 SdLazy, 11820 SolverSat, 1415 SolverUnsat, 102 SolverUnknown, 0 SolverNotchecked, 265.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9051 GetRequests, 8549 SyntacticMatches, 7 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8686occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.0s AutomataMinimizationTime, 91 MinimizatonAttempts, 11305 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 245 LocationsWithAnnotation, 48779 PreInvPairs, 49319 NumberOfFragments, 22502 HoareAnnotationTreeSize, 48779 FomulaSimplifications, 6595119 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 245 FomulaSimplificationsInter, 167943 FormulaSimplificationTreeSizeReductionInter, 37.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 4.3s SsaConstructionTime, 14.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 8682 NumberOfCodeBlocks, 8682 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 8961 ConstructedInterpolants, 0 QuantifiedInterpolants, 1611728 SizeOfPredicates, 180 NumberOfNonLiveVariables, 62333 ConjunctsInSsa, 549 ConjunctsInUnsatCore, 95 InterpolantComputations, 91 PerfectInterpolantSequences, 470/492 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...