./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9187bc92090d01e0892e8fd14c7d6a75e3556b66 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 20:15:34,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:15:34,832 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:15:34,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:15:34,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:15:34,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:15:34,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:15:34,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:15:34,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:15:34,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:15:34,842 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:15:34,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:15:34,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:15:34,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:15:34,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:15:34,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:15:34,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:15:34,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:15:34,846 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:15:34,847 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:15:34,848 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:15:34,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:15:34,849 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:15:34,849 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:15:34,850 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:15:34,850 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:15:34,851 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:15:34,851 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:15:34,852 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:15:34,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:15:34,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:15:34,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:15:34,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:15:34,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:15:34,853 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:15:34,854 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:15:34,854 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 20:15:34,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:15:34,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:15:34,862 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:15:34,862 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:15:34,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:15:34,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:15:34,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:15:34,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:15:34,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:15:34,864 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:15:34,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:15:34,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:15:34,866 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_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9187bc92090d01e0892e8fd14c7d6a75e3556b66 [2018-12-08 20:15:34,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:15:34,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:15:34,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:15:34,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:15:34,893 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:15:34,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 20:15:34,928 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/data/ee1184dc1/6dd56cbb2e094cad9c2b5e71d05f83e6/FLAG4874cb89e [2018-12-08 20:15:35,340 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:15:35,340 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 20:15:35,349 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/data/ee1184dc1/6dd56cbb2e094cad9c2b5e71d05f83e6/FLAG4874cb89e [2018-12-08 20:15:35,670 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/data/ee1184dc1/6dd56cbb2e094cad9c2b5e71d05f83e6 [2018-12-08 20:15:35,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:15:35,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:15:35,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:15:35,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:15:35,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:15:35,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:15:35" (1/1) ... [2018-12-08 20:15:35,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9d2c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:35, skipping insertion in model container [2018-12-08 20:15:35,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:15:35" (1/1) ... [2018-12-08 20:15:35,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:15:35,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:15:35,896 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:15:35,900 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:15:35,998 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:15:36,010 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:15:36,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36 WrapperNode [2018-12-08 20:15:36,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:15:36,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:15:36,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:15:36,011 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:15:36,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:15:36,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:15:36,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:15:36,031 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:15:36,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... [2018-12-08 20:15:36,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:15:36,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:15:36,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:15:36,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:15:36,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:15:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-12-08 20:15:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-12-08 20:15:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-08 20:15:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-08 20:15:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-12-08 20:15:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-12-08 20:15:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-12-08 20:15:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-12-08 20:15:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:15:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:15:36,109 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-12-08 20:15:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-12-08 20:15:36,110 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-08 20:15:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-08 20:15:36,110 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-12-08 20:15:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-12-08 20:15:36,110 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-08 20:15:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-08 20:15:36,110 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-08 20:15:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-08 20:15:36,110 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-12-08 20:15:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-12-08 20:15:36,110 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-12-08 20:15:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-12-08 20:15:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-12-08 20:15:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-12-08 20:15:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-12-08 20:15:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-12-08 20:15:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-08 20:15:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-08 20:15:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-08 20:15:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-08 20:15:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-08 20:15:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-08 20:15:36,111 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-12-08 20:15:36,112 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-12-08 20:15:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-12-08 20:15:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:15:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:15:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-12-08 20:15:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-12-08 20:15:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-12-08 20:15:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-12-08 20:15:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-08 20:15:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-08 20:15:36,228 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,228 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,273 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,274 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,281 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,281 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,371 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,371 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,414 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,414 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,457 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,457 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,462 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,462 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,468 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,468 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,481 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,482 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,518 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,518 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,601 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,602 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,606 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,606 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,609 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:15:36,609 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:15:36,622 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:15:36,622 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 20:15:36,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:15:36 BoogieIcfgContainer [2018-12-08 20:15:36,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:15:36,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:15:36,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:15:36,626 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:15:36,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:15:35" (1/3) ... [2018-12-08 20:15:36,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f495f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:15:36, skipping insertion in model container [2018-12-08 20:15:36,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:15:36" (2/3) ... [2018-12-08 20:15:36,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f495f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:15:36, skipping insertion in model container [2018-12-08 20:15:36,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:15:36" (3/3) ... [2018-12-08 20:15:36,628 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_simpl4_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 20:15:36,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:15:36,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:15:36,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:15:36,681 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:15:36,682 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:15:36,682 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:15:36,682 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:15:36,682 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:15:36,682 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:15:36,682 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:15:36,682 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:15:36,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:15:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2018-12-08 20:15:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 20:15:36,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:36,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:36,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:36,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash -688252531, now seen corresponding path program 1 times [2018-12-08 20:15:36,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:36,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:36,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-12-08 20:15:36,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:36,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:36,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:36,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:36,861 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2018-12-08 20:15:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:36,941 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2018-12-08 20:15:36,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:36,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 20:15:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:36,955 INFO L225 Difference]: With dead ends: 624 [2018-12-08 20:15:36,956 INFO L226 Difference]: Without dead ends: 380 [2018-12-08 20:15:36,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-08 20:15:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-12-08 20:15:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-08 20:15:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2018-12-08 20:15:37,012 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2018-12-08 20:15:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,012 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2018-12-08 20:15:37,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2018-12-08 20:15:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 20:15:37,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,014 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1177754650, now seen corresponding path program 1 times [2018-12-08 20:15:37,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:37,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:37,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:37,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,104 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2018-12-08 20:15:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,237 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2018-12-08 20:15:37,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:37,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 20:15:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,241 INFO L225 Difference]: With dead ends: 699 [2018-12-08 20:15:37,242 INFO L226 Difference]: Without dead ends: 536 [2018-12-08 20:15:37,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-12-08 20:15:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2018-12-08 20:15:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-12-08 20:15:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2018-12-08 20:15:37,280 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2018-12-08 20:15:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,280 INFO L480 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2018-12-08 20:15:37,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2018-12-08 20:15:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 20:15:37,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1821616786, now seen corresponding path program 1 times [2018-12-08 20:15:37,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:37,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:37,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:37,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:37,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,347 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2018-12-08 20:15:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,374 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2018-12-08 20:15:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:37,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 20:15:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,376 INFO L225 Difference]: With dead ends: 642 [2018-12-08 20:15:37,376 INFO L226 Difference]: Without dead ends: 623 [2018-12-08 20:15:37,377 INFO L631 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-12-08 20:15:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-12-08 20:15:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2018-12-08 20:15:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-12-08 20:15:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2018-12-08 20:15:37,396 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2018-12-08 20:15:37,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,396 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2018-12-08 20:15:37,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:37,396 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2018-12-08 20:15:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 20:15:37,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1105627836, now seen corresponding path program 1 times [2018-12-08 20:15:37,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:37,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:37,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:37,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,432 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2018-12-08 20:15:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,464 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2018-12-08 20:15:37,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:37,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 20:15:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,467 INFO L225 Difference]: With dead ends: 1080 [2018-12-08 20:15:37,468 INFO L226 Difference]: Without dead ends: 788 [2018-12-08 20:15:37,469 INFO L631 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-12-08 20:15:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-12-08 20:15:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2018-12-08 20:15:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-08 20:15:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2018-12-08 20:15:37,495 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2018-12-08 20:15:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,495 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2018-12-08 20:15:37,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2018-12-08 20:15:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 20:15:37,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,497 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash 149710402, now seen corresponding path program 1 times [2018-12-08 20:15:37,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:37,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,524 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2018-12-08 20:15:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,579 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2018-12-08 20:15:37,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:37,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 20:15:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,583 INFO L225 Difference]: With dead ends: 795 [2018-12-08 20:15:37,583 INFO L226 Difference]: Without dead ends: 790 [2018-12-08 20:15:37,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-08 20:15:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2018-12-08 20:15:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2018-12-08 20:15:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2018-12-08 20:15:37,610 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2018-12-08 20:15:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,610 INFO L480 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2018-12-08 20:15:37,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2018-12-08 20:15:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 20:15:37,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,612 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1382897701, now seen corresponding path program 1 times [2018-12-08 20:15:37,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,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-12-08 20:15:37,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:37,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:37,672 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2018-12-08 20:15:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,742 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2018-12-08 20:15:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:37,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-08 20:15:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,744 INFO L225 Difference]: With dead ends: 803 [2018-12-08 20:15:37,744 INFO L226 Difference]: Without dead ends: 800 [2018-12-08 20:15:37,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-08 20:15:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-12-08 20:15:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2018-12-08 20:15:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2018-12-08 20:15:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2018-12-08 20:15:37,763 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2018-12-08 20:15:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,763 INFO L480 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2018-12-08 20:15:37,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2018-12-08 20:15:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 20:15:37,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,764 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -91658760, now seen corresponding path program 1 times [2018-12-08 20:15:37,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,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-12-08 20:15:37,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:37,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:37,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:37,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:37,787 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2018-12-08 20:15:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,830 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2018-12-08 20:15:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:37,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-12-08 20:15:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,833 INFO L225 Difference]: With dead ends: 812 [2018-12-08 20:15:37,833 INFO L226 Difference]: Without dead ends: 797 [2018-12-08 20:15:37,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-12-08 20:15:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2018-12-08 20:15:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-12-08 20:15:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2018-12-08 20:15:37,851 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2018-12-08 20:15:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,851 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2018-12-08 20:15:37,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2018-12-08 20:15:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 20:15:37,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash 797704003, now seen corresponding path program 1 times [2018-12-08 20:15:37,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:37,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:37,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:37,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:37,888 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2018-12-08 20:15:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:37,918 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2018-12-08 20:15:37,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:37,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-08 20:15:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:37,921 INFO L225 Difference]: With dead ends: 810 [2018-12-08 20:15:37,921 INFO L226 Difference]: Without dead ends: 790 [2018-12-08 20:15:37,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-08 20:15:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-08 20:15:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-08 20:15:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2018-12-08 20:15:37,939 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2018-12-08 20:15:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:37,939 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2018-12-08 20:15:37,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2018-12-08 20:15:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 20:15:37,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:37,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:37,941 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:37,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:37,941 INFO L82 PathProgramCache]: Analyzing trace with hash 354660221, now seen corresponding path program 1 times [2018-12-08 20:15:37,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:37,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:37,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:37,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:37,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:37,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:37,972 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 5 states. [2018-12-08 20:15:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:38,211 INFO L93 Difference]: Finished difference Result 798 states and 1072 transitions. [2018-12-08 20:15:38,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:38,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-08 20:15:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:38,215 INFO L225 Difference]: With dead ends: 798 [2018-12-08 20:15:38,215 INFO L226 Difference]: Without dead ends: 792 [2018-12-08 20:15:38,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-08 20:15:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-12-08 20:15:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2018-12-08 20:15:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-08 20:15:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1065 transitions. [2018-12-08 20:15:38,246 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1065 transitions. Word has length 43 [2018-12-08 20:15:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:38,246 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1065 transitions. [2018-12-08 20:15:38,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1065 transitions. [2018-12-08 20:15:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 20:15:38,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:38,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:38,247 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:38,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:38,248 INFO L82 PathProgramCache]: Analyzing trace with hash 472733380, now seen corresponding path program 1 times [2018-12-08 20:15:38,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:38,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:38,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:38,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:38,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:15:38,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:15:38,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:15:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:15:38,287 INFO L87 Difference]: Start difference. First operand 790 states and 1065 transitions. Second operand 4 states. [2018-12-08 20:15:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:38,339 INFO L93 Difference]: Finished difference Result 818 states and 1098 transitions. [2018-12-08 20:15:38,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:15:38,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-08 20:15:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:38,342 INFO L225 Difference]: With dead ends: 818 [2018-12-08 20:15:38,342 INFO L226 Difference]: Without dead ends: 796 [2018-12-08 20:15:38,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-08 20:15:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2018-12-08 20:15:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 792. [2018-12-08 20:15:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-08 20:15:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1067 transitions. [2018-12-08 20:15:38,374 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1067 transitions. Word has length 42 [2018-12-08 20:15:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:38,374 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1067 transitions. [2018-12-08 20:15:38,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:15:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1067 transitions. [2018-12-08 20:15:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 20:15:38,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:38,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:38,376 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:38,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1725637380, now seen corresponding path program 1 times [2018-12-08 20:15:38,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:38,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:38,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:38,407 INFO L87 Difference]: Start difference. First operand 792 states and 1067 transitions. Second operand 3 states. [2018-12-08 20:15:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:38,486 INFO L93 Difference]: Finished difference Result 1170 states and 1590 transitions. [2018-12-08 20:15:38,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:38,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-12-08 20:15:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:38,490 INFO L225 Difference]: With dead ends: 1170 [2018-12-08 20:15:38,490 INFO L226 Difference]: Without dead ends: 1167 [2018-12-08 20:15:38,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-12-08 20:15:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 915. [2018-12-08 20:15:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-08 20:15:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2018-12-08 20:15:38,516 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 44 [2018-12-08 20:15:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:38,516 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2018-12-08 20:15:38,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2018-12-08 20:15:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 20:15:38,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:38,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:38,517 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:38,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1543911893, now seen corresponding path program 1 times [2018-12-08 20:15:38,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:38,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:38,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:38,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:38,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:38,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:38,560 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 5 states. [2018-12-08 20:15:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:38,793 INFO L93 Difference]: Finished difference Result 923 states and 1242 transitions. [2018-12-08 20:15:38,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:38,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-08 20:15:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:38,798 INFO L225 Difference]: With dead ends: 923 [2018-12-08 20:15:38,798 INFO L226 Difference]: Without dead ends: 917 [2018-12-08 20:15:38,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-08 20:15:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-12-08 20:15:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 915. [2018-12-08 20:15:38,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-08 20:15:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-12-08 20:15:38,849 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 44 [2018-12-08 20:15:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:38,850 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-12-08 20:15:38,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-12-08 20:15:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 20:15:38,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:38,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:38,851 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:38,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash 381844807, now seen corresponding path program 1 times [2018-12-08 20:15:38,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:38,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:38,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:38,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:38,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:38,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:15:38,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:15:38,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:15:38,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:15:38,890 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 4 states. [2018-12-08 20:15:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:38,966 INFO L93 Difference]: Finished difference Result 943 states and 1268 transitions. [2018-12-08 20:15:38,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:15:38,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-08 20:15:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:38,969 INFO L225 Difference]: With dead ends: 943 [2018-12-08 20:15:38,969 INFO L226 Difference]: Without dead ends: 921 [2018-12-08 20:15:38,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-08 20:15:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-12-08 20:15:39,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 915. [2018-12-08 20:15:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-12-08 20:15:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1235 transitions. [2018-12-08 20:15:39,010 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1235 transitions. Word has length 43 [2018-12-08 20:15:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:39,010 INFO L480 AbstractCegarLoop]: Abstraction has 915 states and 1235 transitions. [2018-12-08 20:15:39,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:15:39,010 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1235 transitions. [2018-12-08 20:15:39,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 20:15:39,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:39,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:39,011 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:39,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:39,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1717093558, now seen corresponding path program 1 times [2018-12-08 20:15:39,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:39,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:39,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:39,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-12-08 20:15:39,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:39,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:39,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:39,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:39,057 INFO L87 Difference]: Start difference. First operand 915 states and 1235 transitions. Second operand 5 states. [2018-12-08 20:15:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:39,477 INFO L93 Difference]: Finished difference Result 1639 states and 2181 transitions. [2018-12-08 20:15:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:39,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-08 20:15:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:39,480 INFO L225 Difference]: With dead ends: 1639 [2018-12-08 20:15:39,480 INFO L226 Difference]: Without dead ends: 1088 [2018-12-08 20:15:39,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-12-08 20:15:39,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 906. [2018-12-08 20:15:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-12-08 20:15:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2018-12-08 20:15:39,510 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 45 [2018-12-08 20:15:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:39,510 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2018-12-08 20:15:39,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2018-12-08 20:15:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 20:15:39,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:39,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:39,511 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:39,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 700175398, now seen corresponding path program 1 times [2018-12-08 20:15:39,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:39,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:39,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:39,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:39,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:39,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:39,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:39,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:39,539 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2018-12-08 20:15:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:39,584 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2018-12-08 20:15:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:39,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-08 20:15:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:39,588 INFO L225 Difference]: With dead ends: 922 [2018-12-08 20:15:39,588 INFO L226 Difference]: Without dead ends: 904 [2018-12-08 20:15:39,588 INFO L631 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-12-08 20:15:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-08 20:15:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2018-12-08 20:15:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-08 20:15:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2018-12-08 20:15:39,626 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2018-12-08 20:15:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:39,627 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2018-12-08 20:15:39,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2018-12-08 20:15:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:15:39,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:39,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:39,628 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:39,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:39,628 INFO L82 PathProgramCache]: Analyzing trace with hash -47081320, now seen corresponding path program 1 times [2018-12-08 20:15:39,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:39,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:39,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:39,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:39,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:39,654 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2018-12-08 20:15:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:39,698 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2018-12-08 20:15:39,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:39,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-08 20:15:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:39,701 INFO L225 Difference]: With dead ends: 944 [2018-12-08 20:15:39,701 INFO L226 Difference]: Without dead ends: 868 [2018-12-08 20:15:39,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-12-08 20:15:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2018-12-08 20:15:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-08 20:15:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2018-12-08 20:15:39,726 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2018-12-08 20:15:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:39,726 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2018-12-08 20:15:39,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2018-12-08 20:15:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 20:15:39,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:39,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:39,727 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:39,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1679726262, now seen corresponding path program 1 times [2018-12-08 20:15:39,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:39,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:39,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:39,757 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2018-12-08 20:15:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:39,789 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2018-12-08 20:15:39,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:39,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-08 20:15:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:39,792 INFO L225 Difference]: With dead ends: 881 [2018-12-08 20:15:39,792 INFO L226 Difference]: Without dead ends: 863 [2018-12-08 20:15:39,793 INFO L631 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-12-08 20:15:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-12-08 20:15:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-12-08 20:15:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-12-08 20:15:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2018-12-08 20:15:39,835 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2018-12-08 20:15:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:39,835 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2018-12-08 20:15:39,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2018-12-08 20:15:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 20:15:39,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:39,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:39,837 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:39,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:39,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1637294242, now seen corresponding path program 1 times [2018-12-08 20:15:39,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:39,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:39,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:39,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:39,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:39,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:39,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:39,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:39,878 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 6 states. [2018-12-08 20:15:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:39,935 INFO L93 Difference]: Finished difference Result 883 states and 1175 transitions. [2018-12-08 20:15:39,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:39,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-08 20:15:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:39,938 INFO L225 Difference]: With dead ends: 883 [2018-12-08 20:15:39,938 INFO L226 Difference]: Without dead ends: 863 [2018-12-08 20:15:39,938 INFO L631 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-12-08 20:15:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2018-12-08 20:15:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2018-12-08 20:15:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2018-12-08 20:15:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1143 transitions. [2018-12-08 20:15:39,963 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1143 transitions. Word has length 50 [2018-12-08 20:15:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:39,963 INFO L480 AbstractCegarLoop]: Abstraction has 863 states and 1143 transitions. [2018-12-08 20:15:39,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1143 transitions. [2018-12-08 20:15:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 20:15:39,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:39,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:39,964 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:39,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1826385380, now seen corresponding path program 1 times [2018-12-08 20:15:39,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:39,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:39,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:39,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:39,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:39,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:39,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:39,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:39,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:39,984 INFO L87 Difference]: Start difference. First operand 863 states and 1143 transitions. Second operand 3 states. [2018-12-08 20:15:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:40,073 INFO L93 Difference]: Finished difference Result 1180 states and 1584 transitions. [2018-12-08 20:15:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 20:15:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:40,076 INFO L225 Difference]: With dead ends: 1180 [2018-12-08 20:15:40,077 INFO L226 Difference]: Without dead ends: 1153 [2018-12-08 20:15:40,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-12-08 20:15:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 966. [2018-12-08 20:15:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-12-08 20:15:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1285 transitions. [2018-12-08 20:15:40,115 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1285 transitions. Word has length 50 [2018-12-08 20:15:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:40,116 INFO L480 AbstractCegarLoop]: Abstraction has 966 states and 1285 transitions. [2018-12-08 20:15:40,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1285 transitions. [2018-12-08 20:15:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:15:40,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:40,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:40,117 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:40,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash -273092308, now seen corresponding path program 1 times [2018-12-08 20:15:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:40,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-12-08 20:15:40,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:40,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:15:40,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:15:40,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:15:40,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:15:40,154 INFO L87 Difference]: Start difference. First operand 966 states and 1285 transitions. Second operand 4 states. [2018-12-08 20:15:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:40,280 INFO L93 Difference]: Finished difference Result 1059 states and 1376 transitions. [2018-12-08 20:15:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:15:40,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-08 20:15:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:40,282 INFO L225 Difference]: With dead ends: 1059 [2018-12-08 20:15:40,283 INFO L226 Difference]: Without dead ends: 659 [2018-12-08 20:15:40,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:15:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-12-08 20:15:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 622. [2018-12-08 20:15:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-12-08 20:15:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2018-12-08 20:15:40,312 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 52 [2018-12-08 20:15:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:40,312 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2018-12-08 20:15:40,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:15:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2018-12-08 20:15:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:15:40,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:40,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:40,313 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:40,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash 998036193, now seen corresponding path program 1 times [2018-12-08 20:15:40,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:40,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:40,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:15:40,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:15:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:15:40,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:40,357 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2018-12-08 20:15:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:40,424 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2018-12-08 20:15:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:15:40,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-12-08 20:15:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:40,426 INFO L225 Difference]: With dead ends: 661 [2018-12-08 20:15:40,426 INFO L226 Difference]: Without dead ends: 612 [2018-12-08 20:15:40,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:15:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-08 20:15:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2018-12-08 20:15:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-12-08 20:15:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2018-12-08 20:15:40,459 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2018-12-08 20:15:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:40,459 INFO L480 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2018-12-08 20:15:40,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:15:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2018-12-08 20:15:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:15:40,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:40,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:40,461 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:40,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1800502866, now seen corresponding path program 1 times [2018-12-08 20:15:40,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:40,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:40,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:40,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:40,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:40,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:40,503 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2018-12-08 20:15:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:40,552 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2018-12-08 20:15:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:40,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-08 20:15:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:40,554 INFO L225 Difference]: With dead ends: 637 [2018-12-08 20:15:40,555 INFO L226 Difference]: Without dead ends: 612 [2018-12-08 20:15:40,555 INFO L631 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-12-08 20:15:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-08 20:15:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2018-12-08 20:15:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-08 20:15:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2018-12-08 20:15:40,588 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2018-12-08 20:15:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:40,588 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2018-12-08 20:15:40,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2018-12-08 20:15:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:15:40,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:40,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:40,590 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:40,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1235297599, now seen corresponding path program 1 times [2018-12-08 20:15:40,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:40,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:40,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:15:40,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:15:40,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:15:40,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:15:40,641 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2018-12-08 20:15:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:40,763 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2018-12-08 20:15:40,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:15:40,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-12-08 20:15:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:40,764 INFO L225 Difference]: With dead ends: 642 [2018-12-08 20:15:40,764 INFO L226 Difference]: Without dead ends: 638 [2018-12-08 20:15:40,764 INFO L631 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-12-08 20:15:40,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-12-08 20:15:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-12-08 20:15:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-12-08 20:15:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2018-12-08 20:15:40,798 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2018-12-08 20:15:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:40,798 INFO L480 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2018-12-08 20:15:40,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:15:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2018-12-08 20:15:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:15:40,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:40,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:40,800 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:40,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1235020769, now seen corresponding path program 1 times [2018-12-08 20:15:40,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:40,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:40,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:40,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:40,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:40,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:15:40,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:15:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:15:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:15:40,855 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2018-12-08 20:15:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:40,921 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2018-12-08 20:15:40,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:15:40,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-12-08 20:15:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:40,923 INFO L225 Difference]: With dead ends: 1024 [2018-12-08 20:15:40,923 INFO L226 Difference]: Without dead ends: 670 [2018-12-08 20:15:40,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:15:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-12-08 20:15:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2018-12-08 20:15:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-12-08 20:15:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2018-12-08 20:15:40,944 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2018-12-08 20:15:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:40,945 INFO L480 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2018-12-08 20:15:40,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:15:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2018-12-08 20:15:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:15:40,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:40,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:40,946 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:40,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -203655125, now seen corresponding path program 1 times [2018-12-08 20:15:40,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:40,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:40,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:40,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:15:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:15:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:15:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:40,982 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 7 states. [2018-12-08 20:15:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:41,427 INFO L93 Difference]: Finished difference Result 805 states and 1032 transitions. [2018-12-08 20:15:41,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:15:41,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-08 20:15:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:41,429 INFO L225 Difference]: With dead ends: 805 [2018-12-08 20:15:41,429 INFO L226 Difference]: Without dead ends: 708 [2018-12-08 20:15:41,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:15:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-12-08 20:15:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 680. [2018-12-08 20:15:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-08 20:15:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 873 transitions. [2018-12-08 20:15:41,461 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 873 transitions. Word has length 52 [2018-12-08 20:15:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:41,462 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 873 transitions. [2018-12-08 20:15:41,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:15:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 873 transitions. [2018-12-08 20:15:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:15:41,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:41,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:41,463 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:41,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash -60375767, now seen corresponding path program 1 times [2018-12-08 20:15:41,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:41,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:41,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:41,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:41,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:41,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:41,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:41,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:41,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:41,482 INFO L87 Difference]: Start difference. First operand 680 states and 873 transitions. Second operand 3 states. [2018-12-08 20:15:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:41,555 INFO L93 Difference]: Finished difference Result 838 states and 1091 transitions. [2018-12-08 20:15:41,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:41,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 20:15:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:41,557 INFO L225 Difference]: With dead ends: 838 [2018-12-08 20:15:41,557 INFO L226 Difference]: Without dead ends: 765 [2018-12-08 20:15:41,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-12-08 20:15:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 653. [2018-12-08 20:15:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-12-08 20:15:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 852 transitions. [2018-12-08 20:15:41,582 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 852 transitions. Word has length 52 [2018-12-08 20:15:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:41,582 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 852 transitions. [2018-12-08 20:15:41,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 852 transitions. [2018-12-08 20:15:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:15:41,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:41,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:41,583 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:41,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2114998175, now seen corresponding path program 1 times [2018-12-08 20:15:41,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:41,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:41,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:41,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:41,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:41,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:41,631 INFO L87 Difference]: Start difference. First operand 653 states and 852 transitions. Second operand 9 states. [2018-12-08 20:15:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:42,550 INFO L93 Difference]: Finished difference Result 850 states and 1093 transitions. [2018-12-08 20:15:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 20:15:42,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-12-08 20:15:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:42,552 INFO L225 Difference]: With dead ends: 850 [2018-12-08 20:15:42,552 INFO L226 Difference]: Without dead ends: 783 [2018-12-08 20:15:42,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:15:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-08 20:15:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 620. [2018-12-08 20:15:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-12-08 20:15:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 789 transitions. [2018-12-08 20:15:42,576 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 789 transitions. Word has length 52 [2018-12-08 20:15:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:42,577 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 789 transitions. [2018-12-08 20:15:42,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 789 transitions. [2018-12-08 20:15:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 20:15:42,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:42,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:42,578 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:42,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1870270086, now seen corresponding path program 1 times [2018-12-08 20:15:42,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:42,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:42,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:42,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:42,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:42,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:42,602 INFO L87 Difference]: Start difference. First operand 620 states and 789 transitions. Second operand 5 states. [2018-12-08 20:15:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:42,872 INFO L93 Difference]: Finished difference Result 767 states and 997 transitions. [2018-12-08 20:15:42,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:42,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-08 20:15:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:42,875 INFO L225 Difference]: With dead ends: 767 [2018-12-08 20:15:42,875 INFO L226 Difference]: Without dead ends: 749 [2018-12-08 20:15:42,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12-08 20:15:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-08 20:15:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 603. [2018-12-08 20:15:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-12-08 20:15:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 762 transitions. [2018-12-08 20:15:42,900 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 762 transitions. Word has length 54 [2018-12-08 20:15:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:42,901 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 762 transitions. [2018-12-08 20:15:42,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 762 transitions. [2018-12-08 20:15:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 20:15:42,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:42,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:42,902 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:42,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:42,903 INFO L82 PathProgramCache]: Analyzing trace with hash -936674225, now seen corresponding path program 1 times [2018-12-08 20:15:42,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:42,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:42,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:42,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:42,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:15:42,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:15:42,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:15:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:15:42,954 INFO L87 Difference]: Start difference. First operand 603 states and 762 transitions. Second operand 8 states. [2018-12-08 20:15:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,007 INFO L93 Difference]: Finished difference Result 616 states and 774 transitions. [2018-12-08 20:15:43,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:15:43,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-12-08 20:15:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,009 INFO L225 Difference]: With dead ends: 616 [2018-12-08 20:15:43,009 INFO L226 Difference]: Without dead ends: 588 [2018-12-08 20:15:43,009 INFO L631 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-12-08 20:15:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-12-08 20:15:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2018-12-08 20:15:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-12-08 20:15:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 743 transitions. [2018-12-08 20:15:43,039 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 743 transitions. Word has length 55 [2018-12-08 20:15:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,039 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 743 transitions. [2018-12-08 20:15:43,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:15:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 743 transitions. [2018-12-08 20:15:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 20:15:43,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,040 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash -492692256, now seen corresponding path program 1 times [2018-12-08 20:15:43,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:43,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:43,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:43,068 INFO L87 Difference]: Start difference. First operand 588 states and 743 transitions. Second operand 3 states. [2018-12-08 20:15:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,144 INFO L93 Difference]: Finished difference Result 896 states and 1142 transitions. [2018-12-08 20:15:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:43,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-08 20:15:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,146 INFO L225 Difference]: With dead ends: 896 [2018-12-08 20:15:43,147 INFO L226 Difference]: Without dead ends: 587 [2018-12-08 20:15:43,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-12-08 20:15:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2018-12-08 20:15:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-12-08 20:15:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 739 transitions. [2018-12-08 20:15:43,171 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 739 transitions. Word has length 58 [2018-12-08 20:15:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,171 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 739 transitions. [2018-12-08 20:15:43,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 739 transitions. [2018-12-08 20:15:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:15:43,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,172 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 331311930, now seen corresponding path program 1 times [2018-12-08 20:15:43,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:43,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:43,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:43,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:43,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:43,247 INFO L87 Difference]: Start difference. First operand 587 states and 739 transitions. Second operand 5 states. [2018-12-08 20:15:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,290 INFO L93 Difference]: Finished difference Result 846 states and 1074 transitions. [2018-12-08 20:15:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:43,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-12-08 20:15:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,292 INFO L225 Difference]: With dead ends: 846 [2018-12-08 20:15:43,292 INFO L226 Difference]: Without dead ends: 538 [2018-12-08 20:15:43,293 INFO L631 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-12-08 20:15:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-08 20:15:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-08 20:15:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-08 20:15:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 671 transitions. [2018-12-08 20:15:43,319 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 671 transitions. Word has length 64 [2018-12-08 20:15:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,319 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 671 transitions. [2018-12-08 20:15:43,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 671 transitions. [2018-12-08 20:15:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 20:15:43,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,320 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash 800339537, now seen corresponding path program 1 times [2018-12-08 20:15:43,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:43,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:43,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:15:43,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:15:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:15:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:15:43,372 INFO L87 Difference]: Start difference. First operand 538 states and 671 transitions. Second operand 8 states. [2018-12-08 20:15:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,489 INFO L93 Difference]: Finished difference Result 552 states and 684 transitions. [2018-12-08 20:15:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:15:43,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-08 20:15:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,491 INFO L225 Difference]: With dead ends: 552 [2018-12-08 20:15:43,491 INFO L226 Difference]: Without dead ends: 534 [2018-12-08 20:15:43,492 INFO L631 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-12-08 20:15:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-12-08 20:15:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2018-12-08 20:15:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-12-08 20:15:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 665 transitions. [2018-12-08 20:15:43,529 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 665 transitions. Word has length 58 [2018-12-08 20:15:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,529 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 665 transitions. [2018-12-08 20:15:43,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:15:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 665 transitions. [2018-12-08 20:15:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 20:15:43,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,530 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash -247744455, now seen corresponding path program 1 times [2018-12-08 20:15:43,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:43,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:43,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:43,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:43,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:43,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:43,564 INFO L87 Difference]: Start difference. First operand 534 states and 665 transitions. Second operand 6 states. [2018-12-08 20:15:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,628 INFO L93 Difference]: Finished difference Result 553 states and 684 transitions. [2018-12-08 20:15:43,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:43,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-12-08 20:15:43,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,630 INFO L225 Difference]: With dead ends: 553 [2018-12-08 20:15:43,630 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 20:15:43,631 INFO L631 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-12-08 20:15:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 20:15:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-08 20:15:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-08 20:15:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 659 transitions. [2018-12-08 20:15:43,666 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 659 transitions. Word has length 60 [2018-12-08 20:15:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,666 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 659 transitions. [2018-12-08 20:15:43,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 659 transitions. [2018-12-08 20:15:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 20:15:43,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,667 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 502127777, now seen corresponding path program 1 times [2018-12-08 20:15:43,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:43,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:43,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:43,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:43,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:43,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:43,705 INFO L87 Difference]: Start difference. First operand 529 states and 659 transitions. Second operand 5 states. [2018-12-08 20:15:43,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,886 INFO L93 Difference]: Finished difference Result 788 states and 988 transitions. [2018-12-08 20:15:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:43,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-08 20:15:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,888 INFO L225 Difference]: With dead ends: 788 [2018-12-08 20:15:43,888 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 20:15:43,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 20:15:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-08 20:15:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-08 20:15:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 657 transitions. [2018-12-08 20:15:43,911 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 657 transitions. Word has length 68 [2018-12-08 20:15:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,911 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 657 transitions. [2018-12-08 20:15:43,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 657 transitions. [2018-12-08 20:15:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:15:43,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,912 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1762057128, now seen corresponding path program 1 times [2018-12-08 20:15:43,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:43,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:43,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:43,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:43,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:43,937 INFO L87 Difference]: Start difference. First operand 529 states and 657 transitions. Second operand 5 states. [2018-12-08 20:15:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:43,966 INFO L93 Difference]: Finished difference Result 648 states and 797 transitions. [2018-12-08 20:15:43,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:43,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-08 20:15:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:43,968 INFO L225 Difference]: With dead ends: 648 [2018-12-08 20:15:43,968 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 20:15:43,968 INFO L631 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-12-08 20:15:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 20:15:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-12-08 20:15:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-08 20:15:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 661 transitions. [2018-12-08 20:15:43,991 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 661 transitions. Word has length 63 [2018-12-08 20:15:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:43,991 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 661 transitions. [2018-12-08 20:15:43,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 661 transitions. [2018-12-08 20:15:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:15:43,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:43,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:43,992 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:43,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:43,992 INFO L82 PathProgramCache]: Analyzing trace with hash 517740439, now seen corresponding path program 1 times [2018-12-08 20:15:43,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:43,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:43,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:44,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:44,034 INFO L87 Difference]: Start difference. First operand 533 states and 661 transitions. Second operand 9 states. [2018-12-08 20:15:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:44,102 INFO L93 Difference]: Finished difference Result 666 states and 815 transitions. [2018-12-08 20:15:44,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:44,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-12-08 20:15:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:44,104 INFO L225 Difference]: With dead ends: 666 [2018-12-08 20:15:44,104 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 20:15:44,105 INFO L631 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-12-08 20:15:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 20:15:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2018-12-08 20:15:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-08 20:15:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-12-08 20:15:44,141 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 63 [2018-12-08 20:15:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:44,141 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-12-08 20:15:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-12-08 20:15:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 20:15:44,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:44,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:44,142 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:44,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1193132232, now seen corresponding path program 1 times [2018-12-08 20:15:44,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:44,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:44,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:15:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:15:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:15:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:44,169 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 3 states. [2018-12-08 20:15:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:44,212 INFO L93 Difference]: Finished difference Result 808 states and 1014 transitions. [2018-12-08 20:15:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:15:44,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-08 20:15:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:44,214 INFO L225 Difference]: With dead ends: 808 [2018-12-08 20:15:44,214 INFO L226 Difference]: Without dead ends: 549 [2018-12-08 20:15:44,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:15:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-12-08 20:15:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2018-12-08 20:15:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-08 20:15:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 660 transitions. [2018-12-08 20:15:44,247 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 660 transitions. Word has length 71 [2018-12-08 20:15:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:44,247 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 660 transitions. [2018-12-08 20:15:44,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:15:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 660 transitions. [2018-12-08 20:15:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 20:15:44,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:44,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:44,248 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:44,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1107799800, now seen corresponding path program 1 times [2018-12-08 20:15:44,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:44,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:44,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:44,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:44,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:44,294 INFO L87 Difference]: Start difference. First operand 533 states and 660 transitions. Second operand 6 states. [2018-12-08 20:15:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:44,348 INFO L93 Difference]: Finished difference Result 776 states and 968 transitions. [2018-12-08 20:15:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:44,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-08 20:15:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:44,350 INFO L225 Difference]: With dead ends: 776 [2018-12-08 20:15:44,350 INFO L226 Difference]: Without dead ends: 550 [2018-12-08 20:15:44,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-12-08 20:15:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2018-12-08 20:15:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-12-08 20:15:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 658 transitions. [2018-12-08 20:15:44,373 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 658 transitions. Word has length 71 [2018-12-08 20:15:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:44,373 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 658 transitions. [2018-12-08 20:15:44,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 658 transitions. [2018-12-08 20:15:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:15:44,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:44,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:44,374 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:44,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash 848393777, now seen corresponding path program 1 times [2018-12-08 20:15:44,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:44,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:44,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:44,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:44,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:44,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:44,421 INFO L87 Difference]: Start difference. First operand 533 states and 658 transitions. Second operand 9 states. [2018-12-08 20:15:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:44,537 INFO L93 Difference]: Finished difference Result 550 states and 675 transitions. [2018-12-08 20:15:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:44,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-12-08 20:15:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:44,539 INFO L225 Difference]: With dead ends: 550 [2018-12-08 20:15:44,539 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 20:15:44,539 INFO L631 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-12-08 20:15:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 20:15:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-12-08 20:15:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-12-08 20:15:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 652 transitions. [2018-12-08 20:15:44,562 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 652 transitions. Word has length 63 [2018-12-08 20:15:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:44,562 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 652 transitions. [2018-12-08 20:15:44,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 652 transitions. [2018-12-08 20:15:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:15:44,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:44,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:44,563 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:44,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1112788646, now seen corresponding path program 1 times [2018-12-08 20:15:44,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:44,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:44,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:44,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:44,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:15:44,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:15:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:15:44,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:15:44,609 INFO L87 Difference]: Start difference. First operand 529 states and 652 transitions. Second operand 8 states. [2018-12-08 20:15:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:44,722 INFO L93 Difference]: Finished difference Result 540 states and 662 transitions. [2018-12-08 20:15:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:15:44,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-12-08 20:15:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:44,723 INFO L225 Difference]: With dead ends: 540 [2018-12-08 20:15:44,723 INFO L226 Difference]: Without dead ends: 518 [2018-12-08 20:15:44,723 INFO L631 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-12-08 20:15:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-12-08 20:15:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2018-12-08 20:15:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-12-08 20:15:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 637 transitions. [2018-12-08 20:15:44,755 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 637 transitions. Word has length 64 [2018-12-08 20:15:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:44,755 INFO L480 AbstractCegarLoop]: Abstraction has 518 states and 637 transitions. [2018-12-08 20:15:44,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:15:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 637 transitions. [2018-12-08 20:15:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:15:44,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:44,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:44,756 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:44,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash -757918773, now seen corresponding path program 1 times [2018-12-08 20:15:44,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:44,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:44,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:44,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:44,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:44,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:44,814 INFO L87 Difference]: Start difference. First operand 518 states and 637 transitions. Second operand 9 states. [2018-12-08 20:15:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:44,933 INFO L93 Difference]: Finished difference Result 535 states and 654 transitions. [2018-12-08 20:15:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:44,933 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-12-08 20:15:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:44,934 INFO L225 Difference]: With dead ends: 535 [2018-12-08 20:15:44,934 INFO L226 Difference]: Without dead ends: 513 [2018-12-08 20:15:44,934 INFO L631 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-12-08 20:15:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-08 20:15:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-12-08 20:15:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-12-08 20:15:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 630 transitions. [2018-12-08 20:15:44,955 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 630 transitions. Word has length 64 [2018-12-08 20:15:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:44,956 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 630 transitions. [2018-12-08 20:15:44,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 630 transitions. [2018-12-08 20:15:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 20:15:44,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:44,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:44,956 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:44,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1688030243, now seen corresponding path program 1 times [2018-12-08 20:15:44,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:44,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:44,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:45,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-12-08 20:15:45,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:45,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:45,005 INFO L87 Difference]: Start difference. First operand 513 states and 630 transitions. Second operand 9 states. [2018-12-08 20:15:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:45,111 INFO L93 Difference]: Finished difference Result 530 states and 647 transitions. [2018-12-08 20:15:45,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:45,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-12-08 20:15:45,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:45,113 INFO L225 Difference]: With dead ends: 530 [2018-12-08 20:15:45,113 INFO L226 Difference]: Without dead ends: 509 [2018-12-08 20:15:45,113 INFO L631 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-12-08 20:15:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-08 20:15:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-12-08 20:15:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-08 20:15:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 624 transitions. [2018-12-08 20:15:45,134 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 624 transitions. Word has length 64 [2018-12-08 20:15:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 624 transitions. [2018-12-08 20:15:45,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 624 transitions. [2018-12-08 20:15:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 20:15:45,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:45,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:45,134 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:45,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash 70476455, now seen corresponding path program 1 times [2018-12-08 20:15:45,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:45,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:45,207 INFO L87 Difference]: Start difference. First operand 509 states and 624 transitions. Second operand 5 states. [2018-12-08 20:15:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:45,478 INFO L93 Difference]: Finished difference Result 878 states and 1083 transitions. [2018-12-08 20:15:45,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:45,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-08 20:15:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:45,479 INFO L225 Difference]: With dead ends: 878 [2018-12-08 20:15:45,479 INFO L226 Difference]: Without dead ends: 625 [2018-12-08 20:15:45,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:15:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-12-08 20:15:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 583. [2018-12-08 20:15:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-12-08 20:15:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 718 transitions. [2018-12-08 20:15:45,508 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 718 transitions. Word has length 70 [2018-12-08 20:15:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:45,508 INFO L480 AbstractCegarLoop]: Abstraction has 583 states and 718 transitions. [2018-12-08 20:15:45,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2018-12-08 20:15:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 20:15:45,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:45,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:45,509 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:45,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1382250420, now seen corresponding path program 1 times [2018-12-08 20:15:45,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:45,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:45,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:45,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:45,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:45,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:45,549 INFO L87 Difference]: Start difference. First operand 583 states and 718 transitions. Second operand 9 states. [2018-12-08 20:15:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:45,689 INFO L93 Difference]: Finished difference Result 600 states and 735 transitions. [2018-12-08 20:15:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:45,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-08 20:15:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:45,691 INFO L225 Difference]: With dead ends: 600 [2018-12-08 20:15:45,691 INFO L226 Difference]: Without dead ends: 557 [2018-12-08 20:15:45,692 INFO L631 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-12-08 20:15:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2018-12-08 20:15:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2018-12-08 20:15:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-08 20:15:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 686 transitions. [2018-12-08 20:15:45,729 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 686 transitions. Word has length 68 [2018-12-08 20:15:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:45,729 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 686 transitions. [2018-12-08 20:15:45,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 686 transitions. [2018-12-08 20:15:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 20:15:45,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:45,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:45,731 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:45,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:45,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1735546476, now seen corresponding path program 1 times [2018-12-08 20:15:45,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:45,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:45,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:45,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:45,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:45,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:45,784 INFO L87 Difference]: Start difference. First operand 557 states and 686 transitions. Second operand 9 states. [2018-12-08 20:15:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:45,851 INFO L93 Difference]: Finished difference Result 592 states and 726 transitions. [2018-12-08 20:15:45,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:45,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-12-08 20:15:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:45,852 INFO L225 Difference]: With dead ends: 592 [2018-12-08 20:15:45,852 INFO L226 Difference]: Without dead ends: 565 [2018-12-08 20:15:45,853 INFO L631 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-12-08 20:15:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-12-08 20:15:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2018-12-08 20:15:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-12-08 20:15:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 693 transitions. [2018-12-08 20:15:45,882 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 693 transitions. Word has length 76 [2018-12-08 20:15:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:45,882 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 693 transitions. [2018-12-08 20:15:45,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 693 transitions. [2018-12-08 20:15:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 20:15:45,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:45,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:45,883 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:45,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:45,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1846504819, now seen corresponding path program 1 times [2018-12-08 20:15:45,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:45,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:45,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:45,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:45,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:45,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:45,919 INFO L87 Difference]: Start difference. First operand 563 states and 693 transitions. Second operand 5 states. [2018-12-08 20:15:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:45,960 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2018-12-08 20:15:45,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:45,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-08 20:15:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:45,961 INFO L225 Difference]: With dead ends: 657 [2018-12-08 20:15:45,961 INFO L226 Difference]: Without dead ends: 510 [2018-12-08 20:15:45,962 INFO L631 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-12-08 20:15:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-12-08 20:15:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2018-12-08 20:15:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-12-08 20:15:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 624 transitions. [2018-12-08 20:15:45,992 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 624 transitions. Word has length 76 [2018-12-08 20:15:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:45,992 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 624 transitions. [2018-12-08 20:15:45,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 624 transitions. [2018-12-08 20:15:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-08 20:15:45,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:45,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:45,993 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:45,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1102145568, now seen corresponding path program 1 times [2018-12-08 20:15:45,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:45,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:46,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-12-08 20:15:46,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:46,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:15:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:15:46,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:15:46,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:46,064 INFO L87 Difference]: Start difference. First operand 510 states and 624 transitions. Second operand 7 states. [2018-12-08 20:15:46,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:46,464 INFO L93 Difference]: Finished difference Result 814 states and 1002 transitions. [2018-12-08 20:15:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:15:46,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-08 20:15:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:46,466 INFO L225 Difference]: With dead ends: 814 [2018-12-08 20:15:46,466 INFO L226 Difference]: Without dead ends: 505 [2018-12-08 20:15:46,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:15:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-08 20:15:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 494. [2018-12-08 20:15:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-08 20:15:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 599 transitions. [2018-12-08 20:15:46,497 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 599 transitions. Word has length 82 [2018-12-08 20:15:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:46,497 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 599 transitions. [2018-12-08 20:15:46,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:15:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 599 transitions. [2018-12-08 20:15:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 20:15:46,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:46,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:46,498 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:46,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1177659047, now seen corresponding path program 1 times [2018-12-08 20:15:46,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:46,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:46,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:46,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:46,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:46,552 INFO L87 Difference]: Start difference. First operand 494 states and 599 transitions. Second operand 6 states. [2018-12-08 20:15:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:46,607 INFO L93 Difference]: Finished difference Result 801 states and 999 transitions. [2018-12-08 20:15:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:46,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-12-08 20:15:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:46,608 INFO L225 Difference]: With dead ends: 801 [2018-12-08 20:15:46,608 INFO L226 Difference]: Without dead ends: 547 [2018-12-08 20:15:46,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-08 20:15:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 460. [2018-12-08 20:15:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-08 20:15:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 555 transitions. [2018-12-08 20:15:46,630 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 555 transitions. Word has length 83 [2018-12-08 20:15:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:46,630 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 555 transitions. [2018-12-08 20:15:46,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 555 transitions. [2018-12-08 20:15:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 20:15:46,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:46,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:46,631 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash 583311642, now seen corresponding path program 1 times [2018-12-08 20:15:46,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:46,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-12-08 20:15:46,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:46,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:46,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:46,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:46,669 INFO L87 Difference]: Start difference. First operand 460 states and 555 transitions. Second operand 5 states. [2018-12-08 20:15:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:46,894 INFO L93 Difference]: Finished difference Result 880 states and 1043 transitions. [2018-12-08 20:15:46,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:46,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-08 20:15:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:46,896 INFO L225 Difference]: With dead ends: 880 [2018-12-08 20:15:46,896 INFO L226 Difference]: Without dead ends: 561 [2018-12-08 20:15:46,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-12-08 20:15:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 538. [2018-12-08 20:15:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-08 20:15:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 637 transitions. [2018-12-08 20:15:46,923 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 637 transitions. Word has length 78 [2018-12-08 20:15:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:46,923 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 637 transitions. [2018-12-08 20:15:46,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 637 transitions. [2018-12-08 20:15:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 20:15:46,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:46,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:46,923 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:46,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -561171894, now seen corresponding path program 1 times [2018-12-08 20:15:46,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:46,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:46,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:46,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:46,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:46,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:46,958 INFO L87 Difference]: Start difference. First operand 538 states and 637 transitions. Second operand 9 states. [2018-12-08 20:15:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,052 INFO L93 Difference]: Finished difference Result 540 states and 638 transitions. [2018-12-08 20:15:47,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:47,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-12-08 20:15:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,053 INFO L225 Difference]: With dead ends: 540 [2018-12-08 20:15:47,053 INFO L226 Difference]: Without dead ends: 449 [2018-12-08 20:15:47,053 INFO L631 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-12-08 20:15:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-08 20:15:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-12-08 20:15:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-08 20:15:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 535 transitions. [2018-12-08 20:15:47,077 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 535 transitions. Word has length 81 [2018-12-08 20:15:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,077 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 535 transitions. [2018-12-08 20:15:47,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 535 transitions. [2018-12-08 20:15:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 20:15:47,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:47,078 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1831635273, now seen corresponding path program 1 times [2018-12-08 20:15:47,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:47,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:47,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:47,136 INFO L87 Difference]: Start difference. First operand 449 states and 535 transitions. Second operand 9 states. [2018-12-08 20:15:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,224 INFO L93 Difference]: Finished difference Result 470 states and 557 transitions. [2018-12-08 20:15:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:47,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-12-08 20:15:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,225 INFO L225 Difference]: With dead ends: 470 [2018-12-08 20:15:47,226 INFO L226 Difference]: Without dead ends: 449 [2018-12-08 20:15:47,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:15:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-08 20:15:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-12-08 20:15:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-08 20:15:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 534 transitions. [2018-12-08 20:15:47,250 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 534 transitions. Word has length 88 [2018-12-08 20:15:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,250 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 534 transitions. [2018-12-08 20:15:47,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 534 transitions. [2018-12-08 20:15:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 20:15:47,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:47,251 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1636495317, now seen corresponding path program 1 times [2018-12-08 20:15:47,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:47,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:47,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:47,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:47,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:47,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:47,290 INFO L87 Difference]: Start difference. First operand 449 states and 534 transitions. Second operand 6 states. [2018-12-08 20:15:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,337 INFO L93 Difference]: Finished difference Result 482 states and 566 transitions. [2018-12-08 20:15:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:47,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 20:15:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,338 INFO L225 Difference]: With dead ends: 482 [2018-12-08 20:15:47,339 INFO L226 Difference]: Without dead ends: 443 [2018-12-08 20:15:47,339 INFO L631 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-12-08 20:15:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-08 20:15:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 390. [2018-12-08 20:15:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-12-08 20:15:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 458 transitions. [2018-12-08 20:15:47,360 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 458 transitions. Word has length 99 [2018-12-08 20:15:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,360 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 458 transitions. [2018-12-08 20:15:47,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 458 transitions. [2018-12-08 20:15:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 20:15:47,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:47,361 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -363913567, now seen corresponding path program 1 times [2018-12-08 20:15:47,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:47,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:47,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:15:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:15:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:15:47,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:47,390 INFO L87 Difference]: Start difference. First operand 390 states and 458 transitions. Second operand 7 states. [2018-12-08 20:15:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,518 INFO L93 Difference]: Finished difference Result 736 states and 870 transitions. [2018-12-08 20:15:47,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:47,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-08 20:15:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,520 INFO L225 Difference]: With dead ends: 736 [2018-12-08 20:15:47,520 INFO L226 Difference]: Without dead ends: 691 [2018-12-08 20:15:47,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:15:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-12-08 20:15:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 370. [2018-12-08 20:15:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-12-08 20:15:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 433 transitions. [2018-12-08 20:15:47,554 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 433 transitions. Word has length 99 [2018-12-08 20:15:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,554 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 433 transitions. [2018-12-08 20:15:47,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:15:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 433 transitions. [2018-12-08 20:15:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 20:15:47,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:47,555 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1119440733, now seen corresponding path program 1 times [2018-12-08 20:15:47,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:15:47,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:15:47,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:15:47,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:15:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:15:47,623 INFO L87 Difference]: Start difference. First operand 370 states and 433 transitions. Second operand 11 states. [2018-12-08 20:15:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,685 INFO L93 Difference]: Finished difference Result 515 states and 607 transitions. [2018-12-08 20:15:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:15:47,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2018-12-08 20:15:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,686 INFO L225 Difference]: With dead ends: 515 [2018-12-08 20:15:47,686 INFO L226 Difference]: Without dead ends: 366 [2018-12-08 20:15:47,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-12-08 20:15:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-08 20:15:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2018-12-08 20:15:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-12-08 20:15:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 410 transitions. [2018-12-08 20:15:47,709 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 410 transitions. Word has length 104 [2018-12-08 20:15:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,709 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 410 transitions. [2018-12-08 20:15:47,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:15:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 410 transitions. [2018-12-08 20:15:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 20:15:47,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:47,709 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1545373669, now seen corresponding path program 1 times [2018-12-08 20:15:47,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 20:15:47,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:47,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:47,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:47,764 INFO L87 Difference]: Start difference. First operand 353 states and 410 transitions. Second operand 6 states. [2018-12-08 20:15:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,797 INFO L93 Difference]: Finished difference Result 381 states and 437 transitions. [2018-12-08 20:15:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:47,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-08 20:15:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,798 INFO L225 Difference]: With dead ends: 381 [2018-12-08 20:15:47,798 INFO L226 Difference]: Without dead ends: 305 [2018-12-08 20:15:47,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-08 20:15:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2018-12-08 20:15:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-08 20:15:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 270 transitions. [2018-12-08 20:15:47,814 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 270 transitions. Word has length 113 [2018-12-08 20:15:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,814 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 270 transitions. [2018-12-08 20:15:47,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 270 transitions. [2018-12-08 20:15:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-08 20:15:47,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,815 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:47,815 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash 268673567, now seen corresponding path program 1 times [2018-12-08 20:15:47,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 20:15:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:47,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:47,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:47,876 INFO L87 Difference]: Start difference. First operand 243 states and 270 transitions. Second operand 9 states. [2018-12-08 20:15:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:47,935 INFO L93 Difference]: Finished difference Result 316 states and 358 transitions. [2018-12-08 20:15:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:47,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-12-08 20:15:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:47,936 INFO L225 Difference]: With dead ends: 316 [2018-12-08 20:15:47,936 INFO L226 Difference]: Without dead ends: 287 [2018-12-08 20:15:47,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:15:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-08 20:15:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2018-12-08 20:15:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-08 20:15:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2018-12-08 20:15:47,952 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 134 [2018-12-08 20:15:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:47,952 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2018-12-08 20:15:47,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2018-12-08 20:15:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-08 20:15:47,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:47,953 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:47,953 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:47,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash 13585617, now seen corresponding path program 1 times [2018-12-08 20:15:47,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:47,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:47,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:47,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 20:15:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:48,011 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand 9 states. [2018-12-08 20:15:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:48,073 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2018-12-08 20:15:48,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:48,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-12-08 20:15:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:48,074 INFO L225 Difference]: With dead ends: 338 [2018-12-08 20:15:48,074 INFO L226 Difference]: Without dead ends: 267 [2018-12-08 20:15:48,074 INFO L631 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-12-08 20:15:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-08 20:15:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 245. [2018-12-08 20:15:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-08 20:15:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2018-12-08 20:15:48,089 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 135 [2018-12-08 20:15:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:48,090 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2018-12-08 20:15:48,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2018-12-08 20:15:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 20:15:48,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:48,090 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:48,090 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:48,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash -834804230, now seen corresponding path program 1 times [2018-12-08 20:15:48,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:48,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 20:15:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:48,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:15:48,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:15:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:15:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:15:48,119 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand 5 states. [2018-12-08 20:15:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:48,142 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2018-12-08 20:15:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:15:48,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2018-12-08 20:15:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:48,143 INFO L225 Difference]: With dead ends: 281 [2018-12-08 20:15:48,143 INFO L226 Difference]: Without dead ends: 251 [2018-12-08 20:15:48,144 INFO L631 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-12-08 20:15:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-08 20:15:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-12-08 20:15:48,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 20:15:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2018-12-08 20:15:48,159 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 150 [2018-12-08 20:15:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:48,159 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2018-12-08 20:15:48,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:15:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2018-12-08 20:15:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 20:15:48,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:48,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:48,160 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:48,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:48,160 INFO L82 PathProgramCache]: Analyzing trace with hash -653317733, now seen corresponding path program 1 times [2018-12-08 20:15:48,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:48,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:48,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 20:15:48,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:48,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-08 20:15:48,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 20:15:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 20:15:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:15:48,257 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand 15 states. [2018-12-08 20:15:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:48,411 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-12-08 20:15:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 20:15:48,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2018-12-08 20:15:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:48,412 INFO L225 Difference]: With dead ends: 315 [2018-12-08 20:15:48,412 INFO L226 Difference]: Without dead ends: 280 [2018-12-08 20:15:48,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:15:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-08 20:15:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 266. [2018-12-08 20:15:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 20:15:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2018-12-08 20:15:48,444 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 150 [2018-12-08 20:15:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:48,444 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2018-12-08 20:15:48,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 20:15:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2018-12-08 20:15:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 20:15:48,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:48,444 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:48,444 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:48,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1218236339, now seen corresponding path program 1 times [2018-12-08 20:15:48,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:48,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:48,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 20:15:48,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:48,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:15:48,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:15:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:15:48,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:15:48,510 INFO L87 Difference]: Start difference. First operand 266 states and 295 transitions. Second operand 9 states. [2018-12-08 20:15:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:48,559 INFO L93 Difference]: Finished difference Result 355 states and 396 transitions. [2018-12-08 20:15:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:15:48,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-12-08 20:15:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:48,560 INFO L225 Difference]: With dead ends: 355 [2018-12-08 20:15:48,560 INFO L226 Difference]: Without dead ends: 274 [2018-12-08 20:15:48,560 INFO L631 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-12-08 20:15:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-08 20:15:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2018-12-08 20:15:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 20:15:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 294 transitions. [2018-12-08 20:15:48,578 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 294 transitions. Word has length 151 [2018-12-08 20:15:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:48,578 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 294 transitions. [2018-12-08 20:15:48,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:15:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 294 transitions. [2018-12-08 20:15:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-08 20:15:48,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:48,578 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:48,578 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:48,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1765810406, now seen corresponding path program 1 times [2018-12-08 20:15:48,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:48,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 20:15:48,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:15:48,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:15:48,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:48,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:15:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 20:15:48,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:15:48,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2018-12-08 20:15:48,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:15:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:15:48,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:15:48,912 INFO L87 Difference]: Start difference. First operand 266 states and 294 transitions. Second operand 21 states. [2018-12-08 20:15:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:49,071 INFO L93 Difference]: Finished difference Result 311 states and 346 transitions. [2018-12-08 20:15:49,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:15:49,072 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2018-12-08 20:15:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:49,073 INFO L225 Difference]: With dead ends: 311 [2018-12-08 20:15:49,073 INFO L226 Difference]: Without dead ends: 270 [2018-12-08 20:15:49,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-12-08 20:15:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-08 20:15:49,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2018-12-08 20:15:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-08 20:15:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-12-08 20:15:49,093 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 153 [2018-12-08 20:15:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:49,094 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-12-08 20:15:49,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:15:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-12-08 20:15:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-08 20:15:49,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:49,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:49,095 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:49,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash 244162299, now seen corresponding path program 1 times [2018-12-08 20:15:49,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:49,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:49,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:49,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 20:15:49,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:15:49,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:15:49,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:49,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:15:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 20:15:49,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:15:49,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2018-12-08 20:15:49,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:15:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:15:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:15:49,335 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 14 states. [2018-12-08 20:15:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:49,486 INFO L93 Difference]: Finished difference Result 321 states and 350 transitions. [2018-12-08 20:15:49,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:15:49,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2018-12-08 20:15:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:49,488 INFO L225 Difference]: With dead ends: 321 [2018-12-08 20:15:49,488 INFO L226 Difference]: Without dead ends: 246 [2018-12-08 20:15:49,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:15:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-08 20:15:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2018-12-08 20:15:49,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-08 20:15:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-08 20:15:49,507 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 158 [2018-12-08 20:15:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:49,507 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-08 20:15:49,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:15:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-08 20:15:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 20:15:49,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:49,509 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:15:49,509 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:49,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1521484890, now seen corresponding path program 1 times [2018-12-08 20:15:49,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:49,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:49,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:49,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 20:15:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:15:49,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:15:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:15:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:15:49,557 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 6 states. [2018-12-08 20:15:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:49,607 INFO L93 Difference]: Finished difference Result 322 states and 349 transitions. [2018-12-08 20:15:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:15:49,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2018-12-08 20:15:49,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:49,608 INFO L225 Difference]: With dead ends: 322 [2018-12-08 20:15:49,608 INFO L226 Difference]: Without dead ends: 237 [2018-12-08 20:15:49,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:15:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-08 20:15:49,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2018-12-08 20:15:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-08 20:15:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-12-08 20:15:49,636 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 160 [2018-12-08 20:15:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:49,636 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-12-08 20:15:49,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:15:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-12-08 20:15:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 20:15:49,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:49,637 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:49,638 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:49,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1127797900, now seen corresponding path program 1 times [2018-12-08 20:15:49,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:49,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 20:15:49,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:15:49,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:15:49,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:15:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:15:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:15:49,723 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 10 states. [2018-12-08 20:15:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:50,121 INFO L93 Difference]: Finished difference Result 456 states and 493 transitions. [2018-12-08 20:15:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 20:15:50,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-12-08 20:15:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:50,123 INFO L225 Difference]: With dead ends: 456 [2018-12-08 20:15:50,123 INFO L226 Difference]: Without dead ends: 234 [2018-12-08 20:15:50,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2018-12-08 20:15:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-08 20:15:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-12-08 20:15:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-08 20:15:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 248 transitions. [2018-12-08 20:15:50,139 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 248 transitions. Word has length 161 [2018-12-08 20:15:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:50,139 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 248 transitions. [2018-12-08 20:15:50,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:15:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 248 transitions. [2018-12-08 20:15:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 20:15:50,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:15:50,140 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:15:50,141 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:15:50,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:15:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 204630474, now seen corresponding path program 1 times [2018-12-08 20:15:50,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:15:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:15:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:50,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:50,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:15:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 20:15:50,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:15:50,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:15:50,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:15:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:15:50,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:15:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 20:15:50,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:15:50,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2018-12-08 20:15:50,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:15:50,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:15:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:15:50,421 INFO L87 Difference]: Start difference. First operand 231 states and 248 transitions. Second operand 19 states. [2018-12-08 20:15:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:15:51,060 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2018-12-08 20:15:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 20:15:51,060 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2018-12-08 20:15:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:15:51,060 INFO L225 Difference]: With dead ends: 302 [2018-12-08 20:15:51,060 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 20:15:51,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 20:15:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 20:15:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 20:15:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 20:15:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 20:15:51,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2018-12-08 20:15:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:15:51,062 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:15:51,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:15:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:15:51,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 20:15:51,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 20:15:51,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:51,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:15:52,475 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 68 [2018-12-08 20:15:52,613 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-12-08 20:15:52,982 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2018-12-08 20:15:53,138 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 68 [2018-12-08 20:15:53,612 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 71 [2018-12-08 20:15:53,933 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 61 [2018-12-08 20:15:54,043 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2018-12-08 20:15:54,850 WARN L180 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 96 [2018-12-08 20:15:55,064 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-12-08 20:15:55,636 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 104 [2018-12-08 20:15:56,796 WARN L180 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 68 [2018-12-08 20:15:57,182 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 1 [2018-12-08 20:15:57,463 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 95 [2018-12-08 20:15:57,695 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2018-12-08 20:15:57,908 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-12-08 20:15:58,507 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2018-12-08 20:15:58,739 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2018-12-08 20:15:59,345 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2018-12-08 20:16:00,059 WARN L180 SmtUtils]: Spent 711.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-12-08 20:16:00,521 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2018-12-08 20:16:01,190 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 100 [2018-12-08 20:16:01,313 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2018-12-08 20:16:01,951 WARN L180 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 84 [2018-12-08 20:16:02,176 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2018-12-08 20:16:03,398 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 212 DAG size of output: 117 [2018-12-08 20:16:03,699 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2018-12-08 20:16:04,202 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 87 [2018-12-08 20:16:04,438 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2018-12-08 20:16:04,628 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2018-12-08 20:16:05,016 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 89 [2018-12-08 20:16:05,217 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2018-12-08 20:16:05,681 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2018-12-08 20:16:05,962 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-12-08 20:16:06,090 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2018-12-08 20:16:06,216 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-08 20:16:06,489 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 87 [2018-12-08 20:16:06,897 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-12-08 20:16:07,411 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-12-08 20:16:07,658 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2018-12-08 20:16:07,931 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-12-08 20:16:08,446 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 82 [2018-12-08 20:16:08,783 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2018-12-08 20:16:08,963 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-12-08 20:16:09,546 WARN L180 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 68 [2018-12-08 20:16:10,341 WARN L180 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2018-12-08 20:16:11,040 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-12-08 20:16:11,460 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2018-12-08 20:16:12,726 WARN L180 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2018-12-08 20:16:13,424 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 110 [2018-12-08 20:16:13,585 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2018-12-08 20:16:13,736 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2018-12-08 20:16:14,020 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-12-08 20:16:14,255 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-12-08 20:16:14,705 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-12-08 20:16:15,100 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-12-08 20:16:16,781 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 156 DAG size of output: 89 [2018-12-08 20:16:16,950 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-12-08 20:16:17,229 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 63 [2018-12-08 20:16:17,800 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-12-08 20:16:18,439 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2018-12-08 20:16:18,719 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2018-12-08 20:16:19,171 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-08 20:16:19,551 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2018-12-08 20:16:19,836 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 72 [2018-12-08 20:16:19,873 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2018-12-08 20:16:19,873 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2018-12-08 20:16:19,873 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2018-12-08 20:16:19,873 INFO L451 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2018-12-08 20:16:19,873 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 919 926) no Hoare annotation was computed. [2018-12-08 20:16:19,873 INFO L451 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2018-12-08 20:16:19,873 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2018-12-08 20:16:19,873 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 919 926) no Hoare annotation was computed. [2018-12-08 20:16:19,873 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2018-12-08 20:16:19,873 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (< 0 ~MaximumInterfaceType~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L451 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2018-12-08 20:16:19,874 INFO L451 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 940 947) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 940 947) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L444 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2018-12-08 20:16:19,874 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L444 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (<= FloppyPnp_~__cil_tmp30~0 259) (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 259 FloppyPnp_~__cil_tmp30~0) (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,875 INFO L448 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L448 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L448 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L444 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,875 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L444 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,875 INFO L448 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2018-12-08 20:16:19,875 INFO L444 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L444 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 228 418) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 228 418) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L444 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2018-12-08 20:16:19,876 INFO L444 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,877 INFO L444 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse9 (= ~SKIP2~0 ~s~0)) (.cse11 (= 0 ~pended~0)) (.cse12 (= ~DC~0 ~s~0)) (.cse8 (= 0 ~compRegistered~0)) (.cse10 (= ~pended~0 1))) (let ((.cse0 (and .cse12 .cse8 .cse10)) (.cse1 (and (= ~s~0 ~NP~0) .cse8 .cse10)) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (and .cse8 .cse10 (= ~IPC~0 ~s~0))) (.cse4 (and (and .cse12 .cse11) (not (= 259 FloppyPnp_~ntStatus~0)))) (.cse5 (and .cse11 .cse9 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0) (<= ~compRegistered~0 0))) (.cse6 (and .cse8 .cse9 .cse10)) (.cse7 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-12-08 20:16:19,877 INFO L444 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse4 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0))) (.cse5 (<= ~s~0 1)) (.cse6 (<= 1 ~s~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7)) (.cse1 (and (not (= 259 FloppyPnp_~ntStatus~0)) .cse4 .cse5 .cse6 .cse7 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-12-08 20:16:19,877 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2018-12-08 20:16:19,877 INFO L444 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,877 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-12-08 20:16:19,877 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,877 INFO L448 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2018-12-08 20:16:19,877 INFO L444 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= 0 FloppyPnp_~ntStatus~0) (= 0 ~myStatus~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L444 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 (= |old(~s~0)| ~s~0) (= ~pended~0 1))) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L444 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2018-12-08 20:16:19,878 INFO L448 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2018-12-08 20:16:19,879 INFO L444 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,879 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2018-12-08 20:16:19,879 INFO L444 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,879 INFO L444 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,879 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2018-12-08 20:16:19,879 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2018-12-08 20:16:19,879 INFO L444 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse4 (= |old(~s~0)| ~s~0))) (.cse1 (and (= ~s~0 ~NP~0) .cse4 (= ~pended~0 1))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3)))) [2018-12-08 20:16:19,879 INFO L444 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,879 INFO L444 ceAbstractionStarter]: At program point L222(lines 221 420) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0)) (.cse5 (= ~s~0 ~SKIP1~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 .cse5 (= |old(~customIrp~0)| ~customIrp~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and .cse4 (= ~pended~0 1) .cse5)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L444 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2018-12-08 20:16:19,880 INFO L444 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L444 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L444 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (= |old(~s~0)| ~s~0)) (.cse5 (= 0 FloppyPnp_~ntStatus~0)) (.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 .cse2 (= |old(~myStatus~0)| ~myStatus~0) .cse3 .cse4 .cse5) .cse6) (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4 .cse5) .cse6))) [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2018-12-08 20:16:19,881 INFO L444 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2018-12-08 20:16:19,882 INFO L444 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~SKIP1~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2018-12-08 20:16:19,882 INFO L444 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1))) [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2018-12-08 20:16:19,882 INFO L444 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2018-12-08 20:16:19,882 INFO L448 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (let ((.cse5 (< 0 ~MaximumInterfaceType~0)) (.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (and .cse0 .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse5 (and .cse0 .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4) .cse6))) [2018-12-08 20:16:19,883 INFO L444 ceAbstractionStarter]: At program point L704(line 704) the Hoare annotation is: (or (and (= main_~status~1 ~lowerDriverReturn~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 main_~status~1) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L444 ceAbstractionStarter]: At program point L730(lines 729 777) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2018-12-08 20:16:19,883 INFO L444 ceAbstractionStarter]: At program point L747(lines 746 774) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L444 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse8 (= 0 ~pended~0)) (.cse12 (= 0 main_~status~1)) (.cse11 (<= ~compRegistered~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse12) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse12 .cse6 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse12 .cse11) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 748 773) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 748 773) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L448 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2018-12-08 20:16:19,884 INFO L444 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= ~s~0 1)) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 main_~status~1)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-08 20:16:19,885 INFO L444 ceAbstractionStarter]: At program point L740(lines 739 775) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= 0 main_~status~1) (<= ~s~0 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (= 0 ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L444 ceAbstractionStarter]: At program point L825(line 825) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L448 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2018-12-08 20:16:19,885 INFO L444 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,886 INFO L444 ceAbstractionStarter]: At program point L735(lines 734 776) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= 0 main_~status~1)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,886 INFO L444 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse5 (= ~DC~0 ~s~0)) (.cse6 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse1 (and .cse5 .cse6 .cse7 .cse8))) (let ((.cse3 (or .cse1 (and (= main_~status~1 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 (<= ~compRegistered~0 0))))) (let ((.cse4 (= 0 main_~status~1)) (.cse2 (not (= 259 main_~status~1))) (.cse0 (and (<= (+ ~NP~0 2) ~SKIP1~0) (and .cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0))))) (or (and .cse0 (<= (+ main_~status~1 1073741536) 0)) (and .cse1 .cse2) (not (= |old(~myStatus~0)| 0)) (and .cse3 .cse4) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse5 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (and (and (and (<= 1 ~NP~0) .cse0) (<= ~MPR3~0 6)) .cse2) (not (= |old(~compRegistered~0)| 0)) (and (<= ~SKIP2~0 ~s~0) .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse6 .cse7 .cse8 (= ~pended~0 1)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)))))) [2018-12-08 20:16:19,886 INFO L448 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2018-12-08 20:16:19,886 INFO L444 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse7 (= ~pended~0 1)) (.cse5 (= ~SKIP2~0 ~s~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= 0 main_~status~1)) (.cse10 (= ~IPC~0 ~s~0)) (.cse8 (<= ~compRegistered~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) (not (= 259 main_~status~1))) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse5 .cse6 (or (and .cse1 .cse2 .cse3 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse8))) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse7 .cse10) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse9 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse10 .cse8) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-08 20:16:19,886 INFO L448 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2018-12-08 20:16:19,886 INFO L444 ceAbstractionStarter]: At program point L819(line 819) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|)) [2018-12-08 20:16:19,886 INFO L444 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~s~0)) (.cse6 (= ~IPC~0 ~s~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse8 (= 0 ~pended~0)) (.cse12 (= 0 main_~status~1)) (.cse11 (<= ~compRegistered~0 0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse9 (= ~SKIP2~0 ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= ~pended~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (<= (+ ~NP~0 2) ~SKIP1~0) .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse8 .cse12) (and (and .cse0 .cse1 .cse2 .cse8 .cse4) (not (= 259 main_~status~1))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse12 .cse6 .cse11) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse9 .cse10 .cse12 .cse11) (< |old(~MPR3~0)| |old(~s~0)|) (not (= 0 |old(~pended~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-08 20:16:19,887 INFO L448 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2018-12-08 20:16:19,887 INFO L444 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= ~s~0 1)) (.cse5 (<= ~MPR3~0 6)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 6 ~MPR3~0)) (.cse8 (<= (+ ~NP~0 2) ~SKIP1~0)) (.cse9 (= ~s~0 ~NP~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= 0 main_~status~1)) (.cse12 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~myStatus~0)| 0)) (< 0 |old(~MaximumInterfaceType~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (< |old(~MPR3~0)| |old(~s~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ~myStatus~0 1073741637) 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (< |old(~s~0)| |old(~MPR3~0)|))) [2018-12-08 20:16:19,887 INFO L444 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-12-08 20:16:19,887 INFO L448 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2018-12-08 20:16:19,887 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2018-12-08 20:16:19,887 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2018-12-08 20:16:19,887 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2018-12-08 20:16:19,887 INFO L444 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1))) [2018-12-08 20:16:19,887 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-12-08 20:16:19,887 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0))) (.cse1 (< 0 ~MaximumInterfaceType~0))) (and (or (= |old(~s~0)| ~s~0) (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1) (or .cse0 (not (= ~myStatus~0 0)) .cse1 (and (<= 1 ~s~0) (<= ~s~0 1))))) [2018-12-08 20:16:19,888 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2018-12-08 20:16:19,888 INFO L451 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2018-12-08 20:16:19,888 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-12-08 20:16:19,888 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2018-12-08 20:16:19,888 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2018-12-08 20:16:19,888 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2018-12-08 20:16:19,888 INFO L444 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse29 (+ ~DC~0 5)) (.cse32 (+ ~DC~0 2)) (.cse30 (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not .cse30)) (.cse2 (< ~SKIP2~0 .cse32)) (.cse10 (< ~IPC~0 .cse29)) (.cse6 (< ~MPR1~0 .cse31)) (.cse24 (< ~compRegistered~0 1)) (.cse28 (<= 1 ~s~0))) (let ((.cse26 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse28 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse1 (< 6 ~MPR3~0)) (.cse16 (or .cse0 (or .cse8 .cse2 .cse10) .cse6 .cse24)) (.cse19 (< |old(~setEventCalled~0)| 1)) (.cse17 (< ~NP~0 1)) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse5 (and .cse28 (<= ~s~0 1) .cse27)) (.cse15 (or .cse1 .cse16 .cse19 .cse17 .cse20 .cse3 .cse4 .cse21 .cse22)) (.cse7 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= ~myStatus~0 0))) (.cse13 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse25 (and .cse26 .cse27)) (.cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse14 .cse15) (or .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse20 .cse12 .cse21 .cse22) (or .cse5 .cse18 .cse14 .cse15) (or (< ~MPR3~0 (+ ~NP~0 5)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse2 .cse10) (or (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse22) .cse25 .cse18 .cse14) (or .cse13 .cse14 (or (and (= |old(~customIrp~0)| 1) .cse26 (= 0 ~customIrp~0)) .cse25) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse22))))))) [2018-12-08 20:16:19,888 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2018-12-08 20:16:19,888 INFO L444 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse4 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< ~IPC~0 (+ ~DC~0 5))) (.cse0 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< ~compRegistered~0 1))) (let ((.cse5 (< 6 ~MPR3~0)) (.cse20 (or .cse4 (or .cse8 .cse2 .cse3) .cse0 .cse16)) (.cse15 (< |old(~setEventCalled~0)| 1)) (.cse21 (< ~NP~0 1)) (.cse22 (< ~MPR3~0 |old(~s~0)|)) (.cse6 (< ~MPR3~0 6)) (.cse7 (< 1 ~NP~0)) (.cse23 (< |old(~s~0)| ~MPR3~0)) (.cse17 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (not (= ~compRegistered~0 0))) (.cse14 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse10 (< |old(~s~0)| 1)) (.cse18 (not (= ~myStatus~0 0))) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse12 (< 0 (+ ~myStatus~0 1073741637))) (.cse13 (< 0 ~MaximumInterfaceType~0)) (.cse19 (or .cse5 .cse20 .cse15 .cse21 .cse22 .cse6 .cse7 .cse23 .cse17))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse2 .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse11) (or .cse12 .cse13 (or .cse5 .cse14 .cse2 .cse6 .cse7 .cse0 .cse15 .cse8 .cse16 .cse9 .cse3 .cse10 .cse17)) (or .cse18 .cse13 .cse19) (or (or .cse5 .cse14 .cse2 .cse6 .cse7 .cse0 .cse15 .cse8 .cse16 .cse9 .cse3 .cse10 .cse11 .cse17) .cse18 .cse13) (or .cse5 .cse20 .cse15 .cse21 .cse18 .cse22 .cse6 .cse7 .cse11 .cse23 .cse17) (or .cse12 .cse13 .cse19))))) [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1091 1098) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1091 1098) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2018-12-08 20:16:19,889 INFO L444 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse17 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~compRegistered~0 1))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse23 (or .cse17 (or .cse7 .cse2 .cse10) .cse5 .cse8)) (.cse6 (< |old(~setEventCalled~0)| 1)) (.cse24 (< ~NP~0 1)) (.cse25 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse26 (< |old(~s~0)| ~MPR3~0)) (.cse13 (< 1 |old(~setEventCalled~0)|)) (.cse18 (= |old(~customIrp~0)| ~customIrp~0)) (.cse20 (= |old(~s~0)| ~s~0))) (let ((.cse19 (not (= ~compRegistered~0 0))) (.cse16 (and .cse18 (<= 1 ~setEventCalled~0) .cse20 (<= ~setEventCalled~0 1))) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse22 (< 0 (+ ~myStatus~0 1073741637))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse21 (or .cse0 .cse23 .cse6 .cse24 .cse25 .cse3 .cse4 .cse26 .cse13))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse3 .cse4 (and (<= 1 ~s~0) (<= ~s~0 1) .cse18) .cse5 .cse19 .cse7 .cse9 .cse10 .cse11 .cse12) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse19 .cse20 .cse2 .cse10) (or .cse14 .cse15 .cse21) (or .cse22 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (or .cse0 .cse23 .cse6 .cse24 .cse14 .cse25 .cse3 .cse4 .cse12 .cse26 .cse13) (or .cse22 .cse15 .cse21))))) [2018-12-08 20:16:19,889 INFO L448 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2018-12-08 20:16:19,890 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse22 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse7 (not (= 0 ~pended~0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (< ~compRegistered~0 1))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse24 (or .cse22 (or .cse7 .cse2 .cse10) .cse5 .cse8)) (.cse6 (< |old(~setEventCalled~0)| 1)) (.cse25 (< ~NP~0 1)) (.cse26 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse27 (< |old(~s~0)| ~MPR3~0)) (.cse13 (< 1 |old(~setEventCalled~0)|)) (.cse23 (= |old(~customIrp~0)| ~customIrp~0)) (.cse28 (<= 1 ~setEventCalled~0)) (.cse18 (= |old(~s~0)| ~s~0)) (.cse29 (<= ~setEventCalled~0 1))) (let ((.cse17 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse19 (< 0 (+ ~myStatus~0 1073741637))) (.cse16 (and .cse23 .cse28 .cse18 .cse29)) (.cse1 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1)) (.cse14 (not (= ~myStatus~0 0))) (.cse15 (< 0 ~MaximumInterfaceType~0)) (.cse21 (or .cse0 .cse24 .cse6 .cse25 .cse26 .cse3 .cse4 .cse27 .cse13)) (.cse20 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse23 .cse28 .cse29))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse17 .cse2 .cse18 .cse10) (or .cse19 .cse20 .cse15 .cse21) (or .cse22 .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse23) .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse24 .cse25 .cse14 .cse3 .cse4 .cse20 .cse6 .cse26 .cse12 .cse27 .cse13) (or .cse19 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (or .cse14 .cse15 .cse21 .cse20))))) [2018-12-08 20:16:19,890 INFO L444 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse31 (+ ~SKIP1~0 2)) (.cse29 (+ ~DC~0 5)) (.cse32 (+ ~DC~0 2)) (.cse30 (= 0 ~pended~0))) (let ((.cse0 (< ~SKIP1~0 (+ ~NP~0 2))) (.cse8 (not .cse30)) (.cse2 (< ~SKIP2~0 .cse32)) (.cse10 (< ~IPC~0 .cse29)) (.cse6 (< ~MPR1~0 .cse31)) (.cse24 (< ~compRegistered~0 1)) (.cse28 (<= 1 ~s~0))) (let ((.cse26 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~MPR1~0) (<= 1 ~compRegistered~0) .cse28 (<= ~s~0 ~NP~0) (<= .cse32 ~SKIP2~0) (<= ~NP~0 1) (= ~NP~0 |old(~s~0)|) (<= ~MPR3~0 6) (<= (+ ~s~0 2) ~SKIP1~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) (<= 6 ~MPR3~0))) (.cse1 (< 6 ~MPR3~0)) (.cse16 (or .cse0 (or .cse8 .cse2 .cse10) .cse6 .cse24)) (.cse19 (< |old(~setEventCalled~0)| 1)) (.cse17 (< ~NP~0 1)) (.cse20 (< ~MPR3~0 |old(~s~0)|)) (.cse3 (< ~MPR3~0 6)) (.cse4 (< 1 ~NP~0)) (.cse21 (< |old(~s~0)| ~MPR3~0)) (.cse22 (< 1 |old(~setEventCalled~0)|)) (.cse27 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse5 (and .cse28 (<= ~s~0 1) .cse27)) (.cse15 (or .cse1 .cse16 .cse19 .cse17 .cse20 .cse3 .cse4 .cse21 .cse22)) (.cse7 (not (= ~compRegistered~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (= ~myStatus~0 0))) (.cse13 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< 0 ~MaximumInterfaceType~0)) (.cse25 (and .cse26 .cse27)) (.cse23 (< ~SKIP1~0 (+ |old(~s~0)| 2))) (.cse9 (< ~NP~0 |old(~s~0)|)) (.cse11 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse5 .cse14 .cse15) (or .cse1 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse20 .cse12 .cse21 .cse22) (or .cse5 .cse18 .cse14 .cse15) (or (< ~MPR3~0 (+ ~NP~0 5)) (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse2 .cse10) (or (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse22) .cse25 .cse18 .cse14) (or .cse13 .cse14 (or (and (= |old(~customIrp~0)| 1) .cse26 (= 0 ~customIrp~0)) .cse25) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse24 .cse9 .cse10 .cse11 .cse22))))))) [2018-12-08 20:16:19,892 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse0 (= ~s~0 ~NP~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse3 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse4) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) .cse5 (< 1 ~NP~0) (< |old(~s~0)| 1)) (= |old(~s~0)| ~s~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse1 .cse0 .cse2 .cse5 .cse4))) [2018-12-08 20:16:19,892 INFO L444 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse0 (not (= 0 ~pended~0))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (= ~compRegistered~0 0))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse1 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse1) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1)) (or .cse3 .cse4 .cse0) (or (< ~MPR3~0 (+ ~NP~0 5)) (not (= 1 ~pended~0)) .cse3 .cse4 .cse2 .cse1))) [2018-12-08 20:16:19,892 INFO L448 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2018-12-08 20:16:19,892 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2018-12-08 20:16:19,892 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2018-12-08 20:16:19,892 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2018-12-08 20:16:19,892 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2018-12-08 20:16:19,897 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (let ((.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and .cse1 (= |old(~myStatus~0)| ~myStatus~0) .cse2 .cse3 .cse4) .cse5) (or (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) (not (= |old(~myStatus~0)| 0)) .cse0 .cse5))) [2018-12-08 20:16:19,897 INFO L444 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (<= 1 ~compRegistered~0)) (.cse2 (<= 1 ~s~0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) .cse3 .cse4) .cse5) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 (and (= |old(~myStatus~0)| ~myStatus~0) .cse1 .cse2 .cse3 .cse4) .cse5))) [2018-12-08 20:16:19,898 INFO L448 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2018-12-08 20:16:19,898 INFO L444 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,898 INFO L448 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2018-12-08 20:16:19,898 INFO L444 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-08 20:16:19,898 INFO L448 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2018-12-08 20:16:19,898 INFO L444 ceAbstractionStarter]: At program point L549-2(lines 549 565) the Hoare annotation is: (let ((.cse0 (and (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1))) (<= 0 FloppyStartDevice_~InterfaceType~0))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2018-12-08 20:16:19,898 INFO L444 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,903 INFO L444 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (let ((.cse2 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (let ((.cse4 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (.cse5 (= |old(~customIrp~0)| ~customIrp~0))) (or (and (and .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5) (and (<= FloppyStartDevice_~__cil_tmp42~0 259) (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse4 .cse5)))) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse3 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 (and .cse1 .cse2) .cse3) (or (and .cse2 .cse1) (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse3))) [2018-12-08 20:16:19,903 INFO L444 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2018-12-08 20:16:19,903 INFO L444 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse0 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2018-12-08 20:16:19,903 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2018-12-08 20:16:19,904 INFO L448 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2018-12-08 20:16:19,904 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2018-12-08 20:16:19,908 INFO L444 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,908 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2018-12-08 20:16:19,908 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2018-12-08 20:16:19,908 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2018-12-08 20:16:19,908 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-12-08 20:16:19,908 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2018-12-08 20:16:19,909 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2018-12-08 20:16:19,909 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2018-12-08 20:16:19,909 INFO L444 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse9 (<= ~MPR3~0 ~s~0)) (.cse10 (<= ~s~0 ~MPR3~0)) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (= |old(~s~0)| ~s~0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse6 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse7 (<= ~setEventCalled~0 1)) (.cse11 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0))) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 (and .cse0 .cse4 .cse9 .cse10 .cse5 .cse6 .cse1 .cse2 .cse7) .cse11)) (let ((.cse12 (= 0 ~myStatus~0))) (or (and .cse4 .cse9 .cse10 .cse5 .cse12 .cse6 .cse1 .cse2 .cse7) (not (= |old(~myStatus~0)| 0)) .cse8 (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse11)))) [2018-12-08 20:16:19,909 INFO L448 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2018-12-08 20:16:19,909 INFO L448 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2018-12-08 20:16:19,909 INFO L444 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2))) [2018-12-08 20:16:19,909 INFO L444 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= 259 FloppyStartDevice_~ntStatus~1)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,913 INFO L448 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2018-12-08 20:16:19,913 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L444 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse1 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1))) [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L451 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L451 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1135 1142) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1135 1142) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2018-12-08 20:16:19,914 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2018-12-08 20:16:19,914 INFO L451 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2018-12-08 20:16:19,915 INFO L451 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2018-12-08 20:16:19,915 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2018-12-08 20:16:19,915 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1113 1120) no Hoare annotation was computed. [2018-12-08 20:16:19,915 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1113 1120) no Hoare annotation was computed. [2018-12-08 20:16:19,915 INFO L448 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 853 860) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ ~s~0 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 ~s~0) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~s~0 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2))) [2018-12-08 20:16:19,922 INFO L451 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2018-12-08 20:16:19,922 INFO L451 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 853 860) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2018-12-08 20:16:19,922 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2018-12-08 20:16:19,923 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (let ((.cse1 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0))) (.cse0 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or (< ~SKIP1~0 (+ ~NP~0 2)) (< 6 ~MPR3~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~MPR3~0 6) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0 .cse1 .cse2) (or .cse1 (not (= ~myStatus~0 0)) .cse0 .cse2))) [2018-12-08 20:16:19,923 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2018-12-08 20:16:19,923 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2018-12-08 20:16:19,923 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2018-12-08 20:16:19,923 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2018-12-08 20:16:19,923 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2018-12-08 20:16:19,923 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2018-12-08 20:16:19,923 INFO L444 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0)) (.cse7 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0))) (.cse8 (< 0 ~MaximumInterfaceType~0)) (.cse9 (or .cse10 .cse11 .cse13))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse7 .cse13 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6) (or .cse7 .cse12 .cse8 .cse9))))) [2018-12-08 20:16:19,929 INFO L444 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= 0 ~pended~0))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse11 (< 6 ~MPR3~0)) (.cse12 (or (or .cse5 .cse8 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse10) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse9 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (or .cse11 .cse12 .cse13)) (.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (not (= ~myStatus~0 0))) (.cse3 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= 1 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= ~s~0 1) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse3 .cse2) (or .cse4 (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse11 .cse12 .cse0 .cse13 .cse3 (not (= ~customIrp~0 0))))))) [2018-12-08 20:16:19,929 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2018-12-08 20:16:19,929 INFO L448 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2018-12-08 20:16:19,930 INFO L444 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse10 .cse11 .cse13)) (.cse9 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse9 .cse13 (not (= ~customIrp~0 0))) (or .cse12 .cse7 .cse8 .cse9) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6))))) [2018-12-08 20:16:19,935 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse4 (< ~MPR1~0 .cse19)) (.cse6 (not .cse17)) (.cse7 (< ~IPC~0 .cse16)) (.cse3 (< ~SKIP2~0 .cse18))) (let ((.cse0 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse8 (< 6 ~MPR3~0)) (.cse9 (or (or .cse4 .cse6 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse7) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse3 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse11 (< ~MPR3~0 6))) (let ((.cse10 (not (= ~myStatus~0 0))) (.cse13 (< 0 ~MaximumInterfaceType~0)) (.cse14 (or .cse8 .cse9 .cse11)) (.cse12 (and (<= ~s~0 1) (and (<= .cse0 ~SKIP1~0) (<= .cse16 ~IPC~0) (<= .cse15 ~MPR3~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0))) (.cse1 (< ~MPR3~0 .cse15)) (.cse5 (not (= ~compRegistered~0 0))) (.cse2 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 .cse0) .cse1 .cse2 .cse3 (< ~SKIP1~0 |old(~s~0)|) .cse4 (< |old(~s~0)| ~SKIP1~0) .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 (not (= ~customIrp~0 0)) .cse12) (or .cse10 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse13 .cse14 .cse12) (or .cse1 (not (= 1 ~pended~0)) .cse4 .cse5 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3 .cse7)))))) [2018-12-08 20:16:19,936 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2018-12-08 20:16:19,936 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2018-12-08 20:16:19,936 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2018-12-08 20:16:19,936 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2018-12-08 20:16:19,936 INFO L444 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse31 (+ ~DC~0 2)) (.cse29 (+ ~DC~0 5)) (.cse30 (= 0 ~pended~0)) (.cse28 (+ ~SKIP1~0 2)) (.cse32 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse3 (= ~MPR1~0 ~s~0)) (.cse4 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse32) 3221225494))) (.cse5 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse6 (<= (+ .cse32 1) 0)) (.cse12 (+ ~NP~0 2)) (.cse8 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse16 (< ~MPR1~0 .cse28)) (.cse18 (not .cse30)) (.cse19 (< ~IPC~0 .cse29)) (.cse15 (< ~SKIP2~0 .cse31))) (let ((.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse16 .cse18 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse19) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse15 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse11 (< ~MPR3~0 6)) (.cse10 (and (let ((.cse23 (<= .cse12 ~SKIP1~0)) (.cse24 (and (<= .cse29 ~IPC~0) .cse30 (<= .cse31 ~SKIP2~0))) (.cse25 (<= .cse28 ~MPR1~0)) (.cse26 (<= 1 ~compRegistered~0)) (.cse27 (= ~NP~0 |old(~s~0)|))) (or (and .cse23 .cse3 .cse24 .cse4 (= 0 IofCallDriver_~returnVal2~0) .cse25 .cse26 .cse5 .cse6 .cse27) (and .cse23 .cse3 .cse24 .cse4 .cse25 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse26 .cse5 .cse6 .cse27))) .cse8 .cse9))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse7 (= IofCallDriver_~returnVal2~0 259)) (.cse21 (< 0 ~MaximumInterfaceType~0)) (.cse20 (and .cse10 (<= ~MaximumInterfaceType~0 0))) (.cse22 (or .cse0 .cse1 .cse11)) (.cse13 (< ~MPR3~0 (+ ~NP~0 5))) (.cse17 (not (= ~compRegistered~0 0))) (.cse14 (= ~s~0 ~SKIP1~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 (not (= ~customIrp~0 0))) (or (< ~SKIP1~0 .cse12) .cse13 .cse14 .cse15 (< ~SKIP1~0 |old(~s~0)|) .cse16 (< |old(~s~0)| ~SKIP1~0) .cse17 .cse18 .cse19) (or .cse20 (and (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) .cse7) (< 0 (+ ~myStatus~0 1073741637)) .cse21 .cse22) (or .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9) .cse21 .cse20 .cse22) (or .cse13 (not (= 1 ~pended~0)) .cse16 .cse17 .cse14 (not (= ~SKIP1~0 |old(~s~0)|)) .cse15 .cse19)))))) [2018-12-08 20:16:19,943 INFO L444 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse18 (+ ~DC~0 2)) (.cse16 (+ ~DC~0 5)) (.cse17 (= 0 ~pended~0)) (.cse19 (+ ~SKIP1~0 2))) (let ((.cse9 (< ~MPR1~0 .cse19)) (.cse12 (not .cse17)) (.cse14 (< ~IPC~0 .cse16)) (.cse13 (< ~SKIP2~0 .cse18))) (let ((.cse7 (+ ~NP~0 2)) (.cse15 (+ ~NP~0 5)) (.cse0 (< 6 ~MPR3~0)) (.cse1 (or (or .cse9 .cse12 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse14) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse13 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse3 (< ~MPR3~0 6))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse5 (< 0 ~MaximumInterfaceType~0)) (.cse6 (or .cse0 .cse1 .cse3)) (.cse4 (and (<= ~s~0 1) (and (<= .cse7 ~SKIP1~0) (<= .cse16 ~IPC~0) (<= .cse15 ~MPR3~0) .cse17 (= ~s~0 ~NP~0) (<= .cse18 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse19 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0))) (.cse8 (< ~MPR3~0 .cse15)) (.cse10 (not (= ~compRegistered~0 0))) (.cse11 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~customIrp~0 0)) .cse4) (or .cse2 .cse4 .cse5 .cse6) (or (< ~SKIP1~0 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (< 0 (+ ~myStatus~0 1073741637)) .cse5 .cse6 .cse4) (or .cse8 (not (= 1 ~pended~0)) .cse9 .cse10 .cse11 .cse13 .cse14)))))) [2018-12-08 20:16:19,943 INFO L448 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2018-12-08 20:16:19,943 INFO L444 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse10 (< 6 ~MPR3~0)) (.cse11 (or (or .cse3 .cse5 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse2 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse13 (< ~MPR3~0 6))) (let ((.cse12 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse10 .cse11 .cse13)) (.cse9 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse4 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 ~SKIP1~0))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 (< ~SKIP1~0 |old(~s~0)|) .cse3 (< |old(~s~0)| ~SKIP1~0) .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse9 .cse13 (not (= ~customIrp~0 0))) (or .cse12 .cse7 .cse8 .cse9) (or .cse0 (not (= 1 ~pended~0)) .cse3 .cse4 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 .cse6))))) [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 997 1009) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 997 1009) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L444 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (not (= 0 ~pended~0))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2)))) (let ((.cse9 (< 6 ~MPR3~0)) (.cse10 (or (or .cse1 .cse4 (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) .cse6) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse5 (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse12 (< ~MPR3~0 6))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (not (= ~compRegistered~0 0))) (.cse3 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse11 (not (= ~myStatus~0 0))) (.cse7 (< 0 ~MaximumInterfaceType~0)) (.cse8 (or .cse9 .cse10 .cse12))) (and (or (< ~SKIP1~0 (+ ~NP~0 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0))) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse5 .cse6) (or .cse11 .cse7 .cse8))))) [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2018-12-08 20:16:19,948 INFO L444 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-12-08 20:16:19,949 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2018-12-08 20:16:19,949 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2018-12-08 20:16:19,949 INFO L444 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-12-08 20:16:19,952 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2018-12-08 20:16:19,952 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2018-12-08 20:16:19,952 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2018-12-08 20:16:19,952 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2018-12-08 20:16:19,952 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L444 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (and .cse0 (= FlQueueIrpToThread_~status~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1))) [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L444 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 0 ~pended~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 ~s~0) (< ~IPC~0 (+ ~DC~0 5)) (< ~s~0 1)) [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L444 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point $Ultimate##38(lines 1400 1526) no Hoare annotation was computed. [2018-12-08 20:16:19,953 INFO L448 ceAbstractionStarter]: For program point $Ultimate##37(lines 1400 1526) no Hoare annotation was computed. [2018-12-08 20:16:19,957 INFO L444 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,957 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2018-12-08 20:16:19,957 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2018-12-08 20:16:19,957 INFO L444 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,957 INFO L444 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,957 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2018-12-08 20:16:19,957 INFO L444 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,957 INFO L448 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2018-12-08 20:16:19,957 INFO L444 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,957 INFO L448 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2018-12-08 20:16:19,957 INFO L444 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,957 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2018-12-08 20:16:19,958 INFO L448 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2018-12-08 20:16:19,958 INFO L444 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,958 INFO L444 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse2 (+ ~DC~0 2))) (let ((.cse0 (and (= 0 ~pended~0) .cse1 (<= .cse2 ~SKIP2~0)))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= FloppyDeviceControl_~__cil_tmp91~0 FloppyDeviceControl_~ntStatus~3) .cse0) (and .cse1 (= ~pended~0 1)) (< ~SKIP2~0 .cse2) (< 1 ~NP~0) (and (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0) .cse0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)))) [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L444 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L444 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (= ~pended~0 1)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (not (= 259 FloppyDeviceControl_~ntStatus~3)) (= 0 ~pended~0) .cse0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1))) [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2018-12-08 20:16:19,964 INFO L448 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L444 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2018-12-08 20:16:19,965 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L444 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L444 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= ~s~0 ~SKIP1~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L444 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2018-12-08 20:16:19,967 INFO L448 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2018-12-08 20:16:19,968 INFO L444 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< ~MPR1~0 (+ ~SKIP1~0 2)) (and (= 0 ~pended~0) (<= 1 ~s~0) (<= ~s~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~NP~0 |old(~s~0)|) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1)) [2018-12-08 20:16:19,968 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2018-12-08 20:16:19,968 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2018-12-08 20:16:19,968 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2018-12-08 20:16:19,968 INFO L448 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2018-12-08 20:16:19,968 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2018-12-08 20:16:19,968 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L444 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L444 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2018-12-08 20:16:19,972 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2018-12-08 20:16:19,973 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2018-12-08 20:16:19,973 INFO L444 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (< ~SKIP1~0 (+ ~NP~0 2)) (< ~MPR3~0 (+ ~NP~0 5)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) [2018-12-08 20:16:19,973 INFO L448 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2018-12-08 20:16:19,973 INFO L448 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2018-12-08 20:16:19,973 INFO L448 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2018-12-08 20:16:19,973 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2018-12-08 20:16:19,973 INFO L444 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse3 (<= 1 ~setEventCalled~0)) (.cse4 (= 259 FlFdcDeviceIo_~__cil_tmp11~0)) (.cse5 (<= ~setEventCalled~0 1))) (let ((.cse0 (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= 0 ~pended~0)) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 (+ ~DC~0 5))) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse3 .cse4 .cse5))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) (and (<= 1 ~s~0) (<= ~s~0 1) .cse3 .cse4 .cse5) .cse1 .cse2)))) [2018-12-08 20:16:19,974 INFO L448 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2018-12-08 20:16:19,974 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2018-12-08 20:16:19,974 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-12-08 20:16:19,974 INFO L448 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2018-12-08 20:16:19,975 INFO L444 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse2 (< 0 ~MaximumInterfaceType~0)) (.cse1 (and (<= ~s~0 1) (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (<= 1 ~s~0)))) (and (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse2 .cse1)))) [2018-12-08 20:16:19,975 INFO L448 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2018-12-08 20:16:19,975 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2018-12-08 20:16:19,975 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2018-12-08 20:16:19,975 INFO L444 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (let ((.cse6 (+ ~SKIP1~0 2)) (.cse4 (= 0 ~pended~0)) (.cse3 (+ ~DC~0 5)) (.cse5 (+ ~DC~0 2))) (let ((.cse0 (or (or (< ~MPR1~0 .cse6) (not .cse4) (< ~SKIP1~0 (+ |old(~s~0)| 2)) (< ~compRegistered~0 1) (< ~IPC~0 .cse3)) (< 6 ~MPR3~0) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR3~0 6) (< ~SKIP2~0 .cse5) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) (.cse1 (< 0 ~MaximumInterfaceType~0)) (.cse2 (and (and (<= (+ ~NP~0 2) ~SKIP1~0) (<= .cse3 ~IPC~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 (= ~s~0 ~NP~0) (<= .cse5 ~SKIP2~0) (= |old(~s~0)| ~s~0) (<= .cse6 ~MPR1~0) (<= 1 ~compRegistered~0)) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2)))) [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (<= ~MPR3~0 ~s~0) (= ~DC~0 ~s~0) (<= ~s~0 ~MPR3~0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (<= ~MaximumInterfaceType~0 0)) [2018-12-08 20:16:19,979 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L451 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2018-12-08 20:16:19,979 INFO L451 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 897 904) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2018-12-08 20:16:19,979 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 897 904) no Hoare annotation was computed. [2018-12-08 20:16:19,980 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2018-12-08 20:16:19,980 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2018-12-08 20:16:19,980 INFO L451 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2018-12-08 20:16:19,980 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2018-12-08 20:16:19,985 INFO L451 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2018-12-08 20:16:19,985 INFO L448 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2018-12-08 20:16:19,985 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 874 881) no Hoare annotation was computed. [2018-12-08 20:16:19,985 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 874 881) no Hoare annotation was computed. [2018-12-08 20:16:19,985 INFO L451 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2018-12-08 20:16:19,985 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2018-12-08 20:16:19,985 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2018-12-08 20:16:19,985 INFO L448 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2018-12-08 20:16:19,986 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 1156 1163) no Hoare annotation was computed. [2018-12-08 20:16:19,986 INFO L451 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2018-12-08 20:16:19,986 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2018-12-08 20:16:19,986 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 1156 1163) no Hoare annotation was computed. [2018-12-08 20:16:20,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:16:20 BoogieIcfgContainer [2018-12-08 20:16:20,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:16:20,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:16:20,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:16:20,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:16:20,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:15:36" (3/4) ... [2018-12-08 20:16:20,044 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-08 20:16:20,051 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-12-08 20:16:20,052 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-12-08 20:16:20,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-12-08 20:16:20,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-12-08 20:16:20,053 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-12-08 20:16:20,067 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2018-12-08 20:16:20,069 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2018-12-08 20:16:20,070 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 20:16:20,072 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-08 20:16:20,099 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,099 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,099 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((SKIP2 == s && SKIP1 + 2 <= MPR1) && (((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,099 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(myStatus) == 0)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || (((1 <= NP && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,100 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((DC == s && 0 == compRegistered) && pended == 1) || 0 < \old(myStatus) + 1073741637) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((((((DC == s && 0 == compRegistered) && pended == 1) || !(\old(myStatus) == 0)) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-12-08 20:16:20,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-12-08 20:16:20,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) [2018-12-08 20:16:20,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 1 < NP) || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5)) && (((((((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && ((((!(myStatus == 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && returnVal2 == 259) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-08 20:16:20,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,103 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || \old(s) == s) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled)) [2018-12-08 20:16:20,103 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-08 20:16:20,103 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-12-08 20:16:20,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || (((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) [2018-12-08 20:16:20,104 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,106 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) [2018-12-08 20:16:20,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,108 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,109 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && \old(s) == s)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 [2018-12-08 20:16:20,198 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_824f0aa7-f8db-4f44-8b83-2543b66c3abc/bin-2019/uautomizer/witness.graphml [2018-12-08 20:16:20,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:16:20,199 INFO L168 Benchmark]: Toolchain (without parser) took 44525.90 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 817.4 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -389.6 MB). Peak memory consumption was 427.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:16:20,199 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:16:20,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:16:20,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:16:20,200 INFO L168 Benchmark]: Boogie Preprocessor took 40.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:16:20,200 INFO L168 Benchmark]: RCFGBuilder took 550.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.4 MB in the end (delta: 112.5 MB). Peak memory consumption was 112.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:16:20,200 INFO L168 Benchmark]: TraceAbstraction took 43415.82 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 713.6 MB). Free memory was 959.9 MB in the beginning and 1.4 GB in the end (delta: -426.5 MB). Peak memory consumption was 973.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:16:20,200 INFO L168 Benchmark]: Witness Printer took 158.91 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2018-12-08 20:16:20,202 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 550.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.4 MB in the end (delta: 112.5 MB). Peak memory consumption was 112.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43415.82 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 713.6 MB). Free memory was 959.9 MB in the beginning and 1.4 GB in the end (delta: -426.5 MB). Peak memory consumption was 973.6 MB. Max. memory is 11.5 GB. * Witness Printer took 158.91 ms. Allocated memory is still 1.8 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: 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: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && 0 == myStatus) && s <= 1) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && 1 <= s) && s <= 1) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && NP + 2 <= SKIP1) && s == NP) && SKIP1 + 2 <= MPR1) && 0 == status) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || (((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) && 0 <= InterfaceType) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 729]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1) && \old(customIrp) == customIrp) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((((((NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(myStatus) == 0)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && 0 == status)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || (((1 <= NP && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && MPR3 <= 6) && !(259 == status))) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && NP + 2 <= SKIP1 && ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) || ((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((s == NP && 1 <= compRegistered) && !(259 == ntStatus))) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && \old(s) == s)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && \old(myStatus) == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || (((((0 == pended && 0 == compRegistered) && 0 == myStatus) && \old(customIrp) == customIrp) && \old(s) == s) && 0 == ntStatus)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || ((((((((((NP + 2 <= SKIP1 && DC + 5 <= IPC) && 0 == pended) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && 0 == status) && s <= NP) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) && ((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || \old(s) == s) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((!(myStatus == 0) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && \old(s) == s) && setEventCalled <= 1)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && ((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && ((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || (((0 == pended && 0 == compRegistered) && 1 <= s) && s <= 1)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || 0 <= status) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: (((((((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0)) && (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5)) && (((((((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259)) || 0 < myStatus + 1073741637) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && ((((!(myStatus == 0) || ((((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && returnVal2 == 259) && setEventCalled <= 1)) || 0 < MaximumInterfaceType) || (((((((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s)) || (((((((((NP + 2 <= SKIP1 && MPR1 == s) && (DC + 5 <= IPC && 0 == pended) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && NP == \old(s))) && 1 <= setEventCalled) && setEventCalled <= 1) && MaximumInterfaceType <= 0)) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6)) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && !(259 == status)) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (DC == s && 0 == status)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((SKIP2 == s && SKIP1 + 2 <= MPR1) && (((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && compRegistered <= 0) || (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && compRegistered <= 0)))) || ((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1)) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 936]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || (((0 == pended && s == NP) && 0 == compRegistered) && 0 == status)) || \old(MPR3) < \old(s)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) || !(\old(myStatus) == 0)) || 0 < \old(MaximumInterfaceType)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && pended == 1) && IPC == s)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && NP + 2 <= SKIP1) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((DC == s && 0 == pended) && 0 == status)) || (((((DC == s && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && !(259 == status))) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && 0 == status) && IPC == s) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && 0 == status) && compRegistered <= 0)) || \old(MPR3) < \old(s)) || !(0 == \old(pended))) || ((((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && pended == 1)) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || \old(s) < \old(MPR3) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: ((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (s == NP && pended == 1)) || SKIP2 < DC + 2) || 1 < NP) || ((!(259 == ntStatus) && 0 == pended) && s == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || s == SKIP1) || SKIP2 < DC + 2) || SKIP1 < \old(s)) || MPR1 < SKIP1 + 2) || \old(s) < SKIP1) || !(compRegistered == 0)) || !(0 == pended)) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || !(myStatus == 0)) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR3 < 6) || !(customIrp == 0))) && (((!(myStatus == 0) || 0 < MaximumInterfaceType) || (6 < MPR3 || ((((((((MPR1 < SKIP1 + 2 || !(0 == pended)) || SKIP1 < \old(s) + 2) || compRegistered < 1) || IPC < DC + 5) || NP < 1) || 1 < \old(s)) || SKIP2 < DC + 2) || 1 < NP) || \old(s) < 1) || MPR3 < 6) || (((((MPR1 == s && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((MPR3 < NP + 5 || !(1 == pended)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || s == SKIP1) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: (((((((((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < myStatus + 1073741637 || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || NP < 1) || !(myStatus == 0)) || MPR3 < 6) || 1 < NP) || \old(setEventCalled) < 1) || ((1 <= s && s <= 1) && \old(customIrp) == customIrp)) || MPR3 < \old(s)) || !(\old(customIrp) == 0)) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((1 <= s && s <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || 0 < MaximumInterfaceType) || (((((((6 < MPR3 || ((SKIP1 < NP + 2 || (!(0 == pended) || SKIP2 < DC + 2) || IPC < DC + 5) || MPR1 < SKIP1 + 2) || compRegistered < 1) || \old(setEventCalled) < 1) || NP < 1) || MPR3 < \old(s)) || MPR3 < 6) || 1 < NP) || \old(s) < MPR3) || 1 < \old(setEventCalled))) && (((((((MPR3 < NP + 5 || s == NP) || !(1 == pended)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) || 1 < \old(setEventCalled)) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(myStatus == 0)) || 0 < MaximumInterfaceType)) && (((0 < myStatus + 1073741637 || 0 < MaximumInterfaceType) || ((\old(customIrp) == 1 && ((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && NP == \old(s)) && MPR3 <= 6) && s + 2 <= SKIP1) && 1 <= setEventCalled) && setEventCalled <= 1) && 6 <= MPR3) && \old(customIrp) == customIrp)) || (((((((((((6 < MPR3 || SKIP1 < \old(s) + 2) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || !(0 == pended)) || compRegistered < 1) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((((((0 == pended && 0 == compRegistered) && 1 <= s) && 0 == ntStatus) && 0 == myStatus) && s <= 1) && \old(customIrp) == customIrp)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((0 < \old(myStatus) + 1073741637 || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((!(\old(myStatus) == 0) || 0 < MaximumInterfaceType) || ((0 == pended && 0 == compRegistered) && \old(s) == s)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || ((0 == pended && 1 <= s) && s <= 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((DC == s && 0 == compRegistered) && pended == 1) || 0 < \old(myStatus) + 1073741637) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && ((((((((((DC == s && 0 == compRegistered) && pended == 1) || !(\old(myStatus) == 0)) || ((s == NP && 0 == compRegistered) && pended == 1)) || 0 < MaximumInterfaceType) || ((0 == compRegistered && pended == 1) && IPC == s)) || ((DC == s && 0 == pended) && !(259 == ntStatus))) || (((0 == pended && SKIP2 == s) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == compRegistered && SKIP2 == s) && pended == 1)) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: (((((((((SKIP1 < NP + 2 || MPR3 < NP + 5) || (0 == pended && s == NP)) || SKIP2 < DC + 2) || 1 < NP) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == \old(pended))) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1 - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || !(\old(myStatus) == 0)) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((s == NP && 1 <= compRegistered) && !(259 == ntStatus)) || 0 < \old(myStatus) + 1073741637) || 0 < MaximumInterfaceType) || ((((((((((SKIP1 < NP + 2 || 6 < MPR3) || SKIP2 < DC + 2) || MPR3 < 6) || 1 < NP) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == pended)) || NP < \old(s)) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 29 procedures, 415 locations, 1 error locations. SAFE Result, 43.3s OverallTime, 65 OverallIterations, 2 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 28.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 25811 SDtfs, 11360 SDslu, 82257 SDs, 0 SdLazy, 10961 SolverSat, 2048 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 624 SyntacticMatches, 17 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=966occurred in iteration=19, 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: 1.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 2002 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2114 PreInvPairs, 2425 NumberOfFragments, 19233 HoareAnnotationTreeSize, 2114 FomulaSimplifications, 221365 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 142 FomulaSimplificationsInter, 441516 FormulaSimplificationTreeSizeReductionInter, 27.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 5218 NumberOfCodeBlocks, 5218 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 5150 ConstructedInterpolants, 0 QuantifiedInterpolants, 832876 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3755 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 68 InterpolantComputations, 65 PerfectInterpolantSequences, 349/358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...