./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_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/config/TaipanReach.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_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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 15:45:59,581 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:45:59,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:45:59,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:45:59,589 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:45:59,590 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:45:59,591 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:45:59,592 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:45:59,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:45:59,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:45:59,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:45:59,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:45:59,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:45:59,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:45:59,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:45:59,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:45:59,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:45:59,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:45:59,600 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:45:59,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:45:59,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:45:59,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:45:59,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:45:59,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:45:59,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:45:59,605 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:45:59,606 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:45:59,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:45:59,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:45:59,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:45:59,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:45:59,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:45:59,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:45:59,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:45:59,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:45:59,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:45:59,611 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:45:59,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:45:59,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:45:59,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:45:59,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:45:59,622 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:45:59,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:45:59,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:45:59,623 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:45:59,623 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:45:59,623 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:45:59,623 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:45:59,623 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:45:59,624 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:45:59,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:45:59,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:45:59,625 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:45:59,625 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:45:59,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:45:59,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:45:59,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:45:59,625 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-11-18 15:45:59,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:45:59,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:45:59,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:45:59,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:45:59,660 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:45:59,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 15:45:59,706 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/data/970d42999/56b9eaba6b944e9d94b187076511dad1/FLAG57b4050ae [2018-11-18 15:46:00,154 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:46:00,154 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 15:46:00,164 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/data/970d42999/56b9eaba6b944e9d94b187076511dad1/FLAG57b4050ae [2018-11-18 15:46:00,174 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/data/970d42999/56b9eaba6b944e9d94b187076511dad1 [2018-11-18 15:46:00,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:46:00,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:46:00,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:46:00,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:46:00,180 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:46:00,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,182 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 03:46:00, skipping insertion in model container [2018-11-18 15:46:00,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:46:00,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:46:00,419 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:46:00,422 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:46:00,486 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:46:00,499 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:46:00,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00 WrapperNode [2018-11-18 15:46:00,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:46:00,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:46:00,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:46:00,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:46:00,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:46:00,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:46:00,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:46:00,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:46:00,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... [2018-11-18 15:46:00,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:46:00,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:46:00,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:46:00,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:46:00,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:46:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-18 15:46:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-18 15:46:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:46:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:46:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-11-18 15:46:00,659 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-11-18 15:46:00,659 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-18 15:46:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-18 15:46:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-18 15:46:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-18 15:46:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-11-18 15:46:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-11-18 15:46:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-18 15:46:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-18 15:46:00,660 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-18 15:46:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-18 15:46:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-18 15:46:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-18 15:46:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-18 15:46:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-18 15:46:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-18 15:46:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-18 15:46:00,661 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-11-18 15:46:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-11-18 15:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-11-18 15:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-11-18 15:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-11-18 15:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-11-18 15:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-11-18 15:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-11-18 15:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-11-18 15:46:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-11-18 15:46:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-11-18 15:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-11-18 15:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-11-18 15:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-11-18 15:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-18 15:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-18 15:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-11-18 15:46:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-11-18 15:46:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-18 15:46:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-18 15:46:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-11-18 15:46:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-11-18 15:46:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-11-18 15:46:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-11-18 15:46:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-11-18 15:46:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-11-18 15:46:00,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:46:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:46:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:46:00,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:46:00,665 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-11-18 15:46:00,665 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-11-18 15:46:00,844 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:46:00,844 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:46:00,943 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:46:00,943 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:46:01,022 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:46:01,022 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:46:01,045 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:46:01,045 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:46:01,214 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:46:01,214 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:46:01,286 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 15:46:01,286 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 15:46:01,321 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:46:01,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:46:01 BoogieIcfgContainer [2018-11-18 15:46:01,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:46:01,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:46:01,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:46:01,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:46:01,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:46:00" (1/3) ... [2018-11-18 15:46:01,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f8482e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:46:01, skipping insertion in model container [2018-11-18 15:46:01,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:46:00" (2/3) ... [2018-11-18 15:46:01,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f8482e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:46:01, skipping insertion in model container [2018-11-18 15:46:01,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:46:01" (3/3) ... [2018-11-18 15:46:01,326 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-18 15:46:01,333 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:46:01,338 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:46:01,348 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:46:01,370 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:46:01,370 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:46:01,370 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:46:01,370 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:46:01,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:46:01,371 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:46:01,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:46:01,371 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:46:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2018-11-18 15:46:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 15:46:01,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:01,395 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 15:46:01,397 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:01,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 429432298, now seen corresponding path program 1 times [2018-11-18 15:46:01,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:01,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:01,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:01,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:01,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:01,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:01,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:01,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:01,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:01,571 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 3 states. [2018-11-18 15:46:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:01,691 INFO L93 Difference]: Finished difference Result 538 states and 781 transitions. [2018-11-18 15:46:01,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:01,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 15:46:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:01,703 INFO L225 Difference]: With dead ends: 538 [2018-11-18 15:46:01,704 INFO L226 Difference]: Without dead ends: 288 [2018-11-18 15:46:01,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-18 15:46:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-11-18 15:46:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 15:46:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-11-18 15:46:01,757 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 20 [2018-11-18 15:46:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:01,757 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-11-18 15:46:01,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-11-18 15:46:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 15:46:01,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:01,759 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 15:46:01,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:01,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:01,759 INFO L82 PathProgramCache]: Analyzing trace with hash 225350788, now seen corresponding path program 1 times [2018-11-18 15:46:01,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:01,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:01,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:01,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:01,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:01,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 15:46:01,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:01,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:01,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:01,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:01,862 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 3 states. [2018-11-18 15:46:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,012 INFO L93 Difference]: Finished difference Result 638 states and 883 transitions. [2018-11-18 15:46:02,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:02,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 15:46:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,017 INFO L225 Difference]: With dead ends: 638 [2018-11-18 15:46:02,017 INFO L226 Difference]: Without dead ends: 455 [2018-11-18 15:46:02,019 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 15:46:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-18 15:46:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 435. [2018-11-18 15:46:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-11-18 15:46:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 598 transitions. [2018-11-18 15:46:02,055 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 598 transitions. Word has length 25 [2018-11-18 15:46:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:02,056 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 598 transitions. [2018-11-18 15:46:02,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 598 transitions. [2018-11-18 15:46:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 15:46:02,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:02,057 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:02,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:02,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash -83832399, now seen corresponding path program 1 times [2018-11-18 15:46:02,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:02,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:02,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:02,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:02,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:02,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:02,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:02,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,121 INFO L87 Difference]: Start difference. First operand 435 states and 598 transitions. Second operand 3 states. [2018-11-18 15:46:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,169 INFO L93 Difference]: Finished difference Result 964 states and 1384 transitions. [2018-11-18 15:46:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:02,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 15:46:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,175 INFO L225 Difference]: With dead ends: 964 [2018-11-18 15:46:02,175 INFO L226 Difference]: Without dead ends: 647 [2018-11-18 15:46:02,177 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 15:46:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-11-18 15:46:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 607. [2018-11-18 15:46:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-18 15:46:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 868 transitions. [2018-11-18 15:46:02,218 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 868 transitions. Word has length 31 [2018-11-18 15:46:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:02,218 INFO L480 AbstractCegarLoop]: Abstraction has 607 states and 868 transitions. [2018-11-18 15:46:02,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 868 transitions. [2018-11-18 15:46:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 15:46:02,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:02,220 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:02,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:02,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash -240377485, now seen corresponding path program 1 times [2018-11-18 15:46:02,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:02,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:02,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:02,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,274 INFO L87 Difference]: Start difference. First operand 607 states and 868 transitions. Second operand 3 states. [2018-11-18 15:46:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,347 INFO L93 Difference]: Finished difference Result 622 states and 888 transitions. [2018-11-18 15:46:02,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:02,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-18 15:46:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,355 INFO L225 Difference]: With dead ends: 622 [2018-11-18 15:46:02,355 INFO L226 Difference]: Without dead ends: 618 [2018-11-18 15:46:02,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-18 15:46:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 617. [2018-11-18 15:46:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 15:46:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 881 transitions. [2018-11-18 15:46:02,387 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 881 transitions. Word has length 36 [2018-11-18 15:46:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:02,387 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 881 transitions. [2018-11-18 15:46:02,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 881 transitions. [2018-11-18 15:46:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 15:46:02,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:02,389 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 15:46:02,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:02,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash -875576041, now seen corresponding path program 1 times [2018-11-18 15:46:02,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:02,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:02,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:02,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:02,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:02,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,444 INFO L87 Difference]: Start difference. First operand 617 states and 881 transitions. Second operand 3 states. [2018-11-18 15:46:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,515 INFO L93 Difference]: Finished difference Result 1073 states and 1584 transitions. [2018-11-18 15:46:02,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:02,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 15:46:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,521 INFO L225 Difference]: With dead ends: 1073 [2018-11-18 15:46:02,521 INFO L226 Difference]: Without dead ends: 1054 [2018-11-18 15:46:02,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-11-18 15:46:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1024. [2018-11-18 15:46:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-18 15:46:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1525 transitions. [2018-11-18 15:46:02,570 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1525 transitions. Word has length 39 [2018-11-18 15:46:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:02,570 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1525 transitions. [2018-11-18 15:46:02,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1525 transitions. [2018-11-18 15:46:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 15:46:02,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:02,572 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 15:46:02,572 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:02,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash -889920950, now seen corresponding path program 1 times [2018-11-18 15:46:02,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:02,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:02,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:02,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:02,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:02,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:02,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:02,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,610 INFO L87 Difference]: Start difference. First operand 1024 states and 1525 transitions. Second operand 3 states. [2018-11-18 15:46:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,694 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2018-11-18 15:46:02,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:02,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 15:46:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,699 INFO L225 Difference]: With dead ends: 1051 [2018-11-18 15:46:02,699 INFO L226 Difference]: Without dead ends: 1046 [2018-11-18 15:46:02,700 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2018-11-18 15:46:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2018-11-18 15:46:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-11-18 15:46:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1547 transitions. [2018-11-18 15:46:02,743 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1547 transitions. Word has length 39 [2018-11-18 15:46:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:02,744 INFO L480 AbstractCegarLoop]: Abstraction has 1044 states and 1547 transitions. [2018-11-18 15:46:02,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1547 transitions. [2018-11-18 15:46:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 15:46:02,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:02,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] [2018-11-18 15:46:02,745 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:02,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1365020206, now seen corresponding path program 1 times [2018-11-18 15:46:02,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:02,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:02,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:02,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:02,783 INFO L87 Difference]: Start difference. First operand 1044 states and 1547 transitions. Second operand 5 states. [2018-11-18 15:46:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,832 INFO L93 Difference]: Finished difference Result 1059 states and 1565 transitions. [2018-11-18 15:46:02,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:02,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-18 15:46:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,838 INFO L225 Difference]: With dead ends: 1059 [2018-11-18 15:46:02,838 INFO L226 Difference]: Without dead ends: 1037 [2018-11-18 15:46:02,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-11-18 15:46:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2018-11-18 15:46:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-11-18 15:46:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1538 transitions. [2018-11-18 15:46:02,882 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1538 transitions. Word has length 40 [2018-11-18 15:46:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:02,882 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1538 transitions. [2018-11-18 15:46:02,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1538 transitions. [2018-11-18 15:46:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 15:46:02,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:02,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] [2018-11-18 15:46:02,884 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:02,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1503467214, now seen corresponding path program 1 times [2018-11-18 15:46:02,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:02,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:02,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:02,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:02,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,923 INFO L87 Difference]: Start difference. First operand 1037 states and 1538 transitions. Second operand 3 states. [2018-11-18 15:46:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:02,970 INFO L93 Difference]: Finished difference Result 1449 states and 2196 transitions. [2018-11-18 15:46:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:02,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-18 15:46:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:02,973 INFO L225 Difference]: With dead ends: 1449 [2018-11-18 15:46:02,974 INFO L226 Difference]: Without dead ends: 579 [2018-11-18 15:46:02,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-11-18 15:46:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2018-11-18 15:46:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 15:46:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 824 transitions. [2018-11-18 15:46:03,004 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 824 transitions. Word has length 45 [2018-11-18 15:46:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:03,005 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 824 transitions. [2018-11-18 15:46:03,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 824 transitions. [2018-11-18 15:46:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 15:46:03,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:03,006 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 15:46:03,006 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:03,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1198649482, now seen corresponding path program 1 times [2018-11-18 15:46:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:03,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:03,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:03,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:03,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:03,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:03,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:03,050 INFO L87 Difference]: Start difference. First operand 579 states and 824 transitions. Second operand 5 states. [2018-11-18 15:46:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:03,380 INFO L93 Difference]: Finished difference Result 587 states and 830 transitions. [2018-11-18 15:46:03,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:03,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-18 15:46:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:03,386 INFO L225 Difference]: With dead ends: 587 [2018-11-18 15:46:03,386 INFO L226 Difference]: Without dead ends: 581 [2018-11-18 15:46:03,387 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 15:46:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-11-18 15:46:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2018-11-18 15:46:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 15:46:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 823 transitions. [2018-11-18 15:46:03,414 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 823 transitions. Word has length 44 [2018-11-18 15:46:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:03,415 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 823 transitions. [2018-11-18 15:46:03,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 823 transitions. [2018-11-18 15:46:03,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 15:46:03,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:03,416 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 15:46:03,416 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:03,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:03,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1909267454, now seen corresponding path program 1 times [2018-11-18 15:46:03,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:03,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:03,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:03,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:03,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:03,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:03,480 INFO L87 Difference]: Start difference. First operand 579 states and 823 transitions. Second operand 5 states. [2018-11-18 15:46:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:03,778 INFO L93 Difference]: Finished difference Result 587 states and 829 transitions. [2018-11-18 15:46:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:03,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-18 15:46:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:03,781 INFO L225 Difference]: With dead ends: 587 [2018-11-18 15:46:03,781 INFO L226 Difference]: Without dead ends: 581 [2018-11-18 15:46:03,782 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 15:46:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-11-18 15:46:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2018-11-18 15:46:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-11-18 15:46:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 822 transitions. [2018-11-18 15:46:03,813 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 822 transitions. Word has length 45 [2018-11-18 15:46:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:03,814 INFO L480 AbstractCegarLoop]: Abstraction has 579 states and 822 transitions. [2018-11-18 15:46:03,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 822 transitions. [2018-11-18 15:46:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 15:46:03,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:03,815 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:03,815 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:03,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash -887211853, now seen corresponding path program 1 times [2018-11-18 15:46:03,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:03,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:03,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:03,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:03,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:03,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:03,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:03,858 INFO L87 Difference]: Start difference. First operand 579 states and 822 transitions. Second operand 6 states. [2018-11-18 15:46:03,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:03,924 INFO L93 Difference]: Finished difference Result 602 states and 847 transitions. [2018-11-18 15:46:03,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:46:03,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-18 15:46:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:03,928 INFO L225 Difference]: With dead ends: 602 [2018-11-18 15:46:03,928 INFO L226 Difference]: Without dead ends: 577 [2018-11-18 15:46:03,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-11-18 15:46:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2018-11-18 15:46:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-11-18 15:46:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 817 transitions. [2018-11-18 15:46:03,962 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 817 transitions. Word has length 46 [2018-11-18 15:46:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:03,962 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 817 transitions. [2018-11-18 15:46:03,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 817 transitions. [2018-11-18 15:46:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 15:46:03,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:03,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, 1, 1] [2018-11-18 15:46:03,964 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:03,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1026645117, now seen corresponding path program 1 times [2018-11-18 15:46:03,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:03,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:03,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:04,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:04,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:04,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:04,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:04,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:04,026 INFO L87 Difference]: Start difference. First operand 577 states and 817 transitions. Second operand 3 states. [2018-11-18 15:46:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:04,166 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2018-11-18 15:46:04,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:04,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-18 15:46:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:04,171 INFO L225 Difference]: With dead ends: 811 [2018-11-18 15:46:04,172 INFO L226 Difference]: Without dead ends: 803 [2018-11-18 15:46:04,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-18 15:46:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 646. [2018-11-18 15:46:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-18 15:46:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 920 transitions. [2018-11-18 15:46:04,211 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 920 transitions. Word has length 46 [2018-11-18 15:46:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:04,212 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 920 transitions. [2018-11-18 15:46:04,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 920 transitions. [2018-11-18 15:46:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:46:04,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:04,213 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:04,213 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:04,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1292709670, now seen corresponding path program 1 times [2018-11-18 15:46:04,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:04,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:04,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:04,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:46:04,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:04,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:46:04,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:46:04,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:46:04,269 INFO L87 Difference]: Start difference. First operand 646 states and 920 transitions. Second operand 4 states. [2018-11-18 15:46:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:04,427 INFO L93 Difference]: Finished difference Result 720 states and 993 transitions. [2018-11-18 15:46:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:46:04,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 15:46:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:04,430 INFO L225 Difference]: With dead ends: 720 [2018-11-18 15:46:04,430 INFO L226 Difference]: Without dead ends: 453 [2018-11-18 15:46:04,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:46:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-18 15:46:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 432. [2018-11-18 15:46:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-11-18 15:46:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 564 transitions. [2018-11-18 15:46:04,455 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 564 transitions. Word has length 49 [2018-11-18 15:46:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:04,455 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 564 transitions. [2018-11-18 15:46:04,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:46:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 564 transitions. [2018-11-18 15:46:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 15:46:04,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:04,456 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 15:46:04,456 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:04,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1308225257, now seen corresponding path program 1 times [2018-11-18 15:46:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:04,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:46:04,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:04,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:46:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:04,511 INFO L87 Difference]: Start difference. First operand 432 states and 564 transitions. Second operand 8 states. [2018-11-18 15:46:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:04,653 INFO L93 Difference]: Finished difference Result 448 states and 583 transitions. [2018-11-18 15:46:04,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:46:04,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-18 15:46:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:04,655 INFO L225 Difference]: With dead ends: 448 [2018-11-18 15:46:04,656 INFO L226 Difference]: Without dead ends: 444 [2018-11-18 15:46:04,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:46:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-18 15:46:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 440. [2018-11-18 15:46:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-11-18 15:46:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 575 transitions. [2018-11-18 15:46:04,678 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 575 transitions. Word has length 47 [2018-11-18 15:46:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:04,678 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 575 transitions. [2018-11-18 15:46:04,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:46:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 575 transitions. [2018-11-18 15:46:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 15:46:04,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:04,679 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 15:46:04,679 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:04,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1308502087, now seen corresponding path program 1 times [2018-11-18 15:46:04,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:04,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:04,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:04,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:46:04,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:04,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:46:04,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:04,732 INFO L87 Difference]: Start difference. First operand 440 states and 575 transitions. Second operand 8 states. [2018-11-18 15:46:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:04,830 INFO L93 Difference]: Finished difference Result 761 states and 1041 transitions. [2018-11-18 15:46:04,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:46:04,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-18 15:46:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:04,834 INFO L225 Difference]: With dead ends: 761 [2018-11-18 15:46:04,834 INFO L226 Difference]: Without dead ends: 463 [2018-11-18 15:46:04,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:46:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-18 15:46:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2018-11-18 15:46:04,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-11-18 15:46:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 590 transitions. [2018-11-18 15:46:04,861 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 590 transitions. Word has length 47 [2018-11-18 15:46:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:04,862 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 590 transitions. [2018-11-18 15:46:04,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:46:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 590 transitions. [2018-11-18 15:46:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 15:46:04,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:04,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:04,863 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:04,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1006934223, now seen corresponding path program 1 times [2018-11-18 15:46:04,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:04,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:04,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:04,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:04,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:04,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:04,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:04,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:04,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:04,942 INFO L87 Difference]: Start difference. First operand 450 states and 590 transitions. Second operand 5 states. [2018-11-18 15:46:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:05,332 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-11-18 15:46:05,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:05,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 15:46:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:05,335 INFO L225 Difference]: With dead ends: 581 [2018-11-18 15:46:05,335 INFO L226 Difference]: Without dead ends: 562 [2018-11-18 15:46:05,336 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 15:46:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-18 15:46:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 435. [2018-11-18 15:46:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-11-18 15:46:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 569 transitions. [2018-11-18 15:46:05,360 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 569 transitions. Word has length 48 [2018-11-18 15:46:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:05,360 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 569 transitions. [2018-11-18 15:46:05,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 569 transitions. [2018-11-18 15:46:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 15:46:05,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:05,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:05,361 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:05,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash -436243832, now seen corresponding path program 1 times [2018-11-18 15:46:05,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:05,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:05,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:05,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:46:05,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:05,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:46:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:05,436 INFO L87 Difference]: Start difference. First operand 435 states and 569 transitions. Second operand 8 states. [2018-11-18 15:46:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:05,565 INFO L93 Difference]: Finished difference Result 449 states and 585 transitions. [2018-11-18 15:46:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:46:05,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-18 15:46:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:05,568 INFO L225 Difference]: With dead ends: 449 [2018-11-18 15:46:05,568 INFO L226 Difference]: Without dead ends: 418 [2018-11-18 15:46:05,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:46:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-18 15:46:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-11-18 15:46:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-11-18 15:46:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 548 transitions. [2018-11-18 15:46:05,594 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 548 transitions. Word has length 49 [2018-11-18 15:46:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:05,594 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 548 transitions. [2018-11-18 15:46:05,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:46:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 548 transitions. [2018-11-18 15:46:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 15:46:05,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:05,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:05,597 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:05,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1552038808, now seen corresponding path program 1 times [2018-11-18 15:46:05,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:05,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:05,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:05,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:46:05,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:05,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:46:05,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:05,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:05,657 INFO L87 Difference]: Start difference. First operand 418 states and 548 transitions. Second operand 8 states. [2018-11-18 15:46:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:05,759 INFO L93 Difference]: Finished difference Result 448 states and 586 transitions. [2018-11-18 15:46:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:46:05,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 15:46:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:05,763 INFO L225 Difference]: With dead ends: 448 [2018-11-18 15:46:05,763 INFO L226 Difference]: Without dead ends: 427 [2018-11-18 15:46:05,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:46:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-18 15:46:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2018-11-18 15:46:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-18 15:46:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 551 transitions. [2018-11-18 15:46:05,787 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 551 transitions. Word has length 50 [2018-11-18 15:46:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:05,788 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 551 transitions. [2018-11-18 15:46:05,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:46:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2018-11-18 15:46:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 15:46:05,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:05,789 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:05,789 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:05,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:05,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1495835486, now seen corresponding path program 1 times [2018-11-18 15:46:05,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:05,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:05,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:05,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:05,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:05,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:05,826 INFO L87 Difference]: Start difference. First operand 419 states and 551 transitions. Second operand 6 states. [2018-11-18 15:46:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:05,881 INFO L93 Difference]: Finished difference Result 434 states and 567 transitions. [2018-11-18 15:46:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:05,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-18 15:46:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:05,884 INFO L225 Difference]: With dead ends: 434 [2018-11-18 15:46:05,884 INFO L226 Difference]: Without dead ends: 400 [2018-11-18 15:46:05,884 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-11-18 15:46:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-11-18 15:46:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-18 15:46:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-11-18 15:46:05,905 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 51 [2018-11-18 15:46:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:05,905 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-11-18 15:46:05,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-11-18 15:46:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 15:46:05,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:05,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:05,906 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:05,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash -569080051, now seen corresponding path program 1 times [2018-11-18 15:46:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:05,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:05,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:05,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:05,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:46:05,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:05,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:46:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:46:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:46:05,951 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-11-18 15:46:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:06,005 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-11-18 15:46:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:46:06,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-18 15:46:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:06,007 INFO L225 Difference]: With dead ends: 436 [2018-11-18 15:46:06,007 INFO L226 Difference]: Without dead ends: 410 [2018-11-18 15:46:06,008 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 15:46:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-18 15:46:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-11-18 15:46:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-18 15:46:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-11-18 15:46:06,028 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-11-18 15:46:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:06,028 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-11-18 15:46:06,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:46:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-11-18 15:46:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 15:46:06,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:06,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:06,029 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:06,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1731742539, now seen corresponding path program 1 times [2018-11-18 15:46:06,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:06,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:06,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:06,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:06,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:06,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:46:06,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:06,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:46:06,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:46:06,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:06,093 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-11-18 15:46:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:06,680 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-11-18 15:46:06,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 15:46:06,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-18 15:46:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:06,683 INFO L225 Difference]: With dead ends: 565 [2018-11-18 15:46:06,683 INFO L226 Difference]: Without dead ends: 511 [2018-11-18 15:46:06,683 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:46:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-18 15:46:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-11-18 15:46:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-18 15:46:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-11-18 15:46:06,714 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-11-18 15:46:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:06,714 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-11-18 15:46:06,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:46:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-11-18 15:46:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 15:46:06,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:06,715 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:06,715 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:06,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1878435341, now seen corresponding path program 1 times [2018-11-18 15:46:06,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:06,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:06,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:06,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:06,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:06,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:06,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:06,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:06,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:06,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:06,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:06,750 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-11-18 15:46:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:06,860 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-11-18 15:46:06,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:06,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-18 15:46:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:06,866 INFO L225 Difference]: With dead ends: 673 [2018-11-18 15:46:06,867 INFO L226 Difference]: Without dead ends: 659 [2018-11-18 15:46:06,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-18 15:46:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-11-18 15:46:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-11-18 15:46:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-11-18 15:46:06,909 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-11-18 15:46:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:06,909 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-11-18 15:46:06,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-11-18 15:46:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 15:46:06,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:06,910 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:06,910 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:06,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1445321105, now seen corresponding path program 1 times [2018-11-18 15:46:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:06,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:06,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:06,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:46:06,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:46:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:46:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:46:06,978 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-11-18 15:46:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:07,052 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-11-18 15:46:07,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:46:07,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-18 15:46:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:07,054 INFO L225 Difference]: With dead ends: 598 [2018-11-18 15:46:07,055 INFO L226 Difference]: Without dead ends: 574 [2018-11-18 15:46:07,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:46:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-18 15:46:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-18 15:46:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-18 15:46:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-11-18 15:46:07,093 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-11-18 15:46:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:07,093 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-11-18 15:46:07,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:46:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-11-18 15:46:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 15:46:07,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:07,094 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:07,094 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:07,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash -794377348, now seen corresponding path program 1 times [2018-11-18 15:46:07,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:07,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:07,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:07,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:07,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:07,146 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-11-18 15:46:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:07,553 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-11-18 15:46:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:07,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-18 15:46:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:07,556 INFO L225 Difference]: With dead ends: 660 [2018-11-18 15:46:07,556 INFO L226 Difference]: Without dead ends: 624 [2018-11-18 15:46:07,556 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 15:46:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-18 15:46:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-11-18 15:46:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-18 15:46:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-18 15:46:07,580 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-11-18 15:46:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:07,581 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-18 15:46:07,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-11-18 15:46:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 15:46:07,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:07,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:07,582 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:07,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1440018469, now seen corresponding path program 1 times [2018-11-18 15:46:07,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:07,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:07,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:07,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:07,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:07,623 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-11-18 15:46:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:07,670 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-11-18 15:46:07,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:07,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-18 15:46:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:07,673 INFO L225 Difference]: With dead ends: 955 [2018-11-18 15:46:07,673 INFO L226 Difference]: Without dead ends: 527 [2018-11-18 15:46:07,675 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-11-18 15:46:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-11-18 15:46:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-18 15:46:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-11-18 15:46:07,699 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-11-18 15:46:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:07,699 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-11-18 15:46:07,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-11-18 15:46:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 15:46:07,700 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:07,700 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:07,701 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:07,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:07,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2077815681, now seen corresponding path program 1 times [2018-11-18 15:46:07,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:07,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:07,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:07,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 15:46:07,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:07,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 15:46:07,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:46:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:46:07,773 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-11-18 15:46:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:07,890 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-11-18 15:46:07,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:46:07,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-18 15:46:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:07,893 INFO L225 Difference]: With dead ends: 529 [2018-11-18 15:46:07,893 INFO L226 Difference]: Without dead ends: 466 [2018-11-18 15:46:07,893 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 15:46:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-18 15:46:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-11-18 15:46:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-18 15:46:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-11-18 15:46:07,912 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-11-18 15:46:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:07,912 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-11-18 15:46:07,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 15:46:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-11-18 15:46:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 15:46:07,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:07,913 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:07,913 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:07,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash -578455382, now seen corresponding path program 1 times [2018-11-18 15:46:07,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:07,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:07,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:07,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:07,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:07,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:07,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:07,949 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-11-18 15:46:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:07,989 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-11-18 15:46:07,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:07,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-18 15:46:07,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:07,992 INFO L225 Difference]: With dead ends: 918 [2018-11-18 15:46:07,992 INFO L226 Difference]: Without dead ends: 491 [2018-11-18 15:46:07,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-18 15:46:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-11-18 15:46:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-18 15:46:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-11-18 15:46:08,013 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-11-18 15:46:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:08,013 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-11-18 15:46:08,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-11-18 15:46:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 15:46:08,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:08,014 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:08,014 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:08,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:08,015 INFO L82 PathProgramCache]: Analyzing trace with hash 508562008, now seen corresponding path program 1 times [2018-11-18 15:46:08,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:08,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:08,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:08,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:08,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:08,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:08,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:08,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:08,049 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-11-18 15:46:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:08,107 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-11-18 15:46:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:08,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 15:46:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:08,110 INFO L225 Difference]: With dead ends: 730 [2018-11-18 15:46:08,110 INFO L226 Difference]: Without dead ends: 727 [2018-11-18 15:46:08,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-18 15:46:08,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-11-18 15:46:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-18 15:46:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-11-18 15:46:08,134 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-11-18 15:46:08,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:08,135 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-11-18 15:46:08,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:08,135 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-11-18 15:46:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 15:46:08,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:08,135 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:08,136 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:08,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash -694649581, now seen corresponding path program 1 times [2018-11-18 15:46:08,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:08,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:08,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:08,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:08,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:08,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:08,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:08,239 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-11-18 15:46:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:08,278 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-11-18 15:46:08,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:08,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-18 15:46:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:08,280 INFO L225 Difference]: With dead ends: 755 [2018-11-18 15:46:08,280 INFO L226 Difference]: Without dead ends: 312 [2018-11-18 15:46:08,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:08,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-18 15:46:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-11-18 15:46:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-18 15:46:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-11-18 15:46:08,301 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-11-18 15:46:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:08,301 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-11-18 15:46:08,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-11-18 15:46:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 15:46:08,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:08,302 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 15:46:08,303 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:08,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:08,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1195536780, now seen corresponding path program 1 times [2018-11-18 15:46:08,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:08,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:08,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:08,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:08,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:08,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:08,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:08,346 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-11-18 15:46:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:08,482 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-11-18 15:46:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:46:08,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-18 15:46:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:08,484 INFO L225 Difference]: With dead ends: 579 [2018-11-18 15:46:08,484 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 15:46:08,486 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 15:46:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 15:46:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-18 15:46:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 15:46:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-11-18 15:46:08,504 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-11-18 15:46:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:08,504 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-11-18 15:46:08,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-11-18 15:46:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 15:46:08,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:08,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:08,505 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:08,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1506045203, now seen corresponding path program 1 times [2018-11-18 15:46:08,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:08,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:08,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:08,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:46:08,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:08,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:46:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:46:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:08,537 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 3 states. [2018-11-18 15:46:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:08,565 INFO L93 Difference]: Finished difference Result 580 states and 820 transitions. [2018-11-18 15:46:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:46:08,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-18 15:46:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:08,567 INFO L225 Difference]: With dead ends: 580 [2018-11-18 15:46:08,567 INFO L226 Difference]: Without dead ends: 313 [2018-11-18 15:46:08,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:46:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-18 15:46:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2018-11-18 15:46:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-18 15:46:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2018-11-18 15:46:08,587 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 70 [2018-11-18 15:46:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:08,587 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2018-11-18 15:46:08,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:46:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2018-11-18 15:46:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 15:46:08,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:08,588 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:08,588 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:08,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1777804843, now seen corresponding path program 1 times [2018-11-18 15:46:08,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:08,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:08,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:08,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:46:08,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:08,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:46:08,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:46:08,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:46:08,646 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 7 states. [2018-11-18 15:46:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:08,972 INFO L93 Difference]: Finished difference Result 629 states and 886 transitions. [2018-11-18 15:46:08,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:46:08,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-11-18 15:46:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:08,975 INFO L225 Difference]: With dead ends: 629 [2018-11-18 15:46:08,975 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 15:46:08,976 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 15:46:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 15:46:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 307. [2018-11-18 15:46:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 15:46:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2018-11-18 15:46:09,001 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2018-11-18 15:46:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:09,002 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2018-11-18 15:46:09,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:46:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2018-11-18 15:46:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-18 15:46:09,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:09,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:09,003 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:09,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash -793570515, now seen corresponding path program 1 times [2018-11-18 15:46:09,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:09,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:09,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:09,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:09,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:09,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:09,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:09,089 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2018-11-18 15:46:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:09,604 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2018-11-18 15:46:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:09,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-11-18 15:46:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:09,607 INFO L225 Difference]: With dead ends: 671 [2018-11-18 15:46:09,607 INFO L226 Difference]: Without dead ends: 407 [2018-11-18 15:46:09,609 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 15:46:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-18 15:46:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2018-11-18 15:46:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 15:46:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2018-11-18 15:46:09,640 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2018-11-18 15:46:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:09,641 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2018-11-18 15:46:09,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2018-11-18 15:46:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:46:09,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:09,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:09,642 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:09,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:09,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1039960101, now seen corresponding path program 1 times [2018-11-18 15:46:09,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:09,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:09,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:09,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:09,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:09,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:09,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:09,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:09,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:09,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:09,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:09,724 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2018-11-18 15:46:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:09,799 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2018-11-18 15:46:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:09,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-18 15:46:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:09,801 INFO L225 Difference]: With dead ends: 676 [2018-11-18 15:46:09,801 INFO L226 Difference]: Without dead ends: 369 [2018-11-18 15:46:09,803 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 15:46:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-18 15:46:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-11-18 15:46:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 15:46:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2018-11-18 15:46:09,833 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2018-11-18 15:46:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:09,833 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2018-11-18 15:46:09,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2018-11-18 15:46:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-18 15:46:09,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:09,835 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:09,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -885443560, now seen corresponding path program 1 times [2018-11-18 15:46:09,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:09,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:09,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:09,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:09,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:09,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:09,900 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2018-11-18 15:46:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:10,351 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2018-11-18 15:46:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:46:10,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-18 15:46:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:10,353 INFO L225 Difference]: With dead ends: 642 [2018-11-18 15:46:10,353 INFO L226 Difference]: Without dead ends: 337 [2018-11-18 15:46:10,355 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 15:46:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-18 15:46:10,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-11-18 15:46:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 15:46:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2018-11-18 15:46:10,384 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2018-11-18 15:46:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:10,384 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2018-11-18 15:46:10,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2018-11-18 15:46:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-18 15:46:10,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:10,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:10,385 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:10,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash 470469351, now seen corresponding path program 1 times [2018-11-18 15:46:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:10,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:10,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:10,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:10,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 15:46:10,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:10,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:46:10,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:46:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:46:10,510 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2018-11-18 15:46:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:10,694 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2018-11-18 15:46:10,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:46:10,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-11-18 15:46:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:10,696 INFO L225 Difference]: With dead ends: 357 [2018-11-18 15:46:10,697 INFO L226 Difference]: Without dead ends: 332 [2018-11-18 15:46:10,697 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 15:46:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-18 15:46:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-11-18 15:46:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-18 15:46:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2018-11-18 15:46:10,730 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2018-11-18 15:46:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:10,731 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2018-11-18 15:46:10,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:46:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2018-11-18 15:46:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 15:46:10,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:10,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:10,733 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:10,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2097539094, now seen corresponding path program 1 times [2018-11-18 15:46:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:10,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:10,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:10,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:46:10,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:10,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:46:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:46:10,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:46:10,794 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2018-11-18 15:46:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:11,080 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2018-11-18 15:46:11,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:11,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-11-18 15:46:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:11,082 INFO L225 Difference]: With dead ends: 726 [2018-11-18 15:46:11,082 INFO L226 Difference]: Without dead ends: 458 [2018-11-18 15:46:11,083 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 15:46:11,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-18 15:46:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2018-11-18 15:46:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-18 15:46:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2018-11-18 15:46:11,118 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2018-11-18 15:46:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:11,118 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2018-11-18 15:46:11,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:46:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2018-11-18 15:46:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 15:46:11,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:11,120 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:46:11,120 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:11,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:11,120 INFO L82 PathProgramCache]: Analyzing trace with hash 922101867, now seen corresponding path program 1 times [2018-11-18 15:46:11,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:11,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:11,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:11,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:11,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:11,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 15:46:11,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:11,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 15:46:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:46:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:46:11,309 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2018-11-18 15:46:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:12,275 INFO L93 Difference]: Finished difference Result 449 states and 558 transitions. [2018-11-18 15:46:12,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:46:12,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-18 15:46:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:12,277 INFO L225 Difference]: With dead ends: 449 [2018-11-18 15:46:12,277 INFO L226 Difference]: Without dead ends: 407 [2018-11-18 15:46:12,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-18 15:46:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-11-18 15:46:12,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 388. [2018-11-18 15:46:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-11-18 15:46:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2018-11-18 15:46:12,314 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2018-11-18 15:46:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:12,314 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2018-11-18 15:46:12,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 15:46:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2018-11-18 15:46:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-18 15:46:12,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:12,315 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 15:46:12,316 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:12,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1465008399, now seen corresponding path program 1 times [2018-11-18 15:46:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:12,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:12,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:12,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:12,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-18 15:46:12,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:12,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 15:46:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 15:46:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:46:12,445 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2018-11-18 15:46:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:12,628 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2018-11-18 15:46:12,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:46:12,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-11-18 15:46:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:12,633 INFO L225 Difference]: With dead ends: 423 [2018-11-18 15:46:12,635 INFO L226 Difference]: Without dead ends: 396 [2018-11-18 15:46:12,635 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 15:46:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-18 15:46:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-11-18 15:46:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-18 15:46:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2018-11-18 15:46:12,671 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2018-11-18 15:46:12,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:12,671 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2018-11-18 15:46:12,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 15:46:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2018-11-18 15:46:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-18 15:46:12,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:12,672 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 15:46:12,673 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:12,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1227480844, now seen corresponding path program 1 times [2018-11-18 15:46:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:12,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:12,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:46:12,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:12,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 15:46:12,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:12,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 15:46:12,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:46:12,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:46:12,849 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2018-11-18 15:46:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:13,735 INFO L93 Difference]: Finished difference Result 405 states and 507 transitions. [2018-11-18 15:46:13,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:46:13,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-11-18 15:46:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:13,737 INFO L225 Difference]: With dead ends: 405 [2018-11-18 15:46:13,737 INFO L226 Difference]: Without dead ends: 341 [2018-11-18 15:46:13,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-18 15:46:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-18 15:46:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-11-18 15:46:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-18 15:46:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2018-11-18 15:46:13,764 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2018-11-18 15:46:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:13,765 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2018-11-18 15:46:13,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 15:46:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2018-11-18 15:46:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-18 15:46:13,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:13,766 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 15:46:13,766 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:13,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 171192755, now seen corresponding path program 1 times [2018-11-18 15:46:13,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:13,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:13,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:13,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:13,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:13,815 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 15:46:13,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:13,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:13,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:13,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:13,816 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2018-11-18 15:46:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:13,850 INFO L93 Difference]: Finished difference Result 468 states and 581 transitions. [2018-11-18 15:46:13,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:13,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-18 15:46:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:13,852 INFO L225 Difference]: With dead ends: 468 [2018-11-18 15:46:13,852 INFO L226 Difference]: Without dead ends: 322 [2018-11-18 15:46:13,853 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 15:46:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-18 15:46:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-11-18 15:46:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-18 15:46:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2018-11-18 15:46:13,869 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2018-11-18 15:46:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:13,870 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2018-11-18 15:46:13,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2018-11-18 15:46:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 15:46:13,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:13,871 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 15:46:13,871 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:13,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash 729149194, now seen corresponding path program 1 times [2018-11-18 15:46:13,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:13,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:13,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:13,932 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 15:46:13,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:13,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:46:13,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-18 15:46:13,934 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [339], [341], [348], [352], [356], [358], [362], [364], [371], [373], [376], [379], [448], [449], [455], [461], [463], [465], [472], [474], [475], [476], [478], [481], [538], [543], [546], [549], [551], [557], [560], [568], [571], [573], [578], [581], [585], [593], [596], [599], [601], [612], [613], [614], [616], [617], [662], [665], [687], [688], [696], [697], [698], [699], [704], [736], [742], [743], [744], [745], [748], [749], [750], [751], [770], [771], [774], [775], [776], [777], [778], [779], [780], [794], [795], [798], [799], [802], [803], [806], [812], [813], [814] [2018-11-18 15:46:13,963 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:46:13,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:46:14,550 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:46:14,551 INFO L272 AbstractInterpreter]: Visited 100 different actions 318 times. Merged at 21 different actions 52 times. Never widened. Performed 6028 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6028 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 1 different actions. Largest state had 98 variables. [2018-11-18 15:46:14,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:14,567 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:46:14,944 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 84.78% of their original sizes. [2018-11-18 15:46:14,944 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:46:16,058 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-18 15:46:16,059 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:46:16,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:46:16,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2018-11-18 15:46:16,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:16,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-18 15:46:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-18 15:46:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2909, Unknown=0, NotChecked=0, Total=3192 [2018-11-18 15:46:16,061 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 57 states. [2018-11-18 15:46:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:31,571 INFO L93 Difference]: Finished difference Result 410 states and 522 transitions. [2018-11-18 15:46:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-18 15:46:31,571 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-11-18 15:46:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:31,573 INFO L225 Difference]: With dead ends: 410 [2018-11-18 15:46:31,573 INFO L226 Difference]: Without dead ends: 401 [2018-11-18 15:46:31,576 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1111, Invalid=11099, Unknown=0, NotChecked=0, Total=12210 [2018-11-18 15:46:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-11-18 15:46:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 281. [2018-11-18 15:46:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-18 15:46:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 325 transitions. [2018-11-18 15:46:31,620 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 325 transitions. Word has length 163 [2018-11-18 15:46:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:31,620 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 325 transitions. [2018-11-18 15:46:31,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-18 15:46:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 325 transitions. [2018-11-18 15:46:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 15:46:31,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:31,621 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 15:46:31,622 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:31,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2079039691, now seen corresponding path program 1 times [2018-11-18 15:46:31,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:31,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:31,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:31,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:31,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:31,699 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 15:46:31,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:31,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:46:31,699 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-18 15:46:31,701 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [339], [341], [348], [352], [356], [358], [362], [364], [371], [373], [398], [402], [448], [449], [455], [461], [463], [465], [472], [474], [475], [476], [478], [481], [538], [543], [546], [549], [551], [557], [560], [568], [571], [573], [578], [581], [585], [593], [596], [599], [601], [612], [613], [614], [616], [617], [662], [665], [687], [688], [696], [697], [698], [699], [704], [736], [742], [743], [744], [745], [748], [749], [750], [751], [770], [771], [774], [775], [776], [777], [778], [779], [780], [794], [795], [798], [799], [802], [803], [806], [812], [813], [814] [2018-11-18 15:46:31,704 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:46:31,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:46:31,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:46:31,986 INFO L272 AbstractInterpreter]: Visited 108 different actions 336 times. Merged at 24 different actions 56 times. Never widened. Performed 6518 root evaluator evaluations with a maximum evaluation depth of 9. Performed 6518 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 1 different actions. Largest state had 98 variables. [2018-11-18 15:46:31,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:31,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:46:31,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:46:31,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/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 15:46:32,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:32,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:46:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:32,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:46:32,181 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 15:46:32,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:46:32,310 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 15:46:32,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:46:32,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2018-11-18 15:46:32,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:32,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:32,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:32,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:46:32,328 INFO L87 Difference]: Start difference. First operand 281 states and 325 transitions. Second operand 6 states. [2018-11-18 15:46:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:32,427 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2018-11-18 15:46:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:32,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-11-18 15:46:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:32,430 INFO L225 Difference]: With dead ends: 448 [2018-11-18 15:46:32,430 INFO L226 Difference]: Without dead ends: 296 [2018-11-18 15:46:32,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:46:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-18 15:46:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2018-11-18 15:46:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-18 15:46:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-11-18 15:46:32,477 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 163 [2018-11-18 15:46:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:32,477 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-11-18 15:46:32,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-11-18 15:46:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-18 15:46:32,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:32,478 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 15:46:32,478 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:32,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1663212153, now seen corresponding path program 1 times [2018-11-18 15:46:32,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:32,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:32,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:32,635 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 15:46:32,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:32,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:32,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:32,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:32,636 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 6 states. [2018-11-18 15:46:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:32,755 INFO L93 Difference]: Finished difference Result 453 states and 534 transitions. [2018-11-18 15:46:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:32,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-18 15:46:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:32,758 INFO L225 Difference]: With dead ends: 453 [2018-11-18 15:46:32,758 INFO L226 Difference]: Without dead ends: 319 [2018-11-18 15:46:32,758 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 15:46:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-18 15:46:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 284. [2018-11-18 15:46:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-18 15:46:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-11-18 15:46:32,802 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 164 [2018-11-18 15:46:32,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:32,802 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-11-18 15:46:32,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-11-18 15:46:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-18 15:46:32,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:32,804 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 15:46:32,804 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:32,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:32,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1483443503, now seen corresponding path program 1 times [2018-11-18 15:46:32,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:32,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:32,905 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 15:46:32,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:32,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:32,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:32,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:32,906 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 6 states. [2018-11-18 15:46:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:32,982 INFO L93 Difference]: Finished difference Result 344 states and 391 transitions. [2018-11-18 15:46:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:32,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-11-18 15:46:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:32,984 INFO L225 Difference]: With dead ends: 344 [2018-11-18 15:46:32,984 INFO L226 Difference]: Without dead ends: 271 [2018-11-18 15:46:32,985 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 15:46:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-18 15:46:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-11-18 15:46:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 15:46:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2018-11-18 15:46:33,020 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 204 [2018-11-18 15:46:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:33,020 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2018-11-18 15:46:33,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2018-11-18 15:46:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 15:46:33,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:46:33,021 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 15:46:33,021 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:46:33,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:46:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash 478992125, now seen corresponding path program 1 times [2018-11-18 15:46:33,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:46:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:33,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:46:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:46:33,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:46:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:46:33,114 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 15:46:33,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:46:33,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:46:33,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:46:33,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:46:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:46:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:46:33,116 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand 6 states. [2018-11-18 15:46:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:46:33,176 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2018-11-18 15:46:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:46:33,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-11-18 15:46:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:46:33,177 INFO L225 Difference]: With dead ends: 255 [2018-11-18 15:46:33,177 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:46:33,178 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 15:46:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:46:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:46:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:46:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:46:33,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-11-18 15:46:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:46:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:46:33,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:46:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:46:33,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:46:33,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:46:33,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:33,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:46:34,678 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2018-11-18 15:46:34,798 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2018-11-18 15:46:34,983 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 81 [2018-11-18 15:46:35,459 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2018-11-18 15:46:35,629 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 70 [2018-11-18 15:46:35,788 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2018-11-18 15:46:36,149 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 66 [2018-11-18 15:46:36,531 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2018-11-18 15:46:36,684 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 68 [2018-11-18 15:46:37,122 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 88 [2018-11-18 15:46:37,412 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 68 [2018-11-18 15:46:37,655 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 78 [2018-11-18 15:46:38,139 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 75 [2018-11-18 15:46:38,245 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 47 [2018-11-18 15:46:38,463 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 76 [2018-11-18 15:46:38,912 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 94 [2018-11-18 15:46:39,198 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 91 [2018-11-18 15:46:39,393 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2018-11-18 15:46:39,569 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 69 [2018-11-18 15:46:39,793 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 87 [2018-11-18 15:46:40,099 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 69 [2018-11-18 15:46:40,313 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2018-11-18 15:46:40,559 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 76 [2018-11-18 15:46:40,856 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-11-18 15:46:41,216 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 88 [2018-11-18 15:46:41,398 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-11-18 15:46:41,550 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 91 [2018-11-18 15:46:42,054 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 104 [2018-11-18 15:46:42,241 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2018-11-18 15:46:42,595 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2018-11-18 15:46:42,901 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 88 [2018-11-18 15:46:42,965 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-11-18 15:46:42,966 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) the Hoare annotation is: (or (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))) (= 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)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~myStatus~0 259) (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 15:46:42,966 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-11-18 15:46:42,966 INFO L428 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-11-18 15:46:42,966 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-11-18 15:46:42,966 INFO L421 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,966 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 (= 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)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 15:46:42,966 INFO L425 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-11-18 15:46:42,966 INFO L425 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-11-18 15:46:42,966 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 (= 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)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 15:46:42,966 INFO L421 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (and (not (= ~myStatus~0 259)) (= 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) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-11-18 15:46:42,967 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))) (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L421 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L425 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-11-18 15:46:42,967 INFO L421 ceAbstractionStarter]: At program point L707(lines 706 765) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,967 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~DC~0 ~s~0) (= ~routine~0 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))) (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L421 ceAbstractionStarter]: At program point L807(line 807) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L421 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,968 INFO L421 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L421 ceAbstractionStarter]: At program point L759(lines 682 771) 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 (= 1 |old(~pended~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)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-11-18 15:46:42,968 INFO L421 ceAbstractionStarter]: At program point L768(line 768) 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 (= 1 |old(~pended~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)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 15:46:42,968 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))) (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,968 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L421 ceAbstractionStarter]: At program point L794(line 794) the Hoare annotation is: (or (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-11-18 15:46:42,969 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))) (= 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)|)) (= |old(~myStatus~0)| 259) (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 15:46:42,969 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 ((.cse6 (= 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)))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (= 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)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse6 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse6 .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse7 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse0 (<= ~NP~0 1) .cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (not (= |old(~customIrp~0)| 0))))) [2018-11-18 15:46:42,969 INFO L428 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (not (= 6 ~MPR3~0)) (= |old(~s~0)| ~s~0) (not (= 1 ~NP~0)) (= ~myStatus~0 259) (< ~setEventCalled~0 1) (not (= ~compRegistered~0 1)) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= 5 ~MPR1~0)) (< 1 ~setEventCalled~0)) [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L421 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (or (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (= ~myStatus~0 259) (< ~setEventCalled~0 1) (not (= ~compRegistered~0 1)) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= 5 ~MPR1~0)) (< 1 ~setEventCalled~0)) [2018-11-18 15:46:42,969 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 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-11-18 15:46:42,969 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-11-18 15:46:42,970 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 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-11-18 15:46:42,970 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 15:46:42,970 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 15:46:42,970 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 15:46:42,970 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 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-11-18 15:46:42,970 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 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-11-18 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-11-18 15:46:42,970 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 15:46:42,970 INFO L425 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-11-18 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-11-18 15:46:42,971 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 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-11-18 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-11-18 15:46:42,971 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 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-11-18 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-11-18 15:46:42,971 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 15:46:42,971 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 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-18 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-11-18 15:46:42,971 INFO L421 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (= 1 ~pended~0)) (.cse8 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< 1 ~NP~0)) (.cse5 (not (= 0 ~routine~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= ~myStatus~0 259)) (.cse3 (< |old(~setEventCalled~0)| 1)) (.cse4 (< ~compRegistered~0 1)) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (< ~NP~0 1) (or .cse4 (or .cse5 .cse6 .cse7)) .cse8 (not (= |old(~s~0)| ~MPR3~0)) .cse9 .cse10 .cse11) (or .cse0 .cse6 .cse8 .cse9 .cse10 .cse5 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4 .cse7 (< |old(~s~0)| 1) .cse11))) [2018-11-18 15:46:42,971 INFO L425 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-11-18 15:46:42,972 INFO L421 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse6 (= 1 ~pended~0)) (.cse8 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse10 (< 1 ~NP~0)) (.cse5 (not (= 0 ~routine~0))) (.cse1 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= ~myStatus~0 259)) (.cse3 (< |old(~setEventCalled~0)| 1)) (.cse4 (< ~compRegistered~0 1)) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (< ~NP~0 1) (or .cse4 (or .cse5 .cse6 .cse7)) .cse8 (not (= |old(~s~0)| ~MPR3~0)) .cse9 .cse10 .cse11) (or .cse0 .cse6 .cse8 .cse9 .cse10 (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4 .cse7 (< |old(~s~0)| 1) .cse11))) [2018-11-18 15:46:42,972 INFO L425 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-11-18 15:46:42,973 INFO L421 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse16 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 4)) (.cse15 (+ ~NP~0 5))) (let ((.cse1 (< ~MPR3~0 .cse15)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (= ~myStatus~0 259)) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse11 (< ~compRegistered~0 1)) (.cse7 (not (= 0 ~routine~0))) (.cse2 (= 1 ~pended~0)) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse3 (< ~MPR1~0 .cse14)) (.cse4 (< ~SKIP2~0 .cse16)) (.cse5 (< 1 ~NP~0)) (.cse17 (= ~NP~0 ~s~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse13 (< 1 |old(~setEventCalled~0)|))) (and (let ((.cse0 (and (<= .cse14 ~MPR1~0) (<= .cse15 ~MPR3~0) (<= .cse16 ~SKIP2~0) .cse17 (<= ~s~0 1) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or (and (= |old(~customIrp~0)| 1) .cse0 (= 0 ~customIrp~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse0 .cse6) .cse7 (not (= |old(~s~0)| ~NP~0)) .cse8 .cse9 .cse10 .cse11 .cse12 (< |old(~s~0)| 1) .cse13)) (or .cse1 .cse8 .cse9 .cse10 (< ~NP~0 1) (or .cse11 (or .cse7 .cse2 .cse12)) .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 .cse5 (and .cse17 .cse6) .cse13)))) [2018-11-18 15:46:42,973 INFO L421 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse16 (+ ~DC~0 2)) (.cse14 (+ ~NP~0 4)) (.cse15 (+ ~NP~0 5))) (let ((.cse1 (< ~MPR3~0 .cse15)) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (= ~myStatus~0 259)) (.cse10 (< |old(~setEventCalled~0)| 1)) (.cse11 (< ~compRegistered~0 1)) (.cse7 (not (= 0 ~routine~0))) (.cse2 (= 1 ~pended~0)) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse3 (< ~MPR1~0 .cse14)) (.cse4 (< ~SKIP2~0 .cse16)) (.cse5 (< 1 ~NP~0)) (.cse17 (= ~NP~0 ~s~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse13 (< 1 |old(~setEventCalled~0)|))) (and (let ((.cse0 (and (<= .cse14 ~MPR1~0) (<= .cse15 ~MPR3~0) (<= .cse16 ~SKIP2~0) .cse17 (<= ~s~0 1) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (or (and (= |old(~customIrp~0)| 1) .cse0 (= 0 ~customIrp~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse0 .cse6) .cse7 (not (= |old(~s~0)| ~NP~0)) .cse8 .cse9 .cse10 .cse11 .cse12 (< |old(~s~0)| 1) .cse13)) (or .cse1 .cse8 .cse9 .cse10 (< ~NP~0 1) (or .cse11 (or .cse7 .cse2 .cse12)) .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 .cse5 (and .cse17 .cse6) .cse13)))) [2018-11-18 15:46:42,973 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= ~myStatus~0 259)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse12 (< ~compRegistered~0 1)) (.cse8 (not (= 0 ~routine~0))) (.cse4 (= 1 ~pended~0)) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse2 (<= 1 ~setEventCalled~0)) (.cse3 (<= ~setEventCalled~0 1)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse6 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (< 1 ~NP~0)) (.cse14 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 (and (= ~NP~0 ~s~0) .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12 .cse13 (< |old(~s~0)| 1) .cse14) (or .cse0 .cse9 .cse10 .cse11 (< ~NP~0 1) (or .cse12 (or .cse8 .cse4 .cse13)) (and (= ~s~0 ~MPR3~0) .cse1 .cse2 .cse3) .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse6 .cse7 .cse14))) [2018-11-18 15:46:42,973 INFO L421 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 0))) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= 0 ~routine~0)) .cse0 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse1 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-18 15:46:42,973 INFO L425 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-18 15:46:42,973 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-11-18 15:46:42,973 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= 1 ~pended~0))) (and (or .cse0 (= ~s~0 ~NP~0) .cse1 (not (= ~compRegistered~0 0))) (or (= ~NP~0 ~s~0) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (not (= 0 ~routine~0)) .cse0 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse1 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1))))) [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L428 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-11-18 15:46:42,974 INFO L428 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L421 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)))) (not (= 6 ~MPR3~0)) (= |old(~customIrp~0)| ~customIrp~0) (not (= 1 ~s~0))) [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-11-18 15:46:42,974 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (and (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-11-18 15:46:42,975 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 15:46:42,975 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 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-11-18 15:46:42,975 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 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-11-18 15:46:42,975 INFO L421 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (or (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (and (= ~NP~0 ~s~0) .cse0 .cse1 .cse2) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)))) [2018-11-18 15:46:42,975 INFO L425 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L421 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (and (= |old(~customIrp~0)| ~customIrp~0) (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,976 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L421 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,976 INFO L425 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L425 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-11-18 15:46:42,976 INFO L421 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,977 INFO L421 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (and (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,977 INFO L425 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-11-18 15:46:42,977 INFO L421 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,977 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-11-18 15:46:42,977 INFO L421 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (and (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,977 INFO L425 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-11-18 15:46:42,977 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-11-18 15:46:42,977 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-11-18 15:46:42,977 INFO L425 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-11-18 15:46:42,978 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (let ((.cse0 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344))) (or (and .cse0 (= ~s~0 1)) (and (= ~s~0 6) .cse0))) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,978 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-18 15:46:42,978 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-11-18 15:46:42,978 INFO L421 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (and (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (not (= ~pended~0 1))) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,978 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-11-18 15:46:42,978 INFO L421 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (let ((.cse1 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344)) (.cse2 (let ((.cse7 (= ~NP~0 1)) (.cse8 (= ~MPR1~0 5)) (.cse9 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse10 (= ~routine~0 0)) (.cse11 (= ~MPR3~0 6))) (or (and .cse0 .cse7 .cse8 .cse9 (= ~s~0 6) .cse10 .cse11) (and .cse0 .cse7 .cse8 .cse9 .cse10 (= ~s~0 1) .cse11)))) (.cse3 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0)) (.cse5 (<= 1 ~setEventCalled~0)) (.cse4 (not (= ~pended~0 1))) (.cse6 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not .cse0) (not (= 5 ~MPR1~0)) (and .cse1 (<= 0 DiskPerfRegisterDevice_~status~5) .cse2 .cse3 .cse4 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse5 .cse6) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (and .cse1 .cse2 (<= ~s~0 1) .cse3 .cse5 .cse4 .cse6)))) [2018-11-18 15:46:42,978 INFO L425 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-11-18 15:46:42,978 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-11-18 15:46:42,978 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L421 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L421 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-11-18 15:46:42,979 INFO L425 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-11-18 15:46:42,980 INFO L421 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse7 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse0 (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280)) (.cse1 (let ((.cse8 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344))) (or (and .cse8 (= ~s~0 1)) (and (= ~s~0 6) .cse8)))) (.cse2 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse3 (not (= DiskPerfRegisterDevice_~output~0 0))) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= 1 ~setEventCalled~0)) (.cse6 (<= ~setEventCalled~0 1))) (or (and (and .cse0 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (and .cse7 (and .cse0 .cse1 .cse2 .cse3 (<= ~s~0 1) .cse4 .cse5 .cse6)) (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)))) [2018-11-18 15:46:42,980 INFO L421 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (not (= |old(~customIrp~0)| 0))) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (= ~s~0 1) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-18 15:46:42,980 INFO L425 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-18 15:46:42,980 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-11-18 15:46:42,980 INFO L425 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-11-18 15:46:42,980 INFO L421 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,980 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-11-18 15:46:42,980 INFO L425 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-11-18 15:46:42,981 INFO L421 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (let ((.cse1 (= ~compRegistered~0 1))) (or .cse0 (and (= ~s~0 1) .cse1) (and .cse1 (= (mod DiskPerfForwardIrpSynchronous_~status~3 259) 0)) .cse2 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 5 ~MPR1~0)) .cse8 .cse9)) (let ((.cse10 (<= 1 ~compRegistered~0)) (.cse11 (= ~routine~0 0)) (.cse12 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse13 (= |old(~customIrp~0)| ~customIrp~0)) (.cse14 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse15 (not (= ~pended~0 1))) (.cse16 (<= 1 ~setEventCalled~0)) (.cse17 (<= ~setEventCalled~0 1))) (or (< ~MPR3~0 (+ ~NP~0 5)) (and .cse10 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) .cse11 (= ~NP~0 ~s~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse2 (< 1 ~NP~0) (and .cse10 .cse11 (= ~s~0 ~MPR3~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< |old(~s~0)| 1) .cse9)))) [2018-11-18 15:46:42,981 INFO L425 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-18 15:46:42,981 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-11-18 15:46:42,981 INFO L425 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-11-18 15:46:42,981 INFO L421 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse5 (= ~myStatus~0 259)) (.cse6 (not (= |old(~compRegistered~0)| 0))) (.cse7 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) (= ~compRegistered~0 1) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 .cse8) (or (< ~MPR3~0 (+ ~NP~0 5)) (and (<= 1 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1) .cse8))) [2018-11-18 15:46:42,981 INFO L421 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 15:46:42,981 INFO L425 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-11-18 15:46:42,981 INFO L425 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-11-18 15:46:42,981 INFO L421 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= ~myStatus~0 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,982 INFO L421 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (and (<= 1 ~compRegistered~0) (not (= 259 DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,982 INFO L425 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-11-18 15:46:42,982 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-18 15:46:42,982 INFO L421 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (= ~NP~0 ~s~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (not (= ~pended~0 1)))) (or (and .cse0 (not (= 259 DiskPerfStartDevice_~status~1)) .cse1 .cse2 .cse3 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3))) (= ~routine~0 0)) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,982 INFO L421 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,982 INFO L421 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (= ~NP~0 ~s~0)) (.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (not (= ~pended~0 1)))) (or (and .cse0 (not (= 259 DiskPerfStartDevice_~status~1)) .cse1 .cse2 .cse3 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3))) (= ~routine~0 0)) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,982 INFO L421 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-11-18 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-11-18 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-11-18 15:46:42,983 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 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 403 410) no Hoare annotation was computed. [2018-11-18 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-11-18 15:46:42,983 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 15:46:42,983 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 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-11-18 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-11-18 15:46:42,983 INFO L425 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-11-18 15:46:42,984 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 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-11-18 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-11-18 15:46:42,984 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 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-11-18 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-11-18 15:46:42,984 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 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-11-18 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-11-18 15:46:42,984 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 15:46:42,984 INFO L425 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-11-18 15:46:42,985 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 15:46:42,985 INFO L425 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-11-18 15:46:42,985 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-18 15:46:42,985 INFO L425 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-11-18 15:46:42,985 INFO L421 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 15:46:42,985 INFO L425 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-11-18 15:46:42,985 INFO L425 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-11-18 15:46:42,985 INFO L421 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (= ~routine~0 0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (not (= ~pended~0 1)))) (or (< ~MPR3~0 (+ ~NP~0 5)) (and .cse0 (not (= 259 DiskPerfRemoveDevice_~status~2)) .cse1 .cse2 .cse3 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2) (= |old(~myStatus~0)| ~myStatus~0) .cse0 .cse1 .cse2 (= |old(~customIrp~0)| ~customIrp~0) .cse3) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)))) [2018-11-18 15:46:42,985 INFO L425 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-11-18 15:46:42,985 INFO L421 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (< ~IPC~0 (+ ~DC~0 5)) (< |old(~s~0)| 1) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 15:46:42,986 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-11-18 15:46:42,986 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-11-18 15:46:42,986 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-11-18 15:46:42,986 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-11-18 15:46:42,986 INFO L428 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-11-18 15:46:42,986 INFO L425 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-11-18 15:46:42,987 INFO L425 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-11-18 15:46:42,987 INFO L421 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse21 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse16 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (or .cse16 .cse17 .cse19 .cse20)) (.cse1 (not (= 1 ~NP~0))) (.cse2 (<= (+ .cse21 1) 0)) (.cse3 (<= 1 ~setEventCalled~0)) (.cse4 (= (+ IofCallDriver_~compRetStatus~0 1073741802) 0)) (.cse5 (= ~s~0 1)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse8 (not (= ~pended~0 1))) (.cse9 (<= ~setEventCalled~0 1)) (.cse11 (= ~myStatus~0 259)) (.cse12 (not (= ~compRegistered~0 1))) (.cse13 (not (= 5 ~MPR1~0))) (.cse14 (not (= 6 ~MPR3~0))) (.cse15 (not (= 1 |old(~s~0)|))) (.cse10 (not (= 0 ~routine~0))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (or .cse1 (= |IofCallDriver_#in~Irp| 0)) (and (not (= IofCallDriver_~Irp 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse10 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse11 .cse12 .cse13 .cse14 (not (= ~customIrp~0 0)) .cse15) (or .cse10 .cse16 .cse17 .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20) (or .cse10 (not (= |old(~s~0)| ~NP~0)) .cse17 .cse18 .cse19 .cse20)))) [2018-11-18 15:46:42,987 INFO L421 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse6 (or .cse14 .cse2 .cse4 .cse5)) (.cse7 (not (= 1 ~NP~0))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (not (= 5 ~MPR1~0))) (.cse12 (not (= 6 ~MPR3~0))) (.cse10 (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse15 0) (<= 0 .cse15) (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse0 (<= ~setEventCalled~0 1)))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse1 (not (= 0 ~routine~0))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) .cse13) (or .cse6 (or .cse7 (= |IofCallDriver_#in~Irp| 0)) .cse1 .cse8 .cse9 .cse11 .cse12 .cse10 .cse13) (or .cse1 .cse14 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-11-18 15:46:42,987 INFO L421 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (= 1 |old(~pended~0)|)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse10 (not (= ~compRegistered~0 0))) (.cse0 (or .cse8 .cse9 .cse11 .cse12)) (.cse1 (not (= 1 ~NP~0))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (= ~myStatus~0 259)) (.cse4 (not (= ~compRegistered~0 1))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= 6 ~MPR3~0))) (.cse7 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~customIrp~0 0)) .cse7) (or .cse2 .cse8 .cse9 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12) (or .cse2 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12) (or .cse0 (or .cse1 (= |IofCallDriver_#in~Irp| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-11-18 15:46:42,987 INFO L425 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-11-18 15:46:42,988 INFO L421 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (or .cse9 .cse10 .cse12 .cse13)) (.cse1 (not (= 1 ~NP~0))) (.cse3 (= ~myStatus~0 259)) (.cse4 (not (= ~compRegistered~0 1))) (.cse5 (not (= 5 ~MPR1~0))) (.cse7 (not (= ~pended~0 1))) (.cse6 (not (= 6 ~MPR3~0))) (.cse8 (not (= 1 |old(~s~0)|))) (.cse2 (not (= 0 ~routine~0))) (.cse11 (not (= ~compRegistered~0 0)))) (and (or .cse0 (or .cse1 (= |IofCallDriver_#in~Irp| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (and (not (= IofCallDriver_~Irp 0)) (= |old(~s~0)| ~s~0) .cse7) .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~s~0 1) .cse7) .cse6 (not (= ~customIrp~0 0)) .cse8) (or .cse2 .cse9 .cse10 .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13) (or .cse2 (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse12 .cse13)))) [2018-11-18 15:46:42,991 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse6 (or .cse14 .cse2 .cse4 .cse5)) (.cse7 (not (= 1 ~NP~0))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse10 (not (= 5 ~MPR1~0))) (.cse11 (and (= ~s~0 1) .cse0)) (.cse12 (not (= 6 ~MPR3~0))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse1 (not (= 0 ~routine~0))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) .cse13) (or .cse6 (or .cse7 (= |IofCallDriver_#in~Irp| 0)) .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-11-18 15:46:42,992 INFO L425 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-11-18 15:46:42,992 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-11-18 15:46:42,992 INFO L425 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-11-18 15:46:42,992 INFO L425 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-11-18 15:46:42,992 INFO L421 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse25 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse26 (+ IofCallDriver_~compRetStatus~0 1073741802))) (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse22 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse9 (<= .cse26 0)) (.cse11 (<= 0 .cse26)) (.cse12 (<= (+ .cse25 1) 0)) (.cse13 (<= 1 ~setEventCalled~0)) (.cse15 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse25) 3221225494))) (.cse16 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse0 (not (= ~pended~0 1))) (.cse17 (<= ~setEventCalled~0 1))) (let ((.cse8 (and .cse9 .cse11 .cse12 (let ((.cse23 (= ~NP~0 1)) (.cse24 (= ~s~0 5))) (or (and .cse23 (= IofCallDriver_~returnVal2~0 259) .cse24) (and (= IofCallDriver_~returnVal2~0 0) .cse23 .cse24))) .cse13 .cse15 .cse16 .cse0 .cse17)) (.cse21 (not (= 6 ~MPR3~0))) (.cse7 (or (< ~MPR3~0 (+ ~NP~0 5)) (or .cse2 .cse22 .cse3 .cse5 .cse6))) (.cse18 (= ~myStatus~0 259)) (.cse19 (not (= ~compRegistered~0 1))) (.cse20 (not (= 5 ~MPR1~0))) (.cse10 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse14 (= ~MPR1~0 ~s~0)) (.cse1 (not (= 0 ~routine~0))) (.cse4 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse0 .cse17) .cse1 .cse18 .cse19 .cse20 .cse21 (not (= ~customIrp~0 0)) (not (= 1 |old(~s~0)|))) (or .cse8 (= |IofCallDriver_#in~Irp| 0) .cse21 .cse7 (not (= 1 ~NP~0)) .cse1 .cse18 .cse19 .cse20 (and .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse12 .cse0 .cse13 .cse17)) (or .cse1 .cse22 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6))))) [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-11-18 15:46:43,000 INFO L421 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse6 (or .cse14 .cse2 .cse4 .cse5)) (.cse7 (not (= 1 ~NP~0))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (not (= 5 ~MPR1~0))) (.cse12 (not (= 6 ~MPR3~0))) (.cse10 (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse15 0) (<= 0 .cse15) (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse0 (<= ~setEventCalled~0 1)))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse1 (not (= 0 ~routine~0))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) .cse13) (or .cse6 (or .cse7 (= |IofCallDriver_#in~Irp| 0)) .cse1 .cse8 .cse9 .cse11 .cse12 .cse10 .cse13) (or .cse1 .cse14 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-11-18 15:46:43,000 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-11-18 15:46:43,007 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-18 15:46:43,007 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-11-18 15:46:43,007 INFO L425 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-11-18 15:46:43,007 INFO L421 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (= 1 |old(~pended~0)|)) (.cse11 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse10 (not (= ~compRegistered~0 0))) (.cse0 (or .cse8 .cse9 .cse11 .cse12)) (.cse1 (not (= 1 ~NP~0))) (.cse2 (not (= 0 ~routine~0))) (.cse3 (= ~myStatus~0 259)) (.cse4 (not (= ~compRegistered~0 1))) (.cse5 (not (= 5 ~MPR1~0))) (.cse6 (not (= 6 ~MPR3~0))) (.cse7 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~customIrp~0 0)) .cse7) (or .cse2 .cse8 .cse9 .cse10 (not (= ~SKIP1~0 |old(~s~0)|)) .cse11 .cse12) (or .cse2 (not (= |old(~s~0)| ~NP~0)) .cse9 .cse10 .cse11 .cse12) (or .cse0 (or .cse1 (= |IofCallDriver_#in~Irp| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2018-11-18 15:46:43,007 INFO L425 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-11-18 15:46:43,007 INFO L425 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-11-18 15:46:43,008 INFO L421 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse6 (or .cse14 .cse2 .cse4 .cse5)) (.cse7 (not (= 1 ~NP~0))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (not (= 5 ~MPR1~0))) (.cse12 (not (= 6 ~MPR3~0))) (.cse10 (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse15 0) (<= 0 .cse15) (<= (+ .cse16 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse0 (<= ~setEventCalled~0 1)))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse1 (not (= 0 ~routine~0))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) .cse13) (or .cse6 (or .cse7 (= |IofCallDriver_#in~Irp| 0)) .cse1 .cse8 .cse9 .cse11 .cse12 .cse10 .cse13) (or .cse1 .cse14 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-11-18 15:46:43,008 INFO L425 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-11-18 15:46:43,008 INFO L428 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-11-18 15:46:43,008 INFO L425 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-18 15:46:43,008 INFO L428 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-11-18 15:46:43,008 INFO L425 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-11-18 15:46:43,008 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-11-18 15:46:43,008 INFO L425 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-11-18 15:46:43,008 INFO L428 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-11-18 15:46:43,015 INFO L428 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-11-18 15:46:43,015 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L421 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (and (<= 1 ~compRegistered~0) (= ~DC~0 ~s~0) (not (= 259 DiskPerfDispatchPnp_~status~0)) (= ~routine~0 0) (not (= ~pended~0 1))) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L421 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:43,016 INFO L421 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-11-18 15:46:43,016 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-11-18 15:46:43,016 INFO L421 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:43,018 INFO L421 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 1) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-18 15:46:43,018 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-11-18 15:46:43,018 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-11-18 15:46:43,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:46:43,018 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 15:46:43,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:46:43,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:46:43,018 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~myStatus~0 259)) (= 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) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) [2018-11-18 15:46:43,018 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:46:43,018 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:46:43,019 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 15:46:43,019 INFO L425 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-11-18 15:46:43,019 INFO L425 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-11-18 15:46:43,019 INFO L425 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-11-18 15:46:43,019 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 15:46:43,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:46:43 BoogieIcfgContainer [2018-11-18 15:46:43,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:46:43,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:46:43,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:46:43,054 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:46:43,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:46:01" (3/4) ... [2018-11-18 15:46:43,063 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-18 15:46:43,068 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-11-18 15:46:43,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:46:43,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-11-18 15:46:43,085 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2018-11-18 15:46:43,086 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-18 15:46:43,088 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 15:46:43,089 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 15:46:43,117 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((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))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || ((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,117 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((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))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || ((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,118 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((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)) || !(\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(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((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) && !(259 == status))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,120 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(customIrp) == 1 && ((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp) || MPR3 < NP + 5) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || ((((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || (NP == s && \old(customIrp) == customIrp)) || 1 < \old(setEventCalled)) [2018-11-18 15:46:43,120 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\old(customIrp) == 1 && ((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp) || MPR3 < NP + 5) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || ((((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || (NP == s && \old(customIrp) == customIrp)) || 1 < \old(setEventCalled)) [2018-11-18 15:46:43,120 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 15:46:43,120 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) && ((((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP) || \old(Irp) == 0) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(1 == \old(s)))) && (((((((!(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 15:46:43,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((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(myStatus) == 259) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,121 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 15:46:43,121 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) && ((((((((((MPR3 < NP + 5 || (((!(\old(s) == NP) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((NP == 1 && returnVal2 == 259) && s == 5) || ((returnVal2 == 0 && NP == 1) && s == 5))) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || (((((((((compRetStatus + 1073741802 <= 0 && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((NP == 1 && returnVal2 == 259) && s == 5) || ((returnVal2 == 0 && NP == 1) && s == 5))) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1) || \old(Irp) == 0) || !(6 == MPR3)) || MPR3 < NP + 5 || (((!(\old(s) == NP) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || (((((((((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))) && (((((((!(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 15:46:43,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || ((((1 <= compRegistered && DC == s) && !(259 == status)) && routine == 0) && !(pended == 1))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == \old(pended) || !(\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(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((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) && !(259 == status))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,121 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((myStatus == 259 || ((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(compRegistered == 1)) || !(5 == MPR1)) || (NP == s && !(pended == 1))) || !(6 == MPR3)) || !(1 == \old(s)) [2018-11-18 15:46:43,122 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) && ((((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || (((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-18 15:46:43,122 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 15:46:43,122 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 15:46:43,122 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) && ((((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP) || \old(Irp) == 0) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(1 == \old(s)))) && (((((((!(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 15:46:43,122 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) && ((((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP) || \old(Irp) == 0) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(1 == \old(s)))) && (((((((!(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 15:46:43,123 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,123 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((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(myStatus) == 259) || !(\old(compRegistered) == 0)) || (((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,124 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)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,124 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,124 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || (((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && \old(customIrp) == customIrp) && s == 1) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,124 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) [2018-11-18 15:46:43,125 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || !(\old(customIrp) == 0) [2018-11-18 15:46:43,126 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 15:46:43,126 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 15:46:43,220 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b9fb3c9-7a22-4346-8433-56bfb524682a/bin-2019/utaipan/witness.graphml [2018-11-18 15:46:43,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:46:43,221 INFO L168 Benchmark]: Toolchain (without parser) took 43043.80 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 955.5 MB in the beginning and 926.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,221 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:46:43,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.99 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 931.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 931.3 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,222 INFO L168 Benchmark]: Boogie Preprocessor took 46.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,222 INFO L168 Benchmark]: RCFGBuilder took 704.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,222 INFO L168 Benchmark]: TraceAbstraction took 41731.51 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 943.2 MB). Free memory was 1.0 GB in the beginning and 949.3 MB in the end (delta: 89.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,222 INFO L168 Benchmark]: Witness Printer took 166.19 ms. Allocated memory is still 2.1 GB. Free memory was 949.3 MB in the beginning and 926.0 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:46:43,224 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.99 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 931.3 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 931.3 MB in the beginning and 1.1 GB in the end (delta: -195.5 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 704.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.3 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41731.51 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 943.2 MB). Free memory was 1.0 GB in the beginning and 949.3 MB in the end (delta: 89.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 166.19 ms. Allocated memory is still 2.1 GB. Free memory was 949.3 MB in the beginning and 926.0 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 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: (((((((((((((((((\old(customIrp) == 1 && ((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp) || MPR3 < NP + 5) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || ((((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || (NP == s && \old(customIrp) == customIrp)) || 1 < \old(setEventCalled)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((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))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || ((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\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)) || 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(myStatus) == 259) || !(\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: (((((((((((((((((\old(customIrp) == 1 && ((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp) || MPR3 < NP + 5) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || ((((((((NP + 4 <= MPR1 && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || (NP == s && \old(customIrp) == customIrp)) || 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) && ((((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP) || \old(Irp) == 0) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(1 == \old(s)))) && (((((((!(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: ((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) && ((((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || (((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((((((((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)) || !(\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(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((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) && !(259 == status))) || !(\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) && ((((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP) || \old(Irp) == 0) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(1 == \old(s)))) && (((((((!(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: ((((((((((((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(myStatus) == 259) || !(\old(compRegistered) == 0)) || (((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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: ((((((((((((((((1 == \old(pended) || !(\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(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((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) && !(259 == status))) || !(\old(customIrp) == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((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))) || !(\old(s) == \old(NP))) || \old(myStatus) == 259) || ((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\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) && ((((((((((MPR3 < NP + 5 || (((!(\old(s) == NP) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((NP == 1 && returnVal2 == 259) && s == 5) || ((returnVal2 == 0 && NP == 1) && s == 5))) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || (((((((((compRetStatus + 1073741802 <= 0 && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && (((NP == 1 && returnVal2 == 259) && s == 5) || ((returnVal2 == 0 && NP == 1) && s == 5))) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1) || \old(Irp) == 0) || !(6 == MPR3)) || MPR3 < NP + 5 || (((!(\old(s) == NP) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || (((((((((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))) && (((((((!(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: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || !(\old(customIrp) == 0) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0)) || (((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && 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)) || 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(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || ((((1 <= compRegistered && DC == s) && !(259 == status)) && routine == 0) && !(pended == 1))) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((1 == \old(pended) || SKIP2 < DC + 2) || !(6 == MPR3)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || (((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && \old(customIrp) == customIrp) && s == 1) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\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: ((((((((((((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(myStatus) == 259) || ((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) && ((((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP)) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s)))) && (((((((((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(1 == NP) || \old(Irp) == 0) || !(0 == routine)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && setEventCalled <= 1)) || !(1 == \old(s)))) && (((((((!(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: ((((((myStatus == 259 || ((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(compRegistered == 1)) || !(5 == MPR1)) || (NP == s && !(pended == 1))) || !(6 == MPR3)) || !(1 == \old(s)) - 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)) || 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(myStatus) == 259) || !(\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, 41.6s OverallTime, 46 OverallIterations, 4 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 9.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 13455 SDtfs, 8505 SDslu, 37149 SDs, 0 SdLazy, 11773 SolverSat, 2271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 922 GetRequests, 545 SyntacticMatches, 13 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3125 ImplicationChecksByTransitivity, 5.1s 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.9s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9438488180591708 AbsIntWeakeningRatio, 2.1481481481481484 AbsIntAvgWeakeningVarsNumRemoved, 10.839506172839506 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 46 MinimizatonAttempts, 1346 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4420 PreInvPairs, 4649 NumberOfFragments, 9381 HoareAnnotationTreeSize, 4420 FomulaSimplifications, 61369 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 109 FomulaSimplificationsInter, 51976 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3504 NumberOfCodeBlocks, 3504 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3619 ConstructedInterpolants, 0 QuantifiedInterpolants, 529398 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 48 InterpolantComputations, 45 PerfectInterpolantSequences, 802/820 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...