./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/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 564a601a6273fd55bda5923edf4b35a694c899ec ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:39:48,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:39:48,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:39:48,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:39:48,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:39:48,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:39:48,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:39:48,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:39:48,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:39:48,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:39:48,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:39:48,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:39:48,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:39:48,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:39:48,600 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:39:48,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:39:48,601 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:39:48,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:39:48,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:39:48,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:39:48,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:39:48,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:39:48,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:39:48,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:39:48,609 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:39:48,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:39:48,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:39:48,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:39:48,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:39:48,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:39:48,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:39:48,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:39:48,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:39:48,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:39:48,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:39:48,614 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:39:48,615 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 11:39:48,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:39:48,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:39:48,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:39:48,622 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 11:39:48,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:39:48,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:39:48,623 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:39:48,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:39:48,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:39:48,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:39:48,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:39:48,625 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:39:48,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:39:48,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:39:48,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:39:48,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:39:48,626 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:39:48,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:39:48,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:39:48,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:39:48,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:39:48,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:39:48,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:39:48,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:39:48,627 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_71399e31-1459-47fd-a834-b810542b204a/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 -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-11-18 11:39:48,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:39:48,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:39:48,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:39:48,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:39:48,659 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:39:48,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 11:39:48,698 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/data/39ca661dd/dd4574e2529a4604bda9477e8bd053c1/FLAGa77d11afb [2018-11-18 11:39:49,110 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:39:49,111 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 11:39:49,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/data/39ca661dd/dd4574e2529a4604bda9477e8bd053c1/FLAGa77d11afb [2018-11-18 11:39:49,125 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/data/39ca661dd/dd4574e2529a4604bda9477e8bd053c1 [2018-11-18 11:39:49,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:39:49,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 11:39:49,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:39:49,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:39:49,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:39:49,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40118b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49, skipping insertion in model container [2018-11-18 11:39:49,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:39:49,169 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:39:49,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:39:49,364 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:39:49,427 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:39:49,444 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:39:49,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49 WrapperNode [2018-11-18 11:39:49,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:39:49,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:39:49,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:39:49,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:39:49,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... [2018-11-18 11:39:49,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:39:49,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:39:49,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:39:49,539 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:39:49,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/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-11-18 11:39:49,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-11-18 11:39:49,576 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-18 11:39:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 11:39:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 11:39:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 11:39:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 11:39:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 11:39:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 11:39:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 11:39:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 11:39:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-11-18 11:39:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 11:39:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:39:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 11:39:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:39:49,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:39:49,752 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:39:49,752 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:39:49,885 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:39:49,885 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:39:49,936 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:39:49,936 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:39:49,955 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:39:49,955 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:39:50,114 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:39:50,114 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:39:50,158 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 11:39:50,158 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 11:39:50,209 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:39:50,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:39:50 BoogieIcfgContainer [2018-11-18 11:39:50,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:39:50,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:39:50,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:39:50,213 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:39:50,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:39:49" (1/3) ... [2018-11-18 11:39:50,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a5c8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:39:50, skipping insertion in model container [2018-11-18 11:39:50,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:49" (2/3) ... [2018-11-18 11:39:50,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a5c8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:39:50, skipping insertion in model container [2018-11-18 11:39:50,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:39:50" (3/3) ... [2018-11-18 11:39:50,216 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 11:39:50,222 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:39:50,227 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:39:50,237 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:39:50,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:39:50,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:39:50,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:39:50,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:39:50,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:39:50,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:39:50,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:39:50,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:39:50,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:39:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2018-11-18 11:39:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:39:50,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:50,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:50,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:50,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash 429432298, now seen corresponding path program 1 times [2018-11-18 11:39:50,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:50,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:50,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:50,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:50,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:50,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:50,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:50,469 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 3 states. [2018-11-18 11:39:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:50,603 INFO L93 Difference]: Finished difference Result 538 states and 781 transitions. [2018-11-18 11:39:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:50,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 11:39:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:50,613 INFO L225 Difference]: With dead ends: 538 [2018-11-18 11:39:50,614 INFO L226 Difference]: Without dead ends: 288 [2018-11-18 11:39:50,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-18 11:39:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-11-18 11:39:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 11:39:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-11-18 11:39:50,667 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 20 [2018-11-18 11:39:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:50,667 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-11-18 11:39:50,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-11-18 11:39:50,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:39:50,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:50,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:50,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:50,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash 400819778, now seen corresponding path program 1 times [2018-11-18 11:39:50,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:50,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:50,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:50,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:50,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:50,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:50,771 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 3 states. [2018-11-18 11:39:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:50,916 INFO L93 Difference]: Finished difference Result 638 states and 883 transitions. [2018-11-18 11:39:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:50,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:39:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:50,922 INFO L225 Difference]: With dead ends: 638 [2018-11-18 11:39:50,922 INFO L226 Difference]: Without dead ends: 455 [2018-11-18 11:39:50,924 INFO L604 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-11-18 11:39:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-18 11:39:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 435. [2018-11-18 11:39:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-11-18 11:39:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 598 transitions. [2018-11-18 11:39:50,959 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 598 transitions. Word has length 25 [2018-11-18 11:39:50,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:50,959 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 598 transitions. [2018-11-18 11:39:50,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 598 transitions. [2018-11-18 11:39:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:39:50,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:50,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:50,961 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:50,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash 833919559, now seen corresponding path program 1 times [2018-11-18 11:39:50,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:50,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:50,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:51,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:51,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:51,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,031 INFO L87 Difference]: Start difference. First operand 435 states and 598 transitions. Second operand 3 states. [2018-11-18 11:39:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:51,096 INFO L93 Difference]: Finished difference Result 964 states and 1384 transitions. [2018-11-18 11:39:51,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:51,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:39:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:51,101 INFO L225 Difference]: With dead ends: 964 [2018-11-18 11:39:51,101 INFO L226 Difference]: Without dead ends: 647 [2018-11-18 11:39:51,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-11-18 11:39:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 607. [2018-11-18 11:39:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-18 11:39:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 868 transitions. [2018-11-18 11:39:51,140 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 868 transitions. Word has length 31 [2018-11-18 11:39:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:51,140 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 868 transitions. [2018-11-18 11:39:51,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 868 transitions. [2018-11-18 11:39:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 11:39:51,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:51,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:51,142 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:51,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -240377485, now seen corresponding path program 1 times [2018-11-18 11:39:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:51,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:51,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:51,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:51,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,194 INFO L87 Difference]: Start difference. First operand 607 states and 868 transitions. Second operand 3 states. [2018-11-18 11:39:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:51,294 INFO L93 Difference]: Finished difference Result 622 states and 888 transitions. [2018-11-18 11:39:51,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:51,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 11:39:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:51,298 INFO L225 Difference]: With dead ends: 622 [2018-11-18 11:39:51,298 INFO L226 Difference]: Without dead ends: 618 [2018-11-18 11:39:51,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-18 11:39:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 617. [2018-11-18 11:39:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 11:39:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 881 transitions. [2018-11-18 11:39:51,331 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 881 transitions. Word has length 36 [2018-11-18 11:39:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:51,332 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 881 transitions. [2018-11-18 11:39:51,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 881 transitions. [2018-11-18 11:39:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:39:51,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:51,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:51,335 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:51,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1175004135, now seen corresponding path program 1 times [2018-11-18 11:39:51,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:51,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:51,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:51,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:51,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:51,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:51,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:51,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,368 INFO L87 Difference]: Start difference. First operand 617 states and 881 transitions. Second operand 3 states. [2018-11-18 11:39:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:51,430 INFO L93 Difference]: Finished difference Result 1073 states and 1584 transitions. [2018-11-18 11:39:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:51,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 11:39:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:51,436 INFO L225 Difference]: With dead ends: 1073 [2018-11-18 11:39:51,436 INFO L226 Difference]: Without dead ends: 1054 [2018-11-18 11:39:51,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-11-18 11:39:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1024. [2018-11-18 11:39:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-18 11:39:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1525 transitions. [2018-11-18 11:39:51,486 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1525 transitions. Word has length 39 [2018-11-18 11:39:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1525 transitions. [2018-11-18 11:39:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1525 transitions. [2018-11-18 11:39:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 11:39:51,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:51,488 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:51,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:51,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1189349044, now seen corresponding path program 1 times [2018-11-18 11:39:51,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:51,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:51,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:51,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:51,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,522 INFO L87 Difference]: Start difference. First operand 1024 states and 1525 transitions. Second operand 3 states. [2018-11-18 11:39:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:51,602 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2018-11-18 11:39:51,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:51,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 11:39:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:51,609 INFO L225 Difference]: With dead ends: 1051 [2018-11-18 11:39:51,609 INFO L226 Difference]: Without dead ends: 1046 [2018-11-18 11:39:51,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2018-11-18 11:39:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2018-11-18 11:39:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-11-18 11:39:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1547 transitions. [2018-11-18 11:39:51,690 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1547 transitions. Word has length 39 [2018-11-18 11:39:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:51,691 INFO L480 AbstractCegarLoop]: Abstraction has 1044 states and 1547 transitions. [2018-11-18 11:39:51,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1547 transitions. [2018-11-18 11:39:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 11:39:51,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:51,692 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:51,692 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:51,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2057356528, now seen corresponding path program 1 times [2018-11-18 11:39:51,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:51,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:51,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:51,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:51,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:51,735 INFO L87 Difference]: Start difference. First operand 1044 states and 1547 transitions. Second operand 5 states. [2018-11-18 11:39:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:51,780 INFO L93 Difference]: Finished difference Result 1059 states and 1565 transitions. [2018-11-18 11:39:51,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:39:51,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 11:39:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:51,786 INFO L225 Difference]: With dead ends: 1059 [2018-11-18 11:39:51,786 INFO L226 Difference]: Without dead ends: 1037 [2018-11-18 11:39:51,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-11-18 11:39:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2018-11-18 11:39:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-11-18 11:39:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1538 transitions. [2018-11-18 11:39:51,830 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1538 transitions. Word has length 40 [2018-11-18 11:39:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:51,831 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1538 transitions. [2018-11-18 11:39:51,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1538 transitions. [2018-11-18 11:39:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:39:51,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:51,832 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:51,832 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:51,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:51,832 INFO L82 PathProgramCache]: Analyzing trace with hash 707123725, now seen corresponding path program 1 times [2018-11-18 11:39:51,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:51,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:51,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:51,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:51,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:51,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:51,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:51,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,886 INFO L87 Difference]: Start difference. First operand 1037 states and 1538 transitions. Second operand 3 states. [2018-11-18 11:39:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:51,927 INFO L93 Difference]: Finished difference Result 1449 states and 2196 transitions. [2018-11-18 11:39:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:51,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-18 11:39:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:51,931 INFO L225 Difference]: With dead ends: 1449 [2018-11-18 11:39:51,931 INFO L226 Difference]: Without dead ends: 579 [2018-11-18 11:39:51,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:51,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-11-18 11:39:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2018-11-18 11:39:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 11:39:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 824 transitions. [2018-11-18 11:39:51,962 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 824 transitions. Word has length 45 [2018-11-18 11:39:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:51,962 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 824 transitions. [2018-11-18 11:39:51,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 824 transitions. [2018-11-18 11:39:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 11:39:51,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:51,964 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:51,964 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:51,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:51,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1198649482, now seen corresponding path program 1 times [2018-11-18 11:39:51,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:51,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:52,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:52,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:52,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:52,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:52,004 INFO L87 Difference]: Start difference. First operand 579 states and 824 transitions. Second operand 5 states. [2018-11-18 11:39:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:52,282 INFO L93 Difference]: Finished difference Result 587 states and 830 transitions. [2018-11-18 11:39:52,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:39:52,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 11:39:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:52,286 INFO L225 Difference]: With dead ends: 587 [2018-11-18 11:39:52,286 INFO L226 Difference]: Without dead ends: 581 [2018-11-18 11:39:52,287 INFO L604 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-11-18 11:39:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-11-18 11:39:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2018-11-18 11:39:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 11:39:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 823 transitions. [2018-11-18 11:39:52,315 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 823 transitions. Word has length 44 [2018-11-18 11:39:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:52,316 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 823 transitions. [2018-11-18 11:39:52,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 823 transitions. [2018-11-18 11:39:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 11:39:52,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:52,317 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:52,317 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:52,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1909267454, now seen corresponding path program 1 times [2018-11-18 11:39:52,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:52,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:52,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:52,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:52,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:52,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:52,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:52,383 INFO L87 Difference]: Start difference. First operand 579 states and 823 transitions. Second operand 5 states. [2018-11-18 11:39:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:52,613 INFO L93 Difference]: Finished difference Result 587 states and 829 transitions. [2018-11-18 11:39:52,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:39:52,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-18 11:39:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:52,615 INFO L225 Difference]: With dead ends: 587 [2018-11-18 11:39:52,615 INFO L226 Difference]: Without dead ends: 581 [2018-11-18 11:39:52,615 INFO L604 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-11-18 11:39:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-11-18 11:39:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2018-11-18 11:39:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 11:39:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 822 transitions. [2018-11-18 11:39:52,632 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 822 transitions. Word has length 45 [2018-11-18 11:39:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:52,633 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 822 transitions. [2018-11-18 11:39:52,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 822 transitions. [2018-11-18 11:39:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 11:39:52,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:52,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:52,634 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:52,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:52,634 INFO L82 PathProgramCache]: Analyzing trace with hash -887211853, now seen corresponding path program 1 times [2018-11-18 11:39:52,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:52,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:52,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:52,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:52,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:52,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:39:52,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:39:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:39:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:39:52,681 INFO L87 Difference]: Start difference. First operand 579 states and 822 transitions. Second operand 6 states. [2018-11-18 11:39:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:52,724 INFO L93 Difference]: Finished difference Result 602 states and 847 transitions. [2018-11-18 11:39:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:39:52,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 11:39:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:52,727 INFO L225 Difference]: With dead ends: 602 [2018-11-18 11:39:52,727 INFO L226 Difference]: Without dead ends: 577 [2018-11-18 11:39:52,727 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:52,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-11-18 11:39:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2018-11-18 11:39:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-18 11:39:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 817 transitions. [2018-11-18 11:39:52,745 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 817 transitions. Word has length 46 [2018-11-18 11:39:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:52,745 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 817 transitions. [2018-11-18 11:39:52,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:39:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 817 transitions. [2018-11-18 11:39:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 11:39:52,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:52,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:52,747 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:52,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:52,747 INFO L82 PathProgramCache]: Analyzing trace with hash -394845821, now seen corresponding path program 1 times [2018-11-18 11:39:52,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:52,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:52,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:52,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:52,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:52,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:52,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:52,789 INFO L87 Difference]: Start difference. First operand 577 states and 817 transitions. Second operand 3 states. [2018-11-18 11:39:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:52,872 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2018-11-18 11:39:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:52,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 11:39:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:52,875 INFO L225 Difference]: With dead ends: 811 [2018-11-18 11:39:52,875 INFO L226 Difference]: Without dead ends: 803 [2018-11-18 11:39:52,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-18 11:39:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 646. [2018-11-18 11:39:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-18 11:39:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 920 transitions. [2018-11-18 11:39:52,902 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 920 transitions. Word has length 46 [2018-11-18 11:39:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:52,902 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 920 transitions. [2018-11-18 11:39:52,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 920 transitions. [2018-11-18 11:39:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 11:39:52,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:52,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:52,904 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:52,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash 800744827, now seen corresponding path program 1 times [2018-11-18 11:39:52,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:52,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:52,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:52,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:39:52,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:39:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:39:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:39:52,959 INFO L87 Difference]: Start difference. First operand 646 states and 920 transitions. Second operand 4 states. [2018-11-18 11:39:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:53,084 INFO L93 Difference]: Finished difference Result 720 states and 993 transitions. [2018-11-18 11:39:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:39:53,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 11:39:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:53,086 INFO L225 Difference]: With dead ends: 720 [2018-11-18 11:39:53,086 INFO L226 Difference]: Without dead ends: 453 [2018-11-18 11:39:53,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:39:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-18 11:39:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 432. [2018-11-18 11:39:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-18 11:39:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 564 transitions. [2018-11-18 11:39:53,104 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 564 transitions. Word has length 49 [2018-11-18 11:39:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:53,104 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 564 transitions. [2018-11-18 11:39:53,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:39:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 564 transitions. [2018-11-18 11:39:53,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:39:53,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:53,105 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:53,106 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:53,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1097683735, now seen corresponding path program 1 times [2018-11-18 11:39:53,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:53,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:53,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:39:53,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:39:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:39:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:39:53,168 INFO L87 Difference]: Start difference. First operand 432 states and 564 transitions. Second operand 8 states. [2018-11-18 11:39:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:53,291 INFO L93 Difference]: Finished difference Result 448 states and 583 transitions. [2018-11-18 11:39:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:39:53,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-18 11:39:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:53,293 INFO L225 Difference]: With dead ends: 448 [2018-11-18 11:39:53,293 INFO L226 Difference]: Without dead ends: 444 [2018-11-18 11:39:53,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:39:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-18 11:39:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 440. [2018-11-18 11:39:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-11-18 11:39:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 575 transitions. [2018-11-18 11:39:53,308 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 575 transitions. Word has length 47 [2018-11-18 11:39:53,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:53,308 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 575 transitions. [2018-11-18 11:39:53,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:39:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 575 transitions. [2018-11-18 11:39:53,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 11:39:53,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:53,309 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:53,309 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:53,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:53,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1097406905, now seen corresponding path program 1 times [2018-11-18 11:39:53,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:53,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:53,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:39:53,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:39:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:39:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:39:53,360 INFO L87 Difference]: Start difference. First operand 440 states and 575 transitions. Second operand 8 states. [2018-11-18 11:39:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:53,409 INFO L93 Difference]: Finished difference Result 761 states and 1041 transitions. [2018-11-18 11:39:53,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:39:53,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-18 11:39:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:53,411 INFO L225 Difference]: With dead ends: 761 [2018-11-18 11:39:53,411 INFO L226 Difference]: Without dead ends: 463 [2018-11-18 11:39:53,412 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:39:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-18 11:39:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2018-11-18 11:39:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-18 11:39:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 590 transitions. [2018-11-18 11:39:53,427 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 590 transitions. Word has length 47 [2018-11-18 11:39:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:53,427 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 590 transitions. [2018-11-18 11:39:53,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:39:53,427 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 590 transitions. [2018-11-18 11:39:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 11:39:53,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:53,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:53,428 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:53,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:53,428 INFO L82 PathProgramCache]: Analyzing trace with hash -601026861, now seen corresponding path program 1 times [2018-11-18 11:39:53,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:53,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:53,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:53,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:53,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:53,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:53,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:53,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:53,476 INFO L87 Difference]: Start difference. First operand 450 states and 590 transitions. Second operand 5 states. [2018-11-18 11:39:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:53,774 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-11-18 11:39:53,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:39:53,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 11:39:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:53,776 INFO L225 Difference]: With dead ends: 581 [2018-11-18 11:39:53,776 INFO L226 Difference]: Without dead ends: 562 [2018-11-18 11:39:53,776 INFO L604 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-11-18 11:39:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-18 11:39:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 435. [2018-11-18 11:39:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-11-18 11:39:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 569 transitions. [2018-11-18 11:39:53,794 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 569 transitions. Word has length 48 [2018-11-18 11:39:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:53,794 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 569 transitions. [2018-11-18 11:39:53,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 569 transitions. [2018-11-18 11:39:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 11:39:53,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:53,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:53,796 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:53,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:53,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1969665160, now seen corresponding path program 1 times [2018-11-18 11:39:53,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:53,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:53,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:53,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:53,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:53,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:39:53,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:39:53,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:39:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:39:53,840 INFO L87 Difference]: Start difference. First operand 435 states and 569 transitions. Second operand 8 states. [2018-11-18 11:39:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:53,930 INFO L93 Difference]: Finished difference Result 449 states and 585 transitions. [2018-11-18 11:39:53,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:39:53,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 11:39:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:53,932 INFO L225 Difference]: With dead ends: 449 [2018-11-18 11:39:53,932 INFO L226 Difference]: Without dead ends: 418 [2018-11-18 11:39:53,932 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:39:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-18 11:39:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-11-18 11:39:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-11-18 11:39:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 548 transitions. [2018-11-18 11:39:53,949 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 548 transitions. Word has length 49 [2018-11-18 11:39:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:53,949 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 548 transitions. [2018-11-18 11:39:53,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:39:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 548 transitions. [2018-11-18 11:39:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 11:39:53,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:53,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:53,950 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:53,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1552038808, now seen corresponding path program 1 times [2018-11-18 11:39:53,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:53,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:53,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:53,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:39:53,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:39:53,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:39:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:39:53,996 INFO L87 Difference]: Start difference. First operand 418 states and 548 transitions. Second operand 8 states. [2018-11-18 11:39:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:54,075 INFO L93 Difference]: Finished difference Result 448 states and 586 transitions. [2018-11-18 11:39:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:39:54,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 11:39:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:54,077 INFO L225 Difference]: With dead ends: 448 [2018-11-18 11:39:54,077 INFO L226 Difference]: Without dead ends: 427 [2018-11-18 11:39:54,077 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:39:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-18 11:39:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2018-11-18 11:39:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-18 11:39:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 551 transitions. [2018-11-18 11:39:54,092 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 551 transitions. Word has length 50 [2018-11-18 11:39:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:54,092 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 551 transitions. [2018-11-18 11:39:54,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:39:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2018-11-18 11:39:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 11:39:54,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:54,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:54,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:54,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1495835486, now seen corresponding path program 1 times [2018-11-18 11:39:54,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:54,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:54,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:54,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:39:54,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:39:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:39:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:39:54,139 INFO L87 Difference]: Start difference. First operand 419 states and 551 transitions. Second operand 6 states. [2018-11-18 11:39:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:54,169 INFO L93 Difference]: Finished difference Result 434 states and 567 transitions. [2018-11-18 11:39:54,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:39:54,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-18 11:39:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:54,171 INFO L225 Difference]: With dead ends: 434 [2018-11-18 11:39:54,171 INFO L226 Difference]: Without dead ends: 400 [2018-11-18 11:39:54,171 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-11-18 11:39:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-11-18 11:39:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-18 11:39:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-11-18 11:39:54,185 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 51 [2018-11-18 11:39:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:54,185 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-11-18 11:39:54,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:39:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-11-18 11:39:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 11:39:54,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:54,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:54,186 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:54,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash -569080051, now seen corresponding path program 1 times [2018-11-18 11:39:54,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:54,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:54,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:54,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:54,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:39:54,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:39:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:39:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:39:54,216 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-11-18 11:39:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:54,244 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-11-18 11:39:54,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:39:54,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-18 11:39:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:54,246 INFO L225 Difference]: With dead ends: 436 [2018-11-18 11:39:54,246 INFO L226 Difference]: Without dead ends: 410 [2018-11-18 11:39:54,246 INFO L604 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-11-18 11:39:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-18 11:39:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-11-18 11:39:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-18 11:39:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-11-18 11:39:54,260 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-11-18 11:39:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:54,260 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-11-18 11:39:54,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:39:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-11-18 11:39:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 11:39:54,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:54,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:54,261 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:54,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:54,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1731742539, now seen corresponding path program 1 times [2018-11-18 11:39:54,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:54,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:54,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:54,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:39:54,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:39:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:39:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:54,312 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-11-18 11:39:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:54,797 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-11-18 11:39:54,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:39:54,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-18 11:39:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:54,800 INFO L225 Difference]: With dead ends: 565 [2018-11-18 11:39:54,800 INFO L226 Difference]: Without dead ends: 511 [2018-11-18 11:39:54,801 INFO L604 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-11-18 11:39:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-18 11:39:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-11-18 11:39:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-18 11:39:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-11-18 11:39:54,832 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-11-18 11:39:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:54,832 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-11-18 11:39:54,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:39:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-11-18 11:39:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 11:39:54,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:54,833 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:54,833 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:54,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1878435341, now seen corresponding path program 1 times [2018-11-18 11:39:54,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:54,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:54,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:54,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:54,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:54,861 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-11-18 11:39:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:55,040 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-11-18 11:39:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:55,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-18 11:39:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:55,045 INFO L225 Difference]: With dead ends: 673 [2018-11-18 11:39:55,045 INFO L226 Difference]: Without dead ends: 659 [2018-11-18 11:39:55,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-18 11:39:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-11-18 11:39:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-11-18 11:39:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-11-18 11:39:55,087 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-11-18 11:39:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:55,087 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-11-18 11:39:55,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-11-18 11:39:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 11:39:55,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:55,088 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:55,088 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:55,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1445321105, now seen corresponding path program 1 times [2018-11-18 11:39:55,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:55,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:55,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:55,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 11:39:55,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 11:39:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 11:39:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 11:39:55,151 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-11-18 11:39:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:55,215 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-11-18 11:39:55,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 11:39:55,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-18 11:39:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:55,218 INFO L225 Difference]: With dead ends: 598 [2018-11-18 11:39:55,218 INFO L226 Difference]: Without dead ends: 574 [2018-11-18 11:39:55,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 11:39:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-18 11:39:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-18 11:39:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-18 11:39:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-11-18 11:39:55,260 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-11-18 11:39:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:55,260 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-11-18 11:39:55,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 11:39:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-11-18 11:39:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 11:39:55,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:55,261 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:55,261 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:55,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash -794377348, now seen corresponding path program 1 times [2018-11-18 11:39:55,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:55,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:55,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:55,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:55,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:55,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:55,316 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-11-18 11:39:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:55,667 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-11-18 11:39:55,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:39:55,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 11:39:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:55,671 INFO L225 Difference]: With dead ends: 660 [2018-11-18 11:39:55,671 INFO L226 Difference]: Without dead ends: 624 [2018-11-18 11:39:55,672 INFO L604 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-11-18 11:39:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-18 11:39:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-11-18 11:39:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-18 11:39:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-18 11:39:55,717 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-11-18 11:39:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:55,717 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-18 11:39:55,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-11-18 11:39:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 11:39:55,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:55,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:55,718 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:55,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:55,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2111623723, now seen corresponding path program 1 times [2018-11-18 11:39:55,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:55,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:55,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:55,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:55,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:55,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:55,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:55,758 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-11-18 11:39:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:55,839 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-11-18 11:39:55,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:55,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-18 11:39:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:55,843 INFO L225 Difference]: With dead ends: 955 [2018-11-18 11:39:55,843 INFO L226 Difference]: Without dead ends: 527 [2018-11-18 11:39:55,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-11-18 11:39:55,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-11-18 11:39:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-18 11:39:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-11-18 11:39:55,882 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-11-18 11:39:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:55,882 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-11-18 11:39:55,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-11-18 11:39:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 11:39:55,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:55,883 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:55,883 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:55,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2098360705, now seen corresponding path program 1 times [2018-11-18 11:39:55,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:55,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:55,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 11:39:55,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:39:55,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:39:55,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:39:55,971 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-11-18 11:39:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:56,111 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-11-18 11:39:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:39:56,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 11:39:56,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:56,114 INFO L225 Difference]: With dead ends: 529 [2018-11-18 11:39:56,114 INFO L226 Difference]: Without dead ends: 466 [2018-11-18 11:39:56,115 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 11:39:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-18 11:39:56,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-11-18 11:39:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-18 11:39:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-11-18 11:39:56,149 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-11-18 11:39:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:56,150 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-11-18 11:39:56,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:39:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-11-18 11:39:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 11:39:56,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:56,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:56,151 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:56,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1618550010, now seen corresponding path program 1 times [2018-11-18 11:39:56,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:56,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:56,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:39:56,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:39:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:39:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:39:56,229 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-11-18 11:39:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:56,333 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-11-18 11:39:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:39:56,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-18 11:39:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:56,337 INFO L225 Difference]: With dead ends: 918 [2018-11-18 11:39:56,337 INFO L226 Difference]: Without dead ends: 491 [2018-11-18 11:39:56,339 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-18 11:39:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-11-18 11:39:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-18 11:39:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-11-18 11:39:56,374 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-11-18 11:39:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:56,375 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-11-18 11:39:56,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:39:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-11-18 11:39:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 11:39:56,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:56,375 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:56,376 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:56,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash -653889216, now seen corresponding path program 1 times [2018-11-18 11:39:56,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:56,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:56,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:56,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:56,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:56,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:56,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:56,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:56,418 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-11-18 11:39:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:56,585 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-11-18 11:39:56,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:56,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 11:39:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:56,589 INFO L225 Difference]: With dead ends: 730 [2018-11-18 11:39:56,589 INFO L226 Difference]: Without dead ends: 727 [2018-11-18 11:39:56,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-18 11:39:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-11-18 11:39:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-18 11:39:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-11-18 11:39:56,631 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-11-18 11:39:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:56,632 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-11-18 11:39:56,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:56,632 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-11-18 11:39:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 11:39:56,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:56,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:56,633 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:56,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:56,633 INFO L82 PathProgramCache]: Analyzing trace with hash 966405873, now seen corresponding path program 1 times [2018-11-18 11:39:56,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:56,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:56,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:56,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:56,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:56,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:56,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:56,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:56,697 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 5 states. [2018-11-18 11:39:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:57,338 INFO L93 Difference]: Finished difference Result 1315 states and 2222 transitions. [2018-11-18 11:39:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:39:57,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-11-18 11:39:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:57,346 INFO L225 Difference]: With dead ends: 1315 [2018-11-18 11:39:57,346 INFO L226 Difference]: Without dead ends: 877 [2018-11-18 11:39:57,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-18 11:39:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 558. [2018-11-18 11:39:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-11-18 11:39:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 886 transitions. [2018-11-18 11:39:57,411 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 886 transitions. Word has length 64 [2018-11-18 11:39:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:57,411 INFO L480 AbstractCegarLoop]: Abstraction has 558 states and 886 transitions. [2018-11-18 11:39:57,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 886 transitions. [2018-11-18 11:39:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 11:39:57,412 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:57,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:57,412 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:57,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1763329170, now seen corresponding path program 1 times [2018-11-18 11:39:57,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:57,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:57,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:57,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:57,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:39:57,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:39:57,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:39:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:39:57,538 INFO L87 Difference]: Start difference. First operand 558 states and 886 transitions. Second operand 6 states. [2018-11-18 11:39:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:57,625 INFO L93 Difference]: Finished difference Result 873 states and 1384 transitions. [2018-11-18 11:39:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:39:57,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-18 11:39:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:57,628 INFO L225 Difference]: With dead ends: 873 [2018-11-18 11:39:57,628 INFO L226 Difference]: Without dead ends: 370 [2018-11-18 11:39:57,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-11-18 11:39:57,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2018-11-18 11:39:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 11:39:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 487 transitions. [2018-11-18 11:39:57,666 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 487 transitions. Word has length 65 [2018-11-18 11:39:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:57,666 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 487 transitions. [2018-11-18 11:39:57,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:39:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 487 transitions. [2018-11-18 11:39:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 11:39:57,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:57,667 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:57,668 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:57,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash -677494197, now seen corresponding path program 1 times [2018-11-18 11:39:57,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:57,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:57,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:57,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:57,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:57,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:57,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:57,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:57,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:57,723 INFO L87 Difference]: Start difference. First operand 340 states and 487 transitions. Second operand 5 states. [2018-11-18 11:39:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:58,017 INFO L93 Difference]: Finished difference Result 604 states and 875 transitions. [2018-11-18 11:39:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:39:58,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 11:39:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:58,020 INFO L225 Difference]: With dead ends: 604 [2018-11-18 11:39:58,020 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 11:39:58,022 INFO L604 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-11-18 11:39:58,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 11:39:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-18 11:39:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 11:39:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-11-18 11:39:58,051 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-11-18 11:39:58,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:58,052 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-11-18 11:39:58,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-11-18 11:39:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:39:58,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:58,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:58,053 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:58,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash -892852923, now seen corresponding path program 1 times [2018-11-18 11:39:58,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:58,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:58,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:58,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:39:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:58,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:58,102 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 3 states. [2018-11-18 11:39:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:58,138 INFO L93 Difference]: Finished difference Result 580 states and 820 transitions. [2018-11-18 11:39:58,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:58,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-18 11:39:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:58,141 INFO L225 Difference]: With dead ends: 580 [2018-11-18 11:39:58,141 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 11:39:58,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 11:39:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2018-11-18 11:39:58,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-18 11:39:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2018-11-18 11:39:58,172 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 70 [2018-11-18 11:39:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:58,172 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2018-11-18 11:39:58,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:39:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2018-11-18 11:39:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:39:58,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:58,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:58,173 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:58,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1903970173, now seen corresponding path program 1 times [2018-11-18 11:39:58,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:58,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:58,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 11:39:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 11:39:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 11:39:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:39:58,236 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 7 states. [2018-11-18 11:39:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:58,791 INFO L93 Difference]: Finished difference Result 629 states and 886 transitions. [2018-11-18 11:39:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:39:58,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-11-18 11:39:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:58,794 INFO L225 Difference]: With dead ends: 629 [2018-11-18 11:39:58,795 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 11:39:58,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:39:58,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 11:39:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 307. [2018-11-18 11:39:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 11:39:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2018-11-18 11:39:58,833 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2018-11-18 11:39:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:58,834 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2018-11-18 11:39:58,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 11:39:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2018-11-18 11:39:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 11:39:58,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:58,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:58,835 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:58,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -180378235, now seen corresponding path program 1 times [2018-11-18 11:39:58,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:58,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:58,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:39:58,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:39:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:39:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:39:58,953 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2018-11-18 11:39:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:59,439 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2018-11-18 11:39:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:39:59,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-18 11:39:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:59,441 INFO L225 Difference]: With dead ends: 671 [2018-11-18 11:39:59,442 INFO L226 Difference]: Without dead ends: 407 [2018-11-18 11:39:59,442 INFO L604 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-11-18 11:39:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-18 11:39:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2018-11-18 11:39:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 11:39:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2018-11-18 11:39:59,465 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2018-11-18 11:39:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:59,466 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2018-11-18 11:39:59,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:39:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2018-11-18 11:39:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 11:39:59,466 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:59,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:59,467 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:59,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1607835606, now seen corresponding path program 1 times [2018-11-18 11:39:59,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:59,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:59,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:39:59,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:39:59,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:39:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:39:59,515 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2018-11-18 11:39:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:59,553 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2018-11-18 11:39:59,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:39:59,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-18 11:39:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:59,555 INFO L225 Difference]: With dead ends: 676 [2018-11-18 11:39:59,555 INFO L226 Difference]: Without dead ends: 369 [2018-11-18 11:39:59,556 INFO L604 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-11-18 11:39:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-18 11:39:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-11-18 11:39:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 11:39:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2018-11-18 11:39:59,577 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2018-11-18 11:39:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:59,578 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2018-11-18 11:39:59,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:39:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2018-11-18 11:39:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 11:39:59,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:59,579 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:59,579 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:59,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash -483918914, now seen corresponding path program 1 times [2018-11-18 11:39:59,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:59,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:59,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:59,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:59,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:39:59,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:39:59,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:39:59,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:39:59,633 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2018-11-18 11:39:59,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:59,845 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2018-11-18 11:39:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:39:59,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 11:39:59,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:39:59,847 INFO L225 Difference]: With dead ends: 642 [2018-11-18 11:39:59,848 INFO L226 Difference]: Without dead ends: 337 [2018-11-18 11:39:59,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-18 11:39:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-18 11:39:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-11-18 11:39:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 11:39:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2018-11-18 11:39:59,868 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2018-11-18 11:39:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:39:59,868 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2018-11-18 11:39:59,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:39:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2018-11-18 11:39:59,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 11:39:59,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:39:59,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:59,869 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:39:59,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:59,870 INFO L82 PathProgramCache]: Analyzing trace with hash 923699722, now seen corresponding path program 1 times [2018-11-18 11:39:59,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:59,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:59,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:59,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 11:39:59,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 11:39:59,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 11:39:59,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:39:59,967 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2018-11-18 11:40:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:00,069 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2018-11-18 11:40:00,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:40:00,070 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-11-18 11:40:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:00,071 INFO L225 Difference]: With dead ends: 357 [2018-11-18 11:40:00,071 INFO L226 Difference]: Without dead ends: 332 [2018-11-18 11:40:00,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:40:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-18 11:40:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-11-18 11:40:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-18 11:40:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2018-11-18 11:40:00,091 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2018-11-18 11:40:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:00,091 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2018-11-18 11:40:00,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 11:40:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2018-11-18 11:40:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 11:40:00,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:00,092 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:00,093 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:00,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash -111025284, now seen corresponding path program 1 times [2018-11-18 11:40:00,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:00,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:00,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:00,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:00,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:40:00,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:40:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:40:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:40:00,140 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2018-11-18 11:40:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:00,336 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2018-11-18 11:40:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:00,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-18 11:40:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:00,339 INFO L225 Difference]: With dead ends: 726 [2018-11-18 11:40:00,339 INFO L226 Difference]: Without dead ends: 458 [2018-11-18 11:40:00,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-11-18 11:40:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-18 11:40:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2018-11-18 11:40:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-18 11:40:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2018-11-18 11:40:00,364 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2018-11-18 11:40:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:00,364 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2018-11-18 11:40:00,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:40:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2018-11-18 11:40:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 11:40:00,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:00,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:00,366 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:00,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1386351619, now seen corresponding path program 1 times [2018-11-18 11:40:00,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:00,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:00,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:00,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:00,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:00,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:00,461 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2018-11-18 11:40:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:01,686 INFO L93 Difference]: Finished difference Result 816 states and 1035 transitions. [2018-11-18 11:40:01,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 11:40:01,687 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-18 11:40:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:01,690 INFO L225 Difference]: With dead ends: 816 [2018-11-18 11:40:01,690 INFO L226 Difference]: Without dead ends: 774 [2018-11-18 11:40:01,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 11:40:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-18 11:40:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2018-11-18 11:40:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-18 11:40:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2018-11-18 11:40:01,743 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2018-11-18 11:40:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:01,743 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2018-11-18 11:40:01,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2018-11-18 11:40:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 11:40:01,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:01,745 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:01,745 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:01,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1414851909, now seen corresponding path program 1 times [2018-11-18 11:40:01,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:01,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:01,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:01,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:01,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:01,885 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2018-11-18 11:40:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:03,146 INFO L93 Difference]: Finished difference Result 797 states and 1012 transitions. [2018-11-18 11:40:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 11:40:03,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-18 11:40:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:03,150 INFO L225 Difference]: With dead ends: 797 [2018-11-18 11:40:03,150 INFO L226 Difference]: Without dead ends: 755 [2018-11-18 11:40:03,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2018-11-18 11:40:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-18 11:40:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2018-11-18 11:40:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-18 11:40:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2018-11-18 11:40:03,210 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2018-11-18 11:40:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:03,210 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2018-11-18 11:40:03,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2018-11-18 11:40:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 11:40:03,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:03,212 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:03,212 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:03,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:03,212 INFO L82 PathProgramCache]: Analyzing trace with hash -789414115, now seen corresponding path program 1 times [2018-11-18 11:40:03,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:03,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:03,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:03,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:03,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 11:40:03,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 11:40:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 11:40:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 11:40:03,377 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2018-11-18 11:40:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:03,513 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2018-11-18 11:40:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 11:40:03,514 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-11-18 11:40:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:03,516 INFO L225 Difference]: With dead ends: 423 [2018-11-18 11:40:03,516 INFO L226 Difference]: Without dead ends: 396 [2018-11-18 11:40:03,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-11-18 11:40:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-18 11:40:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-11-18 11:40:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-18 11:40:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2018-11-18 11:40:03,544 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2018-11-18 11:40:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:03,544 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2018-11-18 11:40:03,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 11:40:03,544 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2018-11-18 11:40:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 11:40:03,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:03,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:03,545 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:03,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:03,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1142573433, now seen corresponding path program 1 times [2018-11-18 11:40:03,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:03,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:03,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:03,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:03,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:03,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:03,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:03,643 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2018-11-18 11:40:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:04,578 INFO L93 Difference]: Finished difference Result 781 states and 987 transitions. [2018-11-18 11:40:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 11:40:04,579 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-11-18 11:40:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:04,581 INFO L225 Difference]: With dead ends: 781 [2018-11-18 11:40:04,581 INFO L226 Difference]: Without dead ends: 719 [2018-11-18 11:40:04,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 11:40:04,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-11-18 11:40:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2018-11-18 11:40:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-18 11:40:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2018-11-18 11:40:04,630 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2018-11-18 11:40:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:04,630 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2018-11-18 11:40:04,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2018-11-18 11:40:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 11:40:04,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:04,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:04,632 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:04,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:04,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2113809289, now seen corresponding path program 1 times [2018-11-18 11:40:04,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:04,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:40:04,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:04,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 11:40:04,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 11:40:04,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 11:40:04,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:40:04,733 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2018-11-18 11:40:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:05,973 INFO L93 Difference]: Finished difference Result 681 states and 837 transitions. [2018-11-18 11:40:05,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 11:40:05,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-11-18 11:40:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:05,975 INFO L225 Difference]: With dead ends: 681 [2018-11-18 11:40:05,975 INFO L226 Difference]: Without dead ends: 617 [2018-11-18 11:40:05,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-11-18 11:40:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-18 11:40:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2018-11-18 11:40:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-18 11:40:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2018-11-18 11:40:06,014 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2018-11-18 11:40:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,015 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2018-11-18 11:40:06,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 11:40:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2018-11-18 11:40:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 11:40:06,016 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,016 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:40:06,016 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1948082976, now seen corresponding path program 1 times [2018-11-18 11:40:06,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 11:40:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:06,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:06,059 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2018-11-18 11:40:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,101 INFO L93 Difference]: Finished difference Result 468 states and 581 transitions. [2018-11-18 11:40:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:06,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-18 11:40:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,104 INFO L225 Difference]: With dead ends: 468 [2018-11-18 11:40:06,104 INFO L226 Difference]: Without dead ends: 322 [2018-11-18 11:40:06,104 INFO L604 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-11-18 11:40:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-18 11:40:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-11-18 11:40:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 11:40:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2018-11-18 11:40:06,127 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2018-11-18 11:40:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,127 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2018-11-18 11:40:06,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2018-11-18 11:40:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 11:40:06,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,128 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 11:40:06,128 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash 835839879, now seen corresponding path program 1 times [2018-11-18 11:40:06,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 11:40:06,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:40:06,176 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/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-11-18 11:40:06,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:40:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 11:40:06,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 11:40:06,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-18 11:40:06,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:40:06,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:40:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:40:06,396 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 10 states. [2018-11-18 11:40:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,485 INFO L93 Difference]: Finished difference Result 431 states and 516 transitions. [2018-11-18 11:40:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:40:06,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 163 [2018-11-18 11:40:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,488 INFO L225 Difference]: With dead ends: 431 [2018-11-18 11:40:06,488 INFO L226 Difference]: Without dead ends: 285 [2018-11-18 11:40:06,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-18 11:40:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-18 11:40:06,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2018-11-18 11:40:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-18 11:40:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 327 transitions. [2018-11-18 11:40:06,520 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 327 transitions. Word has length 163 [2018-11-18 11:40:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,520 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 327 transitions. [2018-11-18 11:40:06,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:40:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 327 transitions. [2018-11-18 11:40:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 11:40:06,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,521 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 11:40:06,521 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1924226125, now seen corresponding path program 1 times [2018-11-18 11:40:06,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 11:40:06,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:06,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:06,588 INFO L87 Difference]: Start difference. First operand 279 states and 327 transitions. Second operand 6 states. [2018-11-18 11:40:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,640 INFO L93 Difference]: Finished difference Result 441 states and 523 transitions. [2018-11-18 11:40:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:06,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-18 11:40:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,642 INFO L225 Difference]: With dead ends: 441 [2018-11-18 11:40:06,642 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 11:40:06,643 INFO L604 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-11-18 11:40:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 11:40:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2018-11-18 11:40:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-18 11:40:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 312 transitions. [2018-11-18 11:40:06,671 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 312 transitions. Word has length 164 [2018-11-18 11:40:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,671 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 312 transitions. [2018-11-18 11:40:06,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 312 transitions. [2018-11-18 11:40:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 11:40:06,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,672 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-18 11:40:06,672 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash -31780542, now seen corresponding path program 1 times [2018-11-18 11:40:06,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,740 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-18 11:40:06,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:06,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:06,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:06,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:06,741 INFO L87 Difference]: Start difference. First operand 272 states and 312 transitions. Second operand 6 states. [2018-11-18 11:40:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,781 INFO L93 Difference]: Finished difference Result 332 states and 379 transitions. [2018-11-18 11:40:06,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:06,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-11-18 11:40:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,783 INFO L225 Difference]: With dead ends: 332 [2018-11-18 11:40:06,783 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 11:40:06,784 INFO L604 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-11-18 11:40:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 11:40:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 243. [2018-11-18 11:40:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-18 11:40:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2018-11-18 11:40:06,809 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 204 [2018-11-18 11:40:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,809 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2018-11-18 11:40:06,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2018-11-18 11:40:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 11:40:06,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:40:06,811 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-18 11:40:06,811 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:40:06,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:40:06,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1944923872, now seen corresponding path program 1 times [2018-11-18 11:40:06,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:40:06,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:40:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:40:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:40:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:40:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-11-18 11:40:06,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:40:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 11:40:06,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 11:40:06,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 11:40:06,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:40:06,881 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand 6 states. [2018-11-18 11:40:06,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:40:06,912 INFO L93 Difference]: Finished difference Result 243 states and 276 transitions. [2018-11-18 11:40:06,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:40:06,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-11-18 11:40:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:40:06,914 INFO L225 Difference]: With dead ends: 243 [2018-11-18 11:40:06,914 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:40:06,916 INFO L604 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-11-18 11:40:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:40:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:40:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:40:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:40:06,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-11-18 11:40:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:40:06,917 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:40:06,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 11:40:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:40:06,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:40:06,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:40:06,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:06,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:06,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:06,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:06,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:06,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:06,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:07,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 11:40:08,939 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-11-18 11:40:09,073 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-11-18 11:40:09,455 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 80 [2018-11-18 11:40:09,696 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-11-18 11:40:09,818 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-11-18 11:40:09,939 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 60 [2018-11-18 11:40:10,074 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 1 [2018-11-18 11:40:10,363 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-11-18 11:40:10,808 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 82 [2018-11-18 11:40:10,933 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 1 [2018-11-18 11:40:11,151 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2018-11-18 11:40:11,323 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 73 [2018-11-18 11:40:11,598 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-18 11:40:11,823 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 70 [2018-11-18 11:40:11,953 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-11-18 11:40:12,125 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2018-11-18 11:40:12,470 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 83 [2018-11-18 11:40:12,719 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 73 [2018-11-18 11:40:12,841 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-11-18 11:40:12,995 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2018-11-18 11:40:13,107 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2018-11-18 11:40:13,321 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2018-11-18 11:40:13,738 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 81 [2018-11-18 11:40:14,056 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2018-11-18 11:40:14,191 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 84 [2018-11-18 11:40:14,425 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2018-11-18 11:40:14,878 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 80 [2018-11-18 11:40:15,082 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 64 [2018-11-18 11:40:15,600 WARN L180 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 92 [2018-11-18 11:40:15,938 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-11-18 11:40:16,064 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2018-11-18 11:40:16,291 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 97 [2018-11-18 11:40:16,514 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 75 [2018-11-18 11:40:16,713 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2018-11-18 11:40:17,053 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2018-11-18 11:40:17,292 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 73 [2018-11-18 11:40:17,553 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2018-11-18 11:40:17,732 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-18 11:40:17,988 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 80 [2018-11-18 11:40:18,203 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-11-18 11:40:18,411 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2018-11-18 11:40:18,920 WARN L180 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 92 [2018-11-18 11:40:19,217 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2018-11-18 11:40:19,360 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-11-18 11:40:19,545 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-18 11:40:19,836 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2018-11-18 11:40:20,029 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 96 [2018-11-18 11:40:20,207 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 94 [2018-11-18 11:40:20,898 WARN L180 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 110 [2018-11-18 11:40:21,155 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 85 [2018-11-18 11:40:21,296 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-11-18 11:40:21,407 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2018-11-18 11:40:21,604 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-11-18 11:40:21,855 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2018-11-18 11:40:21,977 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2018-11-18 11:40:22,288 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2018-11-18 11:40:22,353 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-11-18 11:40:22,353 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~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) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,353 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-11-18 11:40:22,353 INFO L428 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-11-18 11:40:22,353 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-11-18 11:40:22,353 INFO L421 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,354 INFO L421 ceAbstractionStarter]: At program point L787(lines 780 828) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:40:22,354 INFO L425 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-11-18 11:40:22,354 INFO L425 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-11-18 11:40:22,354 INFO L421 ceAbstractionStarter]: At program point L779(lines 772 829) the Hoare annotation is: (let ((.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse5 .cse6) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse7 .cse4 .cse5 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:40:22,354 INFO L421 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,354 INFO L425 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-11-18 11:40:22,354 INFO L425 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-11-18 11:40:22,354 INFO L425 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L421 ceAbstractionStarter]: At program point L722(lines 721 762) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L421 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-11-18 11:40:22,355 INFO L425 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-11-18 11:40:22,356 INFO L421 ceAbstractionStarter]: At program point L707(lines 706 765) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,356 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~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) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,356 INFO L425 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-11-18 11:40:22,356 INFO L425 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-11-18 11:40:22,356 INFO L421 ceAbstractionStarter]: At program point L807(line 807) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,356 INFO L425 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-11-18 11:40:22,356 INFO L425 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-11-18 11:40:22,356 INFO L425 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-11-18 11:40:22,356 INFO L421 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (= ~NP~0 ~s~0)) (.cse9 (<= ~s~0 1)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (not (= ~pended~0 1))) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~myStatus~0) .cse8 .cse9 .cse10 .cse11 .cse12) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:40:22,356 INFO L421 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= 1 ~s~0)) (.cse4 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse5 (= ~routine~0 0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (= ~NP~0 ~s~0)) (.cse9 (<= ~s~0 1)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (not (= ~pended~0 1))) (.cse12 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~myStatus~0) .cse8 .cse9 .cse10 .cse11 .cse12) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:40:22,357 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-11-18 11:40:22,357 INFO L421 ceAbstractionStarter]: At program point L759(lines 682 771) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= main_~status~6 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse1 (= ~DC~0 ~s~0)) (.cse5 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~6))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6 .cse7) (and .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse0 .cse5 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:40:22,357 INFO L425 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-11-18 11:40:22,357 INFO L425 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-11-18 11:40:22,357 INFO L421 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (= main_~status~6 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse1 (= ~DC~0 ~s~0)) (.cse5 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~6))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse6 .cse7) (and .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse0 .cse5 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 11:40:22,357 INFO L421 ceAbstractionStarter]: At program point L727(lines 726 761) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,357 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-11-18 11:40:22,357 INFO L425 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-11-18 11:40:22,357 INFO L421 ceAbstractionStarter]: At program point L794(line 794) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,358 INFO L425 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-11-18 11:40:22,358 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-11-18 11:40:22,358 INFO L421 ceAbstractionStarter]: At program point L712(lines 711 764) the Hoare annotation is: (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 11:40:22,358 INFO L421 ceAbstractionStarter]: At program point L803(lines 790 825) the Hoare annotation is: (let ((.cse1 (= ~DC~0 ~s~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (not (= ~pended~0 1)))) (let ((.cse7 (= 0 main_~status~6)) (.cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (= main_~status~6 ~lowerDriverReturn~0) (<= ~compRegistered~0 0)))) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (<= ~IPC~0 ~s~0) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ main_~status~6 1073741789) 0)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse0 (<= ~NP~0 1) .cse6 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse6 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-18 11:40:22,358 INFO L428 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-11-18 11:40:22,358 INFO L425 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-11-18 11:40:22,358 INFO L425 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-11-18 11:40:22,358 INFO L425 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-11-18 11:40:22,358 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (= ~NP~0 ~s~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0)))) [2018-11-18 11:40:22,358 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-11-18 11:40:22,359 INFO L421 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0))) [2018-11-18 11:40:22,359 INFO L421 ceAbstractionStarter]: At program point L1055(lines 1054 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,359 INFO L425 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-11-18 11:40:22,359 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-11-18 11:40:22,359 INFO L421 ceAbstractionStarter]: At program point L1027(line 1027) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,359 INFO L425 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-11-18 11:40:22,359 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-11-18 11:40:22,359 INFO L425 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-11-18 11:40:22,359 INFO L421 ceAbstractionStarter]: At program point L1048(lines 1047 1070) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,359 INFO L421 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 1015 1099) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,359 INFO L421 ceAbstractionStarter]: At program point L1040(line 1040) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,360 INFO L421 ceAbstractionStarter]: At program point L1032(line 1032) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L421 ceAbstractionStarter]: At program point L1053(lines 1052 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L421 ceAbstractionStarter]: At program point L1067(lines 1023 1098) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-11-18 11:40:22,360 INFO L425 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L421 ceAbstractionStarter]: At program point L1092(line 1092) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,361 INFO L425 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L421 ceAbstractionStarter]: At program point L224(line 224) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,361 INFO L425 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L421 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 211 235) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,361 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,361 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-11-18 11:40:22,361 INFO L421 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse13 (< ~compRegistered~0 1)) (.cse9 (not (= 0 ~routine~0))) (.cse5 (= 1 ~pended~0)) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~MPR1~0 (+ ~NP~0 4))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (< 1 ~NP~0)) (.cse15 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (or .cse4 .cse10 .cse11 (< ~NP~0 1) (or .cse13 (or .cse9 .cse5 .cse14)) .cse12 .cse6 (not (= |old(~s~0)| ~MPR3~0)) .cse7 .cse8 .cse15)) (.cse2 (< 0 (+ ~myStatus~0 1073741637))) (.cse1 (not (= ~myStatus~0 0))) (.cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse12 .cse13 .cse14 (< |old(~s~0)| 1) .cse15))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse0 .cse2) (or .cse1 .cse3)))) [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L421 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse3 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse12 (< ~compRegistered~0 1)) (.cse8 (not (= 0 ~routine~0))) (.cse4 (= 1 ~pended~0)) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< 1 ~NP~0)) (.cse14 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (not (= ~myStatus~0 0))) (.cse15 (or .cse3 .cse9 .cse10 (< ~NP~0 1) (or .cse12 (or .cse8 .cse4 .cse13)) .cse11 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse6 .cse7 .cse14)) (.cse2 (< 0 (+ ~myStatus~0 1073741637)))) (and (or (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (let ((.cse1 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12 .cse13 (< |old(~s~0)| 1) .cse14))) (and (or .cse0 .cse1) (or .cse2 .cse1)))) (or .cse15 .cse0) (or .cse15 .cse2)))) [2018-11-18 11:40:22,362 INFO L425 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-11-18 11:40:22,362 INFO L421 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse25 (+ ~DC~0 5)) (.cse26 (+ ~SKIP1~0 2)) (.cse23 (+ ~NP~0 4)) (.cse27 (+ ~NP~0 5)) (.cse22 (+ ~DC~0 2)) (.cse21 (= ~NP~0 ~s~0)) (.cse24 (+ ~MPR3~0 1))) (let ((.cse19 (and (<= .cse25 ~IPC~0) (<= .cse26 ~MPR1~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= .cse23 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) (= ~routine~0 0) (<= .cse27 ~MPR3~0) (<= .cse22 ~SKIP2~0) .cse21 (<= ~s~0 1) (not (= ~pended~0 1)) (<= .cse24 ~IPC~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse20 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (< ~MPR3~0 .cse27)) (.cse13 (< ~MPR1~0 .cse26)) (.cse14 (< |old(~setEventCalled~0)| 1)) (.cse16 (< ~compRegistered~0 1)) (.cse12 (not (= 0 ~routine~0))) (.cse8 (= 1 ~pended~0)) (.cse17 (< ~IPC~0 .cse25)) (.cse15 (< ~IPC~0 .cse24)) (.cse9 (< ~MPR1~0 .cse23)) (.cse10 (< ~SKIP2~0 .cse22)) (.cse11 (< 1 ~NP~0)) (.cse18 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse5 (or .cse7 .cse13 .cse14 (< ~NP~0 1) (or .cse16 (or .cse12 .cse8 .cse17)) .cse15 .cse9 (not (= |old(~s~0)| ~MPR3~0)) .cse10 .cse11 .cse18)) (.cse4 (and .cse21 .cse20)) (.cse0 (and .cse19 .cse20)) (.cse3 (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0))) (.cse6 (< 0 (+ ~myStatus~0 1073741637))) (.cse2 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |old(~s~0)| ~NP~0)) .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~s~0)| 1) .cse18))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse1) (or .cse5 .cse6 .cse4) (or .cse0 .cse3 (or .cse6 .cse2)))))) [2018-11-18 11:40:22,363 INFO L421 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse25 (+ ~DC~0 5)) (.cse26 (+ ~SKIP1~0 2)) (.cse23 (+ ~NP~0 4)) (.cse27 (+ ~NP~0 5)) (.cse22 (+ ~DC~0 2)) (.cse21 (= ~NP~0 ~s~0)) (.cse24 (+ ~MPR3~0 1))) (let ((.cse19 (and (<= .cse25 ~IPC~0) (<= .cse26 ~MPR1~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= .cse23 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) (= ~routine~0 0) (<= .cse27 ~MPR3~0) (<= .cse22 ~SKIP2~0) .cse21 (<= ~s~0 1) (not (= ~pended~0 1)) (<= .cse24 ~IPC~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse20 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (< ~MPR3~0 .cse27)) (.cse13 (< ~MPR1~0 .cse26)) (.cse14 (< |old(~setEventCalled~0)| 1)) (.cse16 (< ~compRegistered~0 1)) (.cse12 (not (= 0 ~routine~0))) (.cse8 (= 1 ~pended~0)) (.cse17 (< ~IPC~0 .cse25)) (.cse15 (< ~IPC~0 .cse24)) (.cse9 (< ~MPR1~0 .cse23)) (.cse10 (< ~SKIP2~0 .cse22)) (.cse11 (< 1 ~NP~0)) (.cse18 (< 1 |old(~setEventCalled~0)|))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse5 (or .cse7 .cse13 .cse14 (< ~NP~0 1) (or .cse16 (or .cse12 .cse8 .cse17)) .cse15 .cse9 (not (= |old(~s~0)| ~MPR3~0)) .cse10 .cse11 .cse18)) (.cse4 (and .cse21 .cse20)) (.cse0 (and .cse19 .cse20)) (.cse3 (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0))) (.cse6 (< 0 (+ ~myStatus~0 1073741637))) (.cse2 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |old(~s~0)| ~NP~0)) .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~s~0)| 1) .cse18))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse1) (or .cse5 .cse6 .cse4) (or .cse0 .cse3 (or .cse6 .cse2)))))) [2018-11-18 11:40:22,363 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse14 (= 1 ~pended~0)) (.cse17 (< ~MPR1~0 (+ ~NP~0 4))) (.cse18 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse19 (< 1 ~NP~0)) (.cse13 (not (= 0 ~routine~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse16 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~compRegistered~0 1)) (.cse15 (< ~IPC~0 (+ ~DC~0 5))) (.cse20 (< 1 |old(~setEventCalled~0)|)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 1 ~setEventCalled~0)) (.cse8 (<= ~setEventCalled~0 1))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse4 (and (= ~NP~0 ~s~0) .cse6 .cse7 .cse8)) (.cse3 (or .cse9 .cse14 .cse17 .cse18 .cse19 .cse13 (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse16 .cse12 .cse15 (< |old(~s~0)| 1) .cse20)) (.cse1 (or .cse9 .cse10 .cse11 (< ~NP~0 1) (or .cse12 (or .cse13 .cse14 .cse15)) .cse16 .cse17 (not (= |old(~s~0)| ~MPR3~0)) .cse18 .cse19 .cse20)) (.cse5 (< 0 (+ ~myStatus~0 1073741637))) (.cse0 (and (= ~s~0 ~MPR3~0) .cse6 .cse7 .cse8))) (and (or .cse0 .cse1 .cse2) (or .cse2 .cse3 .cse4) (or .cse4 (or .cse5 .cse3)) (or .cse1 .cse5 .cse0)))) [2018-11-18 11:40:22,363 INFO L421 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (= |old(~s~0)| ~NP~0)) .cse0 (not (= ~compRegistered~0 0))) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-18 11:40:22,363 INFO L425 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-18 11:40:22,363 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (= ~NP~0 ~s~0)) (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) .cse0 (not (= ~compRegistered~0 0))))) [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L428 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-11-18 11:40:22,364 INFO L428 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L421 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (= |old(~customIrp~0)| ~customIrp~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 ~s~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~s~0 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0)))) [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-11-18 11:40:22,364 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 ~routine~0))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,365 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L421 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 186 210) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,365 INFO L421 ceAbstractionStarter]: At program point L206(line 206) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,365 INFO L425 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L425 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L421 ceAbstractionStarter]: At program point L199(line 199) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,365 INFO L425 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-11-18 11:40:22,365 INFO L421 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (and (<= 1 ~compRegistered~0) (not (= 259 DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,366 INFO L425 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-11-18 11:40:22,366 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-18 11:40:22,366 INFO L421 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (= ~routine~0 0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (= |old(~myStatus~0)| ~myStatus~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5 (not (= 259 DiskPerfStartDevice_~status~1))) (let ((.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< 1 ~NP~0)) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse16 (< ~IPC~0 (+ ~DC~0 5))) (.cse17 (< |old(~s~0)| 1)) (.cse18 (not (= |old(~customIrp~0)| 0)))) (and (or .cse6 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse6 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))))) [2018-11-18 11:40:22,366 INFO L421 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= |old(~myStatus~0)| ~myStatus~0)) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,366 INFO L421 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (= ~routine~0 0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (= |old(~myStatus~0)| ~myStatus~0))) (or (and (and (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5) (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5 (not (= 259 DiskPerfStartDevice_~status~1))) (let ((.cse6 (< ~MPR3~0 (+ ~NP~0 5))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< 1 ~NP~0)) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse16 (< ~IPC~0 (+ ~DC~0 5))) (.cse17 (< |old(~s~0)| 1)) (.cse18 (not (= |old(~customIrp~0)| 0)))) (and (or .cse6 (not (= |old(~myStatus~0)| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse6 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))))) [2018-11-18 11:40:22,366 INFO L421 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= |old(~myStatus~0)| ~myStatus~0)) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,366 INFO L425 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L421 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L421 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse13 (<= 1 ~compRegistered~0)) (.cse14 (= ~routine~0 0)) (.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse16 (= 259 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse17 (not (= ~pended~0 1))) (.cse18 (<= 1 ~setEventCalled~0)) (.cse19 (<= ~setEventCalled~0 1))) (or (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (and (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) (and .cse13 .cse14 (= ~NP~0 ~s~0) .cse15 .cse16 .cse17 .cse18 .cse19)) (and .cse13 .cse14 (= ~s~0 ~MPR3~0) .cse15 .cse16 .cse17 .cse18 .cse19))) [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-11-18 11:40:22,367 INFO L425 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-11-18 11:40:22,368 INFO L421 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (or (and (<= 1 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,368 INFO L421 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,368 INFO L425 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-11-18 11:40:22,368 INFO L425 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-11-18 11:40:22,368 INFO L421 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-18 11:40:22,368 INFO L425 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-11-18 11:40:22,368 INFO L425 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-11-18 11:40:22,368 INFO L421 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1))) (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (= ~NP~0 ~s~0) .cse1 .cse2 .cse3) (and (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3))) [2018-11-18 11:40:22,368 INFO L425 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L421 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L421 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-11-18 11:40:22,369 INFO L421 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,369 INFO L421 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5))) [2018-11-18 11:40:22,369 INFO L425 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L421 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0)))) [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L421 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5))) [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse4 (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0))) (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (and (= ~NP~0 ~s~0) .cse1 .cse2 .cse3) .cse4) (and (and (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3) .cse4))) [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-11-18 11:40:22,370 INFO L421 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,371 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-11-18 11:40:22,371 INFO L421 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse4 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0))) (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (and (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3) .cse4 (<= 0 DiskPerfRegisterDevice_~status~5)) (and (and (= ~NP~0 ~s~0) .cse1 .cse2 .cse3) .cse4))) [2018-11-18 11:40:22,371 INFO L425 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L421 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-11-18 11:40:22,372 INFO L421 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0)))) [2018-11-18 11:40:22,372 INFO L425 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-11-18 11:40:22,373 INFO L425 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-11-18 11:40:22,373 INFO L421 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse4 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse1 (not (= ~pended~0 1))) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1))) (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (and (and (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3) .cse4) (and .cse4 (and (= ~NP~0 ~s~0) .cse1 .cse2 .cse3)))) [2018-11-18 11:40:22,373 INFO L421 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0)))) [2018-11-18 11:40:22,373 INFO L425 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-18 11:40:22,373 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,373 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 403 410) no Hoare annotation was computed. [2018-11-18 11:40:22,373 INFO L425 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-11-18 11:40:22,373 INFO L421 ceAbstractionStarter]: At program point L403-3(lines 403 410) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,375 INFO L421 ceAbstractionStarter]: At program point L428(line 428) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-11-18 11:40:22,375 INFO L421 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 353 434) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-11-18 11:40:22,375 INFO L421 ceAbstractionStarter]: At program point L396(line 396) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-11-18 11:40:22,375 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-11-18 11:40:22,376 INFO L421 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (= ~pended~0 1)))) (or (and .cse0 (= 0 DiskPerfDeviceControl_~status~4) .cse1) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and .cse0 (<= (+ DiskPerfDeviceControl_~status~4 1073741789) 0) .cse1))) [2018-11-18 11:40:22,376 INFO L425 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-11-18 11:40:22,376 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-11-18 11:40:22,376 INFO L425 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-11-18 11:40:22,376 INFO L421 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= ~routine~0 0)) (.cse5 (= ~NP~0 ~s~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= ~pended~0 1))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (< 1 ~NP~0)) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse15 (< ~IPC~0 (+ ~DC~0 5))) (.cse16 (< |old(~s~0)| 1)) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 (and .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6 .cse7) .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-11-18 11:40:22,379 INFO L425 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-11-18 11:40:22,379 INFO L425 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-11-18 11:40:22,380 INFO L421 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse12 (<= 1 ~compRegistered~0)) (.cse13 (= ~routine~0 0)) (.cse14 (= ~NP~0 ~s~0)) (.cse16 (not (= ~pended~0 1))) (.cse24 (+ ~MPR3~0 1)) (.cse20 (+ ~SKIP1~0 2)) (.cse23 (+ ~DC~0 2)) (.cse21 (+ ~NP~0 4)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (< ~MPR3~0 .cse22)) (.cse11 (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2)) (.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 .cse21)) (.cse3 (< ~SKIP2~0 .cse23)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse20)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 .cse24)) (.cse10 (and (<= .cse20 ~MPR1~0) .cse12 (not (= 259 DiskPerfRemoveDevice_~status~2)) (<= 1 ~s~0) (<= .cse21 ~MPR1~0) (<= .cse22 ~MPR3~0) .cse13 (<= .cse23 ~SKIP2~0) .cse14 (<= ~s~0 1) .cse16 (<= .cse24 ~IPC~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse17 (< ~IPC~0 (+ ~DC~0 5))) (.cse18 (< |old(~s~0)| 1)) (.cse19 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 (= 0 ~myStatus~0) .cse14 .cse15 .cse16) .cse17 .cse18 .cse19) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse11 (= |old(~myStatus~0)| ~myStatus~0) .cse12 .cse13 .cse14 .cse15 .cse16) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse19)))) [2018-11-18 11:40:22,380 INFO L425 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-11-18 11:40:22,380 INFO L421 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= ~routine~0 0)) (.cse5 (= ~NP~0 ~s~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= ~pended~0 1))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (< 1 ~NP~0)) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse15 (< ~IPC~0 (+ ~DC~0 5))) (.cse16 (< |old(~s~0)| 1)) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 (and .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6 .cse7) .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-11-18 11:40:22,385 INFO L421 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 288 298) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-11-18 11:40:22,385 INFO L421 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-18 11:40:22,385 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-11-18 11:40:22,385 INFO L428 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-11-18 11:40:22,385 INFO L425 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-11-18 11:40:22,386 INFO L425 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-11-18 11:40:22,386 INFO L425 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-11-18 11:40:22,386 INFO L428 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-11-18 11:40:22,386 INFO L425 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-18 11:40:22,386 INFO L428 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-11-18 11:40:22,386 INFO L425 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-11-18 11:40:22,386 INFO L421 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse1 (not (= 0 ~routine~0))) (.cse3 (= 1 |old(~pended~0)|)) (.cse8 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse2 .cse3 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (let ((.cse6 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse7 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse6 0) (<= 0 .cse6) (<= (+ .cse7 1) 0) (<= 1 ~setEventCalled~0) (= |old(~s~0)| ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse7) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (not (= ~pended~0 1)) (<= ~setEventCalled~0 1)))) (or .cse1 .cse2 .cse3 .cse8 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or .cse1 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse8 .cse4 .cse5))) [2018-11-18 11:40:22,393 INFO L421 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (let ((.cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse7 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse6) (or (not (= ~myStatus~0 0)) .cse6))) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5))) [2018-11-18 11:40:22,393 INFO L421 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse2 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse4 (not (= ~compRegistered~0 0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or .cse1 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5 .cse6)))) [2018-11-18 11:40:22,394 INFO L425 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-11-18 11:40:22,394 INFO L421 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse0 (not (= 0 ~routine~0))) (.cse2 (= 1 |old(~pended~0)|)) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5) (or (let ((.cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse0 .cse1 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse6) (or (not (= ~myStatus~0 0)) .cse6))) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5))) [2018-11-18 11:40:22,399 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (let ((.cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse7 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse6) (or (not (= ~myStatus~0 0)) .cse6))) (and (= ~NP~0 ~s~0) .cse0)) (or .cse1 .cse7 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5))) [2018-11-18 11:40:22,399 INFO L425 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-11-18 11:40:22,399 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-11-18 11:40:22,399 INFO L425 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-11-18 11:40:22,400 INFO L425 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-11-18 11:40:22,400 INFO L421 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse17 (+ IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse8 (<= .cse17 0)) (.cse9 (<= 0 .cse17)) (.cse10 (= ~MPR1~0 ~s~0)) (.cse11 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494))) (.cse12 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse13 (<= (+ .cse16 1) 0)) (.cse14 (<= 1 ~setEventCalled~0)) (.cse15 (<= ~setEventCalled~0 1))) (or (let ((.cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse7 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse6) (or (not (= ~myStatus~0 0)) .cse6))) (or (and .cse8 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse0 .cse14 .cse15) (and .cse8 .cse9 .cse10 .cse11 (= 0 IofCallDriver_~returnVal2~0) .cse12 .cse13 .cse0 .cse14 .cse15)) (and (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse0 .cse14 .cse15) (= IofCallDriver_~returnVal2~0 259))))) (or .cse1 .cse7 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5))) [2018-11-18 11:40:22,400 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-11-18 11:40:22,400 INFO L425 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-11-18 11:40:22,404 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-11-18 11:40:22,404 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-11-18 11:40:22,404 INFO L421 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (let ((.cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse7 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse6) (or (not (= ~myStatus~0 0)) .cse6))) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5))) [2018-11-18 11:40:22,404 INFO L425 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L421 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse2 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse2 .cse3 (< ~compRegistered~0 1) .cse5 .cse6) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))) (.cse4 (not (= ~compRegistered~0 0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or .cse1 (not (= |old(~s~0)| ~NP~0)) .cse3 .cse4 .cse5 .cse6)))) [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L425 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-11-18 11:40:22,405 INFO L421 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (let ((.cse6 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse7 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse6) (or (not (= ~myStatus~0 0)) .cse6))) (let ((.cse8 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse9 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse8 0) (<= 0 .cse8) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse9) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse9 1) 0) .cse0 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or .cse1 .cse7 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5))) [2018-11-18 11:40:22,407 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-11-18 11:40:22,407 INFO L425 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-11-18 11:40:22,407 INFO L428 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-11-18 11:40:22,407 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-11-18 11:40:22,407 INFO L425 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L428 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L421 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (and (<= 1 ~compRegistered~0) (= ~DC~0 ~s~0) (not (= 259 DiskPerfDispatchPnp_~status~0)) (= ~routine~0 0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-11-18 11:40:22,408 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-18 11:40:22,415 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-11-18 11:40:22,415 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-18 11:40:22,415 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-11-18 11:40:22,415 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-18 11:40:22,415 INFO L421 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,416 INFO L421 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 11:40:22,416 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-11-18 11:40:22,416 INFO L421 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= |old(~myStatus~0)| ~myStatus~0)) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,416 INFO L421 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= |old(~myStatus~0)| ~myStatus~0)) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L421 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-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) [2018-11-18 11:40:22,420 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L421 ceAbstractionStarter]: At program point L448(line 448) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-11-18 11:40:22,420 INFO L425 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-11-18 11:40:22,421 INFO L425 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-11-18 11:40:22,421 INFO L421 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 435 452) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-11-18 11:40:22,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:40:22 BoogieIcfgContainer [2018-11-18 11:40:22,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:40:22,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:40:22,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:40:22,485 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:40:22,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:39:50" (3/4) ... [2018-11-18 11:40:22,489 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-11-18 11:40:22,496 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-11-18 11:40:22,497 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:40:22,498 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-11-18 11:40:22,511 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2018-11-18 11:40:22,512 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-18 11:40:22,513 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 11:40:22,514 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:40:22,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,540 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || (((((((1 <= NP && NP + 5 <= MPR3) && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,541 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp))) && (((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 0 < myStatus + 1073741637 || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-18 11:40:22,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp))) && (((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 0 < myStatus + 1073741637 || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-18 11:40:22,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-18 11:40:22,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 11:40:22,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-18 11:40:22,542 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || (((((((((compRetStatus + 1073741802 <= 0 && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) || (((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 11:40:22,543 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) || ((((1 <= compRegistered && DC == s) && !(259 == status)) && routine == 0) && !(pended == 1)) [2018-11-18 11:40:22,543 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,543 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 < myStatus + 1073741637 || ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0)) && (!(myStatus == 0) || ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0))) || (NP == s && !(pended == 1)) [2018-11-18 11:40:22,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1) || ((!(myStatus == 0) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (0 < myStatus + 1073741637 || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) [2018-11-18 11:40:22,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-18 11:40:22,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-18 11:40:22,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 11:40:22,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-11-18 11:40:22,544 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,545 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((((((((DC + 5 <= IPC && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC)) || (((((((((((((DC + 5 <= IPC && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP == s) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 11:40:22,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == compRegistered && routine == 0) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) && \old(myStatus) == myStatus) || ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) [2018-11-18 11:40:22,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) || ((((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && 0 == myStatus) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) [2018-11-18 11:40:22,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1)) [2018-11-18 11:40:22,548 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-18 11:40:22,548 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-11-18 11:40:22,635 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_71399e31-1459-47fd-a834-b810542b204a/bin-2019/uautomizer/witness.graphml [2018-11-18 11:40:22,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:40:22,636 INFO L168 Benchmark]: Toolchain (without parser) took 33509.07 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 982.0 MB). Free memory was 956.4 MB in the beginning and 866.6 MB in the end (delta: 89.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 11:40:22,637 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:40:22,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.93 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:22,637 INFO L168 Benchmark]: Boogie Preprocessor took 92.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -221.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:22,637 INFO L168 Benchmark]: RCFGBuilder took 671.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:22,638 INFO L168 Benchmark]: TraceAbstraction took 32274.53 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 827.3 MB). Free memory was 1.1 GB in the beginning and 889.4 MB in the end (delta: 165.8 MB). Peak memory consumption was 993.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:22,638 INFO L168 Benchmark]: Witness Printer took 150.28 ms. Allocated memory is still 2.0 GB. Free memory was 889.4 MB in the beginning and 866.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:40:22,640 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.93 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 926.9 MB in the beginning and 1.1 GB in the end (delta: -221.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 671.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32274.53 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 827.3 MB). Free memory was 1.1 GB in the beginning and 889.4 MB in the end (delta: 165.8 MB). Peak memory consumption was 993.1 MB. Max. memory is 11.5 GB. * Witness Printer took 150.28 ms. Allocated memory is still 2.0 GB. Free memory was 889.4 MB in the beginning and 866.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 1000]: Loop Invariant Derived loop invariant: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp))) && (((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 0 < myStatus + 1073741637 || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp))) && (((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || 0 < myStatus + 1073741637 || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 845]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1) || ((!(myStatus == 0) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (0 < myStatus + 1073741637 || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || (((((((1 <= NP && NP + 5 <= MPR3) && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 716]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((((((((DC + 5 <= IPC && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC)) || (((((((((((((DC + 5 <= IPC && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && NP + 4 <= MPR1) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && 0 == myStatus) && NP == s) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 843]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && ((((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || (((((((((compRetStatus + 1073741802 <= 0 && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) || (((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || (((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && returnVal2 == 259))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1)) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) || ((((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && 0 == myStatus) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) || ((((1 <= compRegistered && DC == s) && !(259 == status)) && routine == 0) && !(pended == 1)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((0 == compRegistered && routine == 0) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) && \old(myStatus) == myStatus) || ((((((((((((((MPR3 < NP + 5 || !(\old(myStatus) == 0)) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0)) && (((((((((((((MPR3 < NP + 5 || 0 < \old(myStatus) + 1073741637) || 1 == \old(pended)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || IPC < MPR3 + 1) || IPC < DC + 5) || \old(s) < 1) || !(\old(customIrp) == 0))) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: ((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((0 < myStatus + 1073741637 || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) && (!(myStatus == 0) || (((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: ((0 < myStatus + 1073741637 || ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0)) && (!(myStatus == 0) || ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 1 < NP) || \old(s) < 1) || !(\old(customIrp) == 0))) || (NP == s && !(pended == 1)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 308 locations, 1 error locations. SAFE Result, 32.1s OverallTime, 48 OverallIterations, 4 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 15.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 14291 SDtfs, 8847 SDslu, 36135 SDs, 0 SdLazy, 16906 SolverSat, 2142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 295 SyntacticMatches, 18 SemanticMatches, 329 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1044occurred in iteration=6, 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.4s AutomataMinimizationTime, 48 MinimizatonAttempts, 2502 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4869 PreInvPairs, 5114 NumberOfFragments, 13947 HoareAnnotationTreeSize, 4869 FomulaSimplifications, 291573 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 109 FomulaSimplificationsInter, 222613 FormulaSimplificationTreeSizeReductionInter, 13.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 3628 NumberOfCodeBlocks, 3628 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3579 ConstructedInterpolants, 0 QuantifiedInterpolants, 526215 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 49 InterpolantComputations, 48 PerfectInterpolantSequences, 640/646 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...