./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/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_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/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-aa41828 [2018-11-23 12:48:06,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:48:06,830 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:48:06,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:48:06,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:48:06,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:48:06,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:48:06,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:48:06,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:48:06,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:48:06,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:48:06,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:48:06,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:48:06,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:48:06,845 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:48:06,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:48:06,846 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:48:06,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:48:06,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:48:06,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:48:06,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:48:06,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:48:06,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:48:06,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:48:06,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:48:06,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:48:06,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:48:06,854 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:48:06,854 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:48:06,855 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:48:06,855 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:48:06,856 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:48:06,856 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:48:06,856 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:48:06,857 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:48:06,857 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:48:06,857 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 12:48:06,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:48:06,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:48:06,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:48:06,866 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:48:06,866 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 12:48:06,866 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 12:48:06,866 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 12:48:06,867 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 12:48:06,867 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 12:48:06,867 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 12:48:06,867 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 12:48:06,867 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 12:48:06,867 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 12:48:06,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:48:06,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:48:06,868 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:48:06,868 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:48:06,868 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:48:06,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:48:06,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:48:06,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:48:06,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:48:06,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:48:06,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:48:06,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:48:06,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:48:06,870 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:48:06,870 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 12:48:06,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:48:06,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:48:06,871 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:48:06,871 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_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/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-23 12:48:06,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:48:06,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:48:06,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:48:06,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:48:06,912 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:48:06,912 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 12:48:06,951 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/data/203f1a229/91e5b2522c4f44af865b9a4fab682b89/FLAG6474b3649 [2018-11-23 12:48:07,380 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:48:07,380 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 12:48:07,390 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/data/203f1a229/91e5b2522c4f44af865b9a4fab682b89/FLAG6474b3649 [2018-11-23 12:48:07,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/data/203f1a229/91e5b2522c4f44af865b9a4fab682b89 [2018-11-23 12:48:07,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:48:07,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:48:07,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:48:07,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:48:07,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:48:07,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ca027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07, skipping insertion in model container [2018-11-23 12:48:07,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:48:07,451 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:48:07,642 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:48:07,646 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:48:07,757 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:48:07,775 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:48:07,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07 WrapperNode [2018-11-23 12:48:07,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:48:07,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:48:07,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:48:07,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:48:07,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:48:07,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:48:07,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:48:07,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:48:07,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... [2018-11-23 12:48:07,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:48:07,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:48:07,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:48:07,837 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:48:07,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:48:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 12:48:07,872 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 12:48:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:48:07,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:48:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-11-23 12:48:07,872 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-11-23 12:48:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 12:48:07,873 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 12:48:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 12:48:07,873 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 12:48:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-11-23 12:48:07,873 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-11-23 12:48:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 12:48:07,873 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 12:48:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 12:48:07,874 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 12:48:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-23 12:48:07,874 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-23 12:48:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 12:48:07,874 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 12:48:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 12:48:07,874 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 12:48:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-11-23 12:48:07,875 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-11-23 12:48:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-11-23 12:48:07,875 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-11-23 12:48:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-11-23 12:48:07,875 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-11-23 12:48:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-11-23 12:48:07,875 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-11-23 12:48:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-11-23 12:48:07,875 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-11-23 12:48:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-11-23 12:48:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-11-23 12:48:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-11-23 12:48:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-11-23 12:48:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 12:48:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 12:48:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-11-23 12:48:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-11-23 12:48:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 12:48:07,876 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 12:48:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-11-23 12:48:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-11-23 12:48:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-11-23 12:48:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-11-23 12:48:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-11-23 12:48:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-11-23 12:48:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:48:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:48:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:48:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:48:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-11-23 12:48:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-11-23 12:48:08,070 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:48:08,070 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:48:08,245 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:48:08,245 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:48:08,296 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:48:08,296 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:48:08,321 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:48:08,321 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:48:08,457 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:48:08,458 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:48:08,531 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 12:48:08,531 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 12:48:08,577 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:48:08,577 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:48:08,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:48:08 BoogieIcfgContainer [2018-11-23 12:48:08,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:48:08,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:48:08,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:48:08,581 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:48:08,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:48:07" (1/3) ... [2018-11-23 12:48:08,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ed459c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:48:08, skipping insertion in model container [2018-11-23 12:48:08,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:48:07" (2/3) ... [2018-11-23 12:48:08,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ed459c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:48:08, skipping insertion in model container [2018-11-23 12:48:08,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:48:08" (3/3) ... [2018-11-23 12:48:08,584 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-23 12:48:08,592 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:48:08,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:48:08,613 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:48:08,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:48:08,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:48:08,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:48:08,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:48:08,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:48:08,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:48:08,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:48:08,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:48:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2018-11-23 12:48:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:48:08,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:08,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:08,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:08,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2018-11-23 12:48:08,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:08,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:08,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:08,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:08,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:08,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:08,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:08,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:08,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:08,827 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2018-11-23 12:48:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:08,955 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2018-11-23 12:48:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:08,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:48:08,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:08,964 INFO L225 Difference]: With dead ends: 537 [2018-11-23 12:48:08,964 INFO L226 Difference]: Without dead ends: 287 [2018-11-23 12:48:08,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-23 12:48:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-23 12:48:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-23 12:48:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2018-11-23 12:48:09,011 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2018-11-23 12:48:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:09,012 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2018-11-23 12:48:09,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2018-11-23 12:48:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:48:09,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:09,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:09,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:09,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:09,013 INFO L82 PathProgramCache]: Analyzing trace with hash -415593342, now seen corresponding path program 1 times [2018-11-23 12:48:09,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:09,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:09,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:09,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:09,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:09,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:09,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:09,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,120 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2018-11-23 12:48:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:09,268 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2018-11-23 12:48:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:09,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:48:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:09,274 INFO L225 Difference]: With dead ends: 637 [2018-11-23 12:48:09,274 INFO L226 Difference]: Without dead ends: 454 [2018-11-23 12:48:09,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-11-23 12:48:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2018-11-23 12:48:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-23 12:48:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2018-11-23 12:48:09,311 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2018-11-23 12:48:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:09,311 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2018-11-23 12:48:09,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2018-11-23 12:48:09,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:48:09,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:09,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:09,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:09,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1358856561, now seen corresponding path program 1 times [2018-11-23 12:48:09,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:09,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:09,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:09,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:09,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:09,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:09,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,383 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2018-11-23 12:48:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:09,432 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2018-11-23 12:48:09,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:09,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 12:48:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:09,437 INFO L225 Difference]: With dead ends: 963 [2018-11-23 12:48:09,437 INFO L226 Difference]: Without dead ends: 646 [2018-11-23 12:48:09,439 INFO L631 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-23 12:48:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-23 12:48:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2018-11-23 12:48:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-23 12:48:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2018-11-23 12:48:09,474 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2018-11-23 12:48:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:09,475 INFO L480 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2018-11-23 12:48:09,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2018-11-23 12:48:09,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:48:09,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:09,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:09,477 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:09,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2018-11-23 12:48:09,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:09,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:09,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:09,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:09,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:09,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:09,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,532 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2018-11-23 12:48:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:09,598 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2018-11-23 12:48:09,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:09,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 12:48:09,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:09,601 INFO L225 Difference]: With dead ends: 621 [2018-11-23 12:48:09,601 INFO L226 Difference]: Without dead ends: 617 [2018-11-23 12:48:09,602 INFO L631 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-23 12:48:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-23 12:48:09,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2018-11-23 12:48:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-23 12:48:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2018-11-23 12:48:09,627 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2018-11-23 12:48:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:09,627 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2018-11-23 12:48:09,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2018-11-23 12:48:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:48:09,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:09,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:09,629 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:09,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 185749717, now seen corresponding path program 1 times [2018-11-23 12:48:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:09,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:09,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:09,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:09,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,671 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2018-11-23 12:48:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:09,720 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2018-11-23 12:48:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:09,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:48:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:09,726 INFO L225 Difference]: With dead ends: 1072 [2018-11-23 12:48:09,726 INFO L226 Difference]: Without dead ends: 1053 [2018-11-23 12:48:09,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2018-11-23 12:48:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2018-11-23 12:48:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-23 12:48:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2018-11-23 12:48:09,763 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2018-11-23 12:48:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:09,764 INFO L480 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2018-11-23 12:48:09,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2018-11-23 12:48:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:48:09,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:09,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:09,765 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:09,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash 171404808, now seen corresponding path program 1 times [2018-11-23 12:48:09,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:09,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:09,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:09,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:09,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:09,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:09,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:09,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,804 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2018-11-23 12:48:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:09,886 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2018-11-23 12:48:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:09,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-23 12:48:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:09,891 INFO L225 Difference]: With dead ends: 1050 [2018-11-23 12:48:09,891 INFO L226 Difference]: Without dead ends: 1045 [2018-11-23 12:48:09,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-11-23 12:48:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2018-11-23 12:48:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-11-23 12:48:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2018-11-23 12:48:09,945 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2018-11-23 12:48:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:09,945 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2018-11-23 12:48:09,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2018-11-23 12:48:09,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:48:09,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:09,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:09,947 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:09,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1471308180, now seen corresponding path program 1 times [2018-11-23 12:48:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:09,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:09,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:09,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:09,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:09,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:09,987 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2018-11-23 12:48:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:10,032 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2018-11-23 12:48:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:48:10,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-23 12:48:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:10,036 INFO L225 Difference]: With dead ends: 1058 [2018-11-23 12:48:10,036 INFO L226 Difference]: Without dead ends: 1036 [2018-11-23 12:48:10,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-23 12:48:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2018-11-23 12:48:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-11-23 12:48:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2018-11-23 12:48:10,066 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2018-11-23 12:48:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:10,066 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2018-11-23 12:48:10,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2018-11-23 12:48:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:48:10,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:10,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:10,067 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:10,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:10,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1601291379, now seen corresponding path program 1 times [2018-11-23 12:48:10,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:10,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:10,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:10,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:10,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:10,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:10,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:10,108 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2018-11-23 12:48:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:10,137 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2018-11-23 12:48:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:10,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-23 12:48:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:10,140 INFO L225 Difference]: With dead ends: 1448 [2018-11-23 12:48:10,140 INFO L226 Difference]: Without dead ends: 578 [2018-11-23 12:48:10,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-11-23 12:48:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2018-11-23 12:48:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-23 12:48:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2018-11-23 12:48:10,160 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2018-11-23 12:48:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:10,161 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2018-11-23 12:48:10,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2018-11-23 12:48:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:48:10,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:10,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:10,162 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:10,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2018-11-23 12:48:10,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:10,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:10,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:10,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:10,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:10,207 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 5 states. [2018-11-23 12:48:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:10,421 INFO L93 Difference]: Finished difference Result 586 states and 829 transitions. [2018-11-23 12:48:10,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:48:10,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-11-23 12:48:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:10,424 INFO L225 Difference]: With dead ends: 586 [2018-11-23 12:48:10,424 INFO L226 Difference]: Without dead ends: 580 [2018-11-23 12:48:10,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-23 12:48:10,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-11-23 12:48:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-23 12:48:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2018-11-23 12:48:10,443 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2018-11-23 12:48:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:10,443 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2018-11-23 12:48:10,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2018-11-23 12:48:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:48:10,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:10,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:10,445 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:10,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:10,445 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2018-11-23 12:48:10,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:10,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:10,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:10,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:10,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:10,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:10,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:10,481 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 5 states. [2018-11-23 12:48:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:10,679 INFO L93 Difference]: Finished difference Result 586 states and 828 transitions. [2018-11-23 12:48:10,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:48:10,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-11-23 12:48:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:10,682 INFO L225 Difference]: With dead ends: 586 [2018-11-23 12:48:10,682 INFO L226 Difference]: Without dead ends: 580 [2018-11-23 12:48:10,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-11-23 12:48:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 578. [2018-11-23 12:48:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-11-23 12:48:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2018-11-23 12:48:10,703 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2018-11-23 12:48:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:10,703 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2018-11-23 12:48:10,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2018-11-23 12:48:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:48:10,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:10,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:10,704 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:10,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2018-11-23 12:48:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:10,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:10,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:10,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:10,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:10,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:10,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:10,755 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2018-11-23 12:48:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:10,795 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2018-11-23 12:48:10,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:48:10,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 12:48:10,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:10,797 INFO L225 Difference]: With dead ends: 601 [2018-11-23 12:48:10,797 INFO L226 Difference]: Without dead ends: 576 [2018-11-23 12:48:10,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-11-23 12:48:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2018-11-23 12:48:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2018-11-23 12:48:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2018-11-23 12:48:10,817 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2018-11-23 12:48:10,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:10,817 INFO L480 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2018-11-23 12:48:10,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2018-11-23 12:48:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:48:10,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:10,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:10,818 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:10,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1921382045, now seen corresponding path program 1 times [2018-11-23 12:48:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:10,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:10,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:10,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:10,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:10,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:10,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:10,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:10,855 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2018-11-23 12:48:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:10,948 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2018-11-23 12:48:10,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:10,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 12:48:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:10,951 INFO L225 Difference]: With dead ends: 810 [2018-11-23 12:48:10,951 INFO L226 Difference]: Without dead ends: 802 [2018-11-23 12:48:10,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2018-11-23 12:48:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2018-11-23 12:48:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-23 12:48:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2018-11-23 12:48:10,979 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2018-11-23 12:48:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:10,980 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2018-11-23 12:48:10,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2018-11-23 12:48:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:48:10,981 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:10,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:10,981 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:10,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash 488507897, now seen corresponding path program 1 times [2018-11-23 12:48:10,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:10,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:10,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:11,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:11,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:48:11,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:11,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:48:11,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:48:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:48:11,034 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2018-11-23 12:48:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:11,166 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2018-11-23 12:48:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:48:11,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-23 12:48:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:11,168 INFO L225 Difference]: With dead ends: 719 [2018-11-23 12:48:11,168 INFO L226 Difference]: Without dead ends: 452 [2018-11-23 12:48:11,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:48:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-23 12:48:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2018-11-23 12:48:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-11-23 12:48:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2018-11-23 12:48:11,187 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2018-11-23 12:48:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:11,187 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2018-11-23 12:48:11,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:48:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2018-11-23 12:48:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:48:11,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:11,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:11,188 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:11,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1019702007, now seen corresponding path program 1 times [2018-11-23 12:48:11,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:11,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:11,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:48:11,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:11,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:48:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:48:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:48:11,268 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2018-11-23 12:48:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:11,370 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2018-11-23 12:48:11,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:48:11,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 12:48:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:11,373 INFO L225 Difference]: With dead ends: 447 [2018-11-23 12:48:11,373 INFO L226 Difference]: Without dead ends: 443 [2018-11-23 12:48:11,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:48:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-23 12:48:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2018-11-23 12:48:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-11-23 12:48:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2018-11-23 12:48:11,387 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2018-11-23 12:48:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:11,387 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2018-11-23 12:48:11,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:48:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2018-11-23 12:48:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:48:11,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:11,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:11,388 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:11,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1019425177, now seen corresponding path program 1 times [2018-11-23 12:48:11,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:11,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:11,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:48:11,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:11,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:48:11,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:48:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:48:11,438 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2018-11-23 12:48:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:11,487 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2018-11-23 12:48:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:48:11,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 12:48:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:11,489 INFO L225 Difference]: With dead ends: 760 [2018-11-23 12:48:11,489 INFO L226 Difference]: Without dead ends: 462 [2018-11-23 12:48:11,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:48:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-11-23 12:48:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-11-23 12:48:11,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-23 12:48:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2018-11-23 12:48:11,505 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2018-11-23 12:48:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:11,505 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2018-11-23 12:48:11,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:48:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-11-23 12:48:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:48:11,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:11,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:11,506 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:11,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:11,507 INFO L82 PathProgramCache]: Analyzing trace with hash 56692718, now seen corresponding path program 1 times [2018-11-23 12:48:11,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:11,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:11,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:11,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:11,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:11,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:11,554 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2018-11-23 12:48:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:11,851 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2018-11-23 12:48:11,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:48:11,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:48:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:11,853 INFO L225 Difference]: With dead ends: 580 [2018-11-23 12:48:11,854 INFO L226 Difference]: Without dead ends: 561 [2018-11-23 12:48:11,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-11-23 12:48:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2018-11-23 12:48:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-23 12:48:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2018-11-23 12:48:11,872 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2018-11-23 12:48:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:11,872 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2018-11-23 12:48:11,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2018-11-23 12:48:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:48:11,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:11,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:11,873 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:11,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:11,873 INFO L82 PathProgramCache]: Analyzing trace with hash -420532410, now seen corresponding path program 1 times [2018-11-23 12:48:11,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:11,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:11,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:11,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:48:11,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:11,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:48:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:48:11,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:48:11,918 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2018-11-23 12:48:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:12,007 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2018-11-23 12:48:12,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:48:12,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-23 12:48:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:12,009 INFO L225 Difference]: With dead ends: 448 [2018-11-23 12:48:12,009 INFO L226 Difference]: Without dead ends: 417 [2018-11-23 12:48:12,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:48:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-23 12:48:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-11-23 12:48:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-23 12:48:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2018-11-23 12:48:12,025 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2018-11-23 12:48:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:12,025 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2018-11-23 12:48:12,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:48:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2018-11-23 12:48:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:48:12,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:12,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:12,026 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:12,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2018-11-23 12:48:12,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:12,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:12,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:12,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:12,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:12,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:12,063 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2018-11-23 12:48:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:12,092 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2018-11-23 12:48:12,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:12,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-23 12:48:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:12,094 INFO L225 Difference]: With dead ends: 432 [2018-11-23 12:48:12,094 INFO L226 Difference]: Without dead ends: 399 [2018-11-23 12:48:12,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-23 12:48:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-11-23 12:48:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-23 12:48:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2018-11-23 12:48:12,108 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2018-11-23 12:48:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:12,108 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2018-11-23 12:48:12,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2018-11-23 12:48:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:48:12,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:12,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:12,109 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:12,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2018-11-23 12:48:12,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:12,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:48:12,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:12,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:48:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:48:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:48:12,159 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2018-11-23 12:48:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:12,236 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2018-11-23 12:48:12,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:48:12,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-23 12:48:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:12,238 INFO L225 Difference]: With dead ends: 429 [2018-11-23 12:48:12,238 INFO L226 Difference]: Without dead ends: 408 [2018-11-23 12:48:12,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:48:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-23 12:48:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-11-23 12:48:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-23 12:48:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-11-23 12:48:12,252 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2018-11-23 12:48:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:12,252 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-11-23 12:48:12,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:48:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-11-23 12:48:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:48:12,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:12,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:12,253 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:12,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2018-11-23 12:48:12,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:12,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:12,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:48:12,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:12,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:48:12,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:48:12,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:48:12,284 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-11-23 12:48:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:12,308 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-11-23 12:48:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:48:12,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-23 12:48:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:12,310 INFO L225 Difference]: With dead ends: 436 [2018-11-23 12:48:12,310 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 12:48:12,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 12:48:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-11-23 12:48:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-23 12:48:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-11-23 12:48:12,324 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-11-23 12:48:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:12,324 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-11-23 12:48:12,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:48:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-11-23 12:48:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:48:12,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:12,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:12,325 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:12,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2018-11-23 12:48:12,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:12,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:12,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:48:12,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:12,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:48:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:48:12,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:12,374 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-11-23 12:48:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:12,787 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-11-23 12:48:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:48:12,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 12:48:12,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:12,790 INFO L225 Difference]: With dead ends: 565 [2018-11-23 12:48:12,790 INFO L226 Difference]: Without dead ends: 511 [2018-11-23 12:48:12,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:48:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-23 12:48:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-11-23 12:48:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-23 12:48:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-11-23 12:48:12,810 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-11-23 12:48:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:12,810 INFO L480 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-11-23 12:48:12,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:48:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-11-23 12:48:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:48:12,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:12,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:12,811 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:12,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2018-11-23 12:48:12,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:12,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:12,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:12,831 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-11-23 12:48:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:12,914 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-11-23 12:48:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:12,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 12:48:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:12,918 INFO L225 Difference]: With dead ends: 673 [2018-11-23 12:48:12,918 INFO L226 Difference]: Without dead ends: 659 [2018-11-23 12:48:12,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-23 12:48:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-11-23 12:48:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-11-23 12:48:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-11-23 12:48:12,944 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-11-23 12:48:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:12,944 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-11-23 12:48:12,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-11-23 12:48:12,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:48:12,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:12,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:12,945 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:12,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:12,945 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2018-11-23 12:48:12,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:12,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:12,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:12,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:48:12,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:12,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:48:12,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:48:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:48:12,990 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-11-23 12:48:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:13,034 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-11-23 12:48:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:48:13,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-11-23 12:48:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:13,036 INFO L225 Difference]: With dead ends: 598 [2018-11-23 12:48:13,036 INFO L226 Difference]: Without dead ends: 574 [2018-11-23 12:48:13,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:48:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-23 12:48:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-23 12:48:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-23 12:48:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-11-23 12:48:13,059 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-11-23 12:48:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:13,060 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-11-23 12:48:13,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:48:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-11-23 12:48:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:48:13,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:13,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:13,060 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:13,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2018-11-23 12:48:13,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:13,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:13,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:13,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:13,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:13,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:13,100 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-11-23 12:48:13,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:13,372 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-11-23 12:48:13,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:48:13,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-23 12:48:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:13,375 INFO L225 Difference]: With dead ends: 660 [2018-11-23 12:48:13,375 INFO L226 Difference]: Without dead ends: 624 [2018-11-23 12:48:13,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-11-23 12:48:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-11-23 12:48:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-23 12:48:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-23 12:48:13,400 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-11-23 12:48:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:13,400 INFO L480 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-23 12:48:13,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-11-23 12:48:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:48:13,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:13,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:13,401 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:13,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1927592443, now seen corresponding path program 1 times [2018-11-23 12:48:13,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:13,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:13,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:13,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:13,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:13,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:13,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:13,435 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-11-23 12:48:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:13,480 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-11-23 12:48:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:13,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-23 12:48:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:13,483 INFO L225 Difference]: With dead ends: 955 [2018-11-23 12:48:13,483 INFO L226 Difference]: Without dead ends: 527 [2018-11-23 12:48:13,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:13,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-11-23 12:48:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-11-23 12:48:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-23 12:48:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-11-23 12:48:13,507 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-11-23 12:48:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:13,507 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-11-23 12:48:13,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-11-23 12:48:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:48:13,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:13,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:13,508 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:13,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1553434371, now seen corresponding path program 1 times [2018-11-23 12:48:13,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:13,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:13,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:13,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:48:13,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:13,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:48:13,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:48:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:48:13,573 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-11-23 12:48:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:13,675 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-11-23 12:48:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:48:13,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-23 12:48:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:13,678 INFO L225 Difference]: With dead ends: 529 [2018-11-23 12:48:13,678 INFO L226 Difference]: Without dead ends: 466 [2018-11-23 12:48:13,678 INFO L631 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-23 12:48:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-11-23 12:48:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-11-23 12:48:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-23 12:48:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-11-23 12:48:13,699 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-11-23 12:48:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:13,699 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-11-23 12:48:13,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:48:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-11-23 12:48:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 12:48:13,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:13,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:13,700 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:13,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1051956534, now seen corresponding path program 1 times [2018-11-23 12:48:13,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:13,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:13,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:13,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:13,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:13,746 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-11-23 12:48:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:13,788 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-11-23 12:48:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:13,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-23 12:48:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:13,791 INFO L225 Difference]: With dead ends: 918 [2018-11-23 12:48:13,791 INFO L226 Difference]: Without dead ends: 491 [2018-11-23 12:48:13,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-23 12:48:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-11-23 12:48:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-23 12:48:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-11-23 12:48:13,814 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-11-23 12:48:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:13,815 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-11-23 12:48:13,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-11-23 12:48:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 12:48:13,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:13,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:13,815 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:13,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:13,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1770735671, now seen corresponding path program 1 times [2018-11-23 12:48:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:13,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:13,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:48:13,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:13,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:48:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:48:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:13,869 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-11-23 12:48:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:13,933 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-11-23 12:48:13,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:48:13,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-23 12:48:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:13,936 INFO L225 Difference]: With dead ends: 730 [2018-11-23 12:48:13,936 INFO L226 Difference]: Without dead ends: 727 [2018-11-23 12:48:13,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:48:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-23 12:48:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-11-23 12:48:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-11-23 12:48:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-11-23 12:48:13,963 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-11-23 12:48:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:13,963 INFO L480 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-11-23 12:48:13,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:48:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-11-23 12:48:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 12:48:13,964 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:13,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:13,964 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:13,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1533013073, now seen corresponding path program 1 times [2018-11-23 12:48:13,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:13,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:13,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:13,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:14,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:14,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:14,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:14,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:14,062 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 6 states. [2018-11-23 12:48:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:14,099 INFO L93 Difference]: Finished difference Result 755 states and 1177 transitions. [2018-11-23 12:48:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:14,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-23 12:48:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:14,102 INFO L225 Difference]: With dead ends: 755 [2018-11-23 12:48:14,102 INFO L226 Difference]: Without dead ends: 312 [2018-11-23 12:48:14,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-23 12:48:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-11-23 12:48:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 12:48:14,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 435 transitions. [2018-11-23 12:48:14,122 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 435 transitions. Word has length 65 [2018-11-23 12:48:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:14,122 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 435 transitions. [2018-11-23 12:48:14,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 435 transitions. [2018-11-23 12:48:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 12:48:14,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:14,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:14,123 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:14,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash -620931734, now seen corresponding path program 1 times [2018-11-23 12:48:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:14,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:14,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:14,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:14,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:14,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:14,169 INFO L87 Difference]: Start difference. First operand 312 states and 435 transitions. Second operand 5 states. [2018-11-23 12:48:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:14,301 INFO L93 Difference]: Finished difference Result 579 states and 830 transitions. [2018-11-23 12:48:14,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:48:14,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-23 12:48:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:14,303 INFO L225 Difference]: With dead ends: 579 [2018-11-23 12:48:14,303 INFO L226 Difference]: Without dead ends: 307 [2018-11-23 12:48:14,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-23 12:48:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-23 12:48:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-23 12:48:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-11-23 12:48:14,323 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-11-23 12:48:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:14,323 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-11-23 12:48:14,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-11-23 12:48:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 12:48:14,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:14,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:14,324 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:14,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash -943590000, now seen corresponding path program 1 times [2018-11-23 12:48:14,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:14,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:14,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:14,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:14,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:14,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:14,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:14,399 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 5 states. [2018-11-23 12:48:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:14,680 INFO L93 Difference]: Finished difference Result 669 states and 953 transitions. [2018-11-23 12:48:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:14,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-23 12:48:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:14,682 INFO L225 Difference]: With dead ends: 669 [2018-11-23 12:48:14,682 INFO L226 Difference]: Without dead ends: 405 [2018-11-23 12:48:14,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:48:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-11-23 12:48:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 363. [2018-11-23 12:48:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-23 12:48:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 503 transitions. [2018-11-23 12:48:14,703 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 503 transitions. Word has length 71 [2018-11-23 12:48:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:14,703 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 503 transitions. [2018-11-23 12:48:14,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 503 transitions. [2018-11-23 12:48:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:48:14,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:14,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:14,704 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:14,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1587959962, now seen corresponding path program 1 times [2018-11-23 12:48:14,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:14,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:14,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:14,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:14,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:14,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:14,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:14,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:14,779 INFO L87 Difference]: Start difference. First operand 363 states and 503 transitions. Second operand 6 states. [2018-11-23 12:48:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:14,828 INFO L93 Difference]: Finished difference Result 691 states and 982 transitions. [2018-11-23 12:48:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:14,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-23 12:48:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:14,831 INFO L225 Difference]: With dead ends: 691 [2018-11-23 12:48:14,831 INFO L226 Difference]: Without dead ends: 369 [2018-11-23 12:48:14,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-23 12:48:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-11-23 12:48:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-23 12:48:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 505 transitions. [2018-11-23 12:48:14,864 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 505 transitions. Word has length 72 [2018-11-23 12:48:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:14,864 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 505 transitions. [2018-11-23 12:48:14,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 505 transitions. [2018-11-23 12:48:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 12:48:14,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:14,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:14,865 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:14,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1286621045, now seen corresponding path program 1 times [2018-11-23 12:48:14,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:14,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:14,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:14,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:14,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:14,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:14,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:14,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:14,915 INFO L87 Difference]: Start difference. First operand 366 states and 505 transitions. Second operand 6 states. [2018-11-23 12:48:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:15,223 INFO L93 Difference]: Finished difference Result 642 states and 895 transitions. [2018-11-23 12:48:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:48:15,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-11-23 12:48:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:15,227 INFO L225 Difference]: With dead ends: 642 [2018-11-23 12:48:15,227 INFO L226 Difference]: Without dead ends: 337 [2018-11-23 12:48:15,228 INFO L631 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-23 12:48:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-23 12:48:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-11-23 12:48:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-23 12:48:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 441 transitions. [2018-11-23 12:48:15,258 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 441 transitions. Word has length 83 [2018-11-23 12:48:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:15,259 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 441 transitions. [2018-11-23 12:48:15,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 441 transitions. [2018-11-23 12:48:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:48:15,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:15,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:15,260 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:15,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash -49085271, now seen corresponding path program 1 times [2018-11-23 12:48:15,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:15,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:15,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:15,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:15,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:15,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 12:48:15,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:15,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:48:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:48:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:48:15,399 INFO L87 Difference]: Start difference. First operand 329 states and 441 transitions. Second operand 15 states. [2018-11-23 12:48:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:15,617 INFO L93 Difference]: Finished difference Result 626 states and 853 transitions. [2018-11-23 12:48:15,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:48:15,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-11-23 12:48:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:15,620 INFO L225 Difference]: With dead ends: 626 [2018-11-23 12:48:15,620 INFO L226 Difference]: Without dead ends: 333 [2018-11-23 12:48:15,622 INFO L631 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-23 12:48:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-23 12:48:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 332. [2018-11-23 12:48:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-23 12:48:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 443 transitions. [2018-11-23 12:48:15,655 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 443 transitions. Word has length 92 [2018-11-23 12:48:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:15,655 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 443 transitions. [2018-11-23 12:48:15,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:48:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 443 transitions. [2018-11-23 12:48:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 12:48:15,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:15,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:15,657 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:15,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310540, now seen corresponding path program 1 times [2018-11-23 12:48:15,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:15,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:15,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:15,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:15,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:48:15,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:15,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:48:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:48:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:48:15,817 INFO L87 Difference]: Start difference. First operand 332 states and 443 transitions. Second operand 14 states. [2018-11-23 12:48:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:16,591 INFO L93 Difference]: Finished difference Result 364 states and 472 transitions. [2018-11-23 12:48:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:48:16,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-23 12:48:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:16,593 INFO L225 Difference]: With dead ends: 364 [2018-11-23 12:48:16,593 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 12:48:16,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:48:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 12:48:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2018-11-23 12:48:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-23 12:48:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 423 transitions. [2018-11-23 12:48:16,622 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 423 transitions. Word has length 103 [2018-11-23 12:48:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:16,622 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 423 transitions. [2018-11-23 12:48:16,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:48:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2018-11-23 12:48:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:48:16,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:16,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:16,624 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:16,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash -12169486, now seen corresponding path program 1 times [2018-11-23 12:48:16,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:16,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:16,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:16,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:16,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 12:48:16,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:16,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:48:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:48:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:48:16,757 INFO L87 Difference]: Start difference. First operand 317 states and 423 transitions. Second operand 15 states. [2018-11-23 12:48:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:16,904 INFO L93 Difference]: Finished difference Result 353 states and 468 transitions. [2018-11-23 12:48:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:48:16,905 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-11-23 12:48:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:16,907 INFO L225 Difference]: With dead ends: 353 [2018-11-23 12:48:16,907 INFO L226 Difference]: Without dead ends: 326 [2018-11-23 12:48:16,908 INFO L631 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-23 12:48:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-23 12:48:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-11-23 12:48:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-23 12:48:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 433 transitions. [2018-11-23 12:48:16,934 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 433 transitions. Word has length 108 [2018-11-23 12:48:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:16,935 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 433 transitions. [2018-11-23 12:48:16,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:48:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 433 transitions. [2018-11-23 12:48:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:48:16,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:16,936 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:16,937 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:16,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:16,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1168498032, now seen corresponding path program 1 times [2018-11-23 12:48:16,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:16,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:16,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:16,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:16,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:48:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:48:16,999 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:16,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:48:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:48:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:48:16,999 INFO L87 Difference]: Start difference. First operand 325 states and 433 transitions. Second operand 5 states. [2018-11-23 12:48:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:17,311 INFO L93 Difference]: Finished difference Result 709 states and 929 transitions. [2018-11-23 12:48:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:17,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2018-11-23 12:48:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:17,313 INFO L225 Difference]: With dead ends: 709 [2018-11-23 12:48:17,313 INFO L226 Difference]: Without dead ends: 447 [2018-11-23 12:48:17,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-23 12:48:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-23 12:48:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-11-23 12:48:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-23 12:48:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-11-23 12:48:17,349 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 132 [2018-11-23 12:48:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:17,349 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-11-23 12:48:17,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:48:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-11-23 12:48:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 12:48:17,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:17,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:17,350 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:17,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash 587949524, now seen corresponding path program 1 times [2018-11-23 12:48:17,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:17,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:17,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:48:17,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:17,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 12:48:17,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:17,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:48:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:48:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:48:17,529 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 14 states. [2018-11-23 12:48:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:18,458 INFO L93 Difference]: Finished difference Result 405 states and 514 transitions. [2018-11-23 12:48:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:48:18,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-11-23 12:48:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:18,459 INFO L225 Difference]: With dead ends: 405 [2018-11-23 12:48:18,460 INFO L226 Difference]: Without dead ends: 341 [2018-11-23 12:48:18,460 INFO L631 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-23 12:48:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-23 12:48:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 275. [2018-11-23 12:48:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-23 12:48:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 333 transitions. [2018-11-23 12:48:18,486 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 333 transitions. Word has length 120 [2018-11-23 12:48:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:18,486 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 333 transitions. [2018-11-23 12:48:18,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:48:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 333 transitions. [2018-11-23 12:48:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 12:48:18,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:18,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:48:18,488 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:18,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2028223534, now seen corresponding path program 1 times [2018-11-23 12:48:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:18,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:18,564 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-23 12:48:18,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:18,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:18,564 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:18,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:18,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:18,567 INFO L87 Difference]: Start difference. First operand 275 states and 333 transitions. Second operand 6 states. [2018-11-23 12:48:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:18,650 INFO L93 Difference]: Finished difference Result 468 states and 592 transitions. [2018-11-23 12:48:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:18,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-23 12:48:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:18,652 INFO L225 Difference]: With dead ends: 468 [2018-11-23 12:48:18,652 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 12:48:18,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 12:48:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-11-23 12:48:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-23 12:48:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 320 transitions. [2018-11-23 12:48:18,680 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 320 transitions. Word has length 121 [2018-11-23 12:48:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:18,680 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 320 transitions. [2018-11-23 12:48:18,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 320 transitions. [2018-11-23 12:48:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:48:18,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:18,682 INFO L402 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-23 12:48:18,682 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:18,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:18,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1150164970, now seen corresponding path program 1 times [2018-11-23 12:48:18,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:18,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:18,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:18,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:18,755 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-23 12:48:18,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:48:18,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:48:18,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-23 12:48:18,758 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], [537], [542], [545], [548], [550], [556], [559], [567], [570], [572], [577], [580], [584], [592], [595], [598], [600], [611], [612], [613], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [747], [748], [749], [750], [769], [770], [773], [774], [775], [776], [777], [778], [779], [793], [794], [797], [798], [801], [802], [805], [811], [812], [813] [2018-11-23 12:48:18,798 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:48:18,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:48:19,466 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 12:48:19,467 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-23 12:48:19,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:19,477 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 12:48:19,864 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 84.78% of their original sizes. [2018-11-23 12:48:19,864 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 12:48:20,866 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-11-23 12:48:20,866 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 12:48:20,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:48:20,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [6] total 61 [2018-11-23 12:48:20,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:20,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:48:20,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:48:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2909, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:48:20,869 INFO L87 Difference]: Start difference. First operand 269 states and 320 transitions. Second operand 57 states. [2018-11-23 12:48:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:36,478 INFO L93 Difference]: Finished difference Result 576 states and 743 transitions. [2018-11-23 12:48:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-23 12:48:36,478 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-11-23 12:48:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:36,480 INFO L225 Difference]: With dead ends: 576 [2018-11-23 12:48:36,480 INFO L226 Difference]: Without dead ends: 401 [2018-11-23 12:48:36,483 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 216 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1111, Invalid=11099, Unknown=0, NotChecked=0, Total=12210 [2018-11-23 12:48:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-11-23 12:48:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 281. [2018-11-23 12:48:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-23 12:48:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 325 transitions. [2018-11-23 12:48:36,526 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 325 transitions. Word has length 163 [2018-11-23 12:48:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:36,527 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 325 transitions. [2018-11-23 12:48:36,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:48:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 325 transitions. [2018-11-23 12:48:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 12:48:36,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:36,528 INFO L402 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-23 12:48:36,529 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:36,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:36,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1794911829, now seen corresponding path program 1 times [2018-11-23 12:48:36,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:36,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:36,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:36,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:36,611 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-23 12:48:36,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:48:36,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 12:48:36,612 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-11-23 12:48:36,612 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], [537], [542], [545], [548], [550], [556], [559], [567], [570], [572], [577], [580], [584], [592], [595], [598], [600], [611], [612], [613], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [747], [748], [749], [750], [769], [770], [773], [774], [775], [776], [777], [778], [779], [793], [794], [797], [798], [801], [802], [805], [811], [812], [813] [2018-11-23 12:48:36,616 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 12:48:36,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 12:48:36,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 12:48:36,959 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-23 12:48:36,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:36,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 12:48:36,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:48:36,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/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-23 12:48:36,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:36,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 12:48:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:37,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:48:37,324 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-23 12:48:37,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 12:48:37,483 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-23 12:48:37,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:48:37,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2018-11-23 12:48:37,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:37,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:48:37,500 INFO L87 Difference]: Start difference. First operand 281 states and 325 transitions. Second operand 6 states. [2018-11-23 12:48:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:37,586 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2018-11-23 12:48:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:37,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2018-11-23 12:48:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:37,590 INFO L225 Difference]: With dead ends: 448 [2018-11-23 12:48:37,591 INFO L226 Difference]: Without dead ends: 296 [2018-11-23 12:48:37,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:48:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-23 12:48:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2018-11-23 12:48:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-23 12:48:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-11-23 12:48:37,632 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 163 [2018-11-23 12:48:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:37,632 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-11-23 12:48:37,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-11-23 12:48:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-23 12:48:37,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:37,634 INFO L402 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-23 12:48:37,634 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:37,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash -974469450, now seen corresponding path program 1 times [2018-11-23 12:48:37,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:37,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:37,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:37,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:37,716 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-23 12:48:37,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:37,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:37,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:37,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:37,718 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 6 states. [2018-11-23 12:48:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:37,797 INFO L93 Difference]: Finished difference Result 453 states and 534 transitions. [2018-11-23 12:48:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:37,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-11-23 12:48:37,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:37,800 INFO L225 Difference]: With dead ends: 453 [2018-11-23 12:48:37,800 INFO L226 Difference]: Without dead ends: 319 [2018-11-23 12:48:37,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-23 12:48:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 284. [2018-11-23 12:48:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-23 12:48:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 324 transitions. [2018-11-23 12:48:37,840 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 324 transitions. Word has length 164 [2018-11-23 12:48:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:37,840 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 324 transitions. [2018-11-23 12:48:37,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 324 transitions. [2018-11-23 12:48:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:48:37,842 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:37,842 INFO L402 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-23 12:48:37,842 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:37,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1046099915, now seen corresponding path program 1 times [2018-11-23 12:48:37,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:37,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:37,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:37,922 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-23 12:48:37,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:37,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:37,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:37,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:37,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:37,923 INFO L87 Difference]: Start difference. First operand 284 states and 324 transitions. Second operand 6 states. [2018-11-23 12:48:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:37,997 INFO L93 Difference]: Finished difference Result 344 states and 391 transitions. [2018-11-23 12:48:37,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:37,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-11-23 12:48:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:37,999 INFO L225 Difference]: With dead ends: 344 [2018-11-23 12:48:37,999 INFO L226 Difference]: Without dead ends: 271 [2018-11-23 12:48:38,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-23 12:48:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2018-11-23 12:48:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-23 12:48:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2018-11-23 12:48:38,030 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 204 [2018-11-23 12:48:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:38,031 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2018-11-23 12:48:38,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2018-11-23 12:48:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-23 12:48:38,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:48:38,033 INFO L402 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-23 12:48:38,033 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:48:38,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:48:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1129206307, now seen corresponding path program 1 times [2018-11-23 12:48:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 12:48:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:38,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:48:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:48:38,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 12:48:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:48:38,125 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-23 12:48:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:48:38,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:48:38,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 12:48:38,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:48:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:48:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:48:38,126 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand 6 states. [2018-11-23 12:48:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:48:38,194 INFO L93 Difference]: Finished difference Result 255 states and 288 transitions. [2018-11-23 12:48:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:48:38,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-11-23 12:48:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:48:38,198 INFO L225 Difference]: With dead ends: 255 [2018-11-23 12:48:38,198 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:48:38,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:48:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:48:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:48:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:48:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:48:38,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-11-23 12:48:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:48:38,199 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:48:38,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:48:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:48:38,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:48:38,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:48:38,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:38,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 12:48:39,335 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 60 [2018-11-23 12:48:39,574 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 84 [2018-11-23 12:48:40,009 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2018-11-23 12:48:40,161 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 68 [2018-11-23 12:48:40,317 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-11-23 12:48:40,684 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-11-23 12:48:41,040 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2018-11-23 12:48:41,183 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2018-11-23 12:48:41,426 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-11-23 12:48:41,633 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2018-11-23 12:48:41,883 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 66 [2018-11-23 12:48:42,123 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2018-11-23 12:48:42,685 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 75 [2018-11-23 12:48:43,192 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-11-23 12:48:43,462 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2018-11-23 12:48:43,667 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2018-11-23 12:48:43,945 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-11-23 12:48:44,119 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 66 [2018-11-23 12:48:44,329 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 86 [2018-11-23 12:48:44,494 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2018-11-23 12:48:44,799 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 69 [2018-11-23 12:48:45,012 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 69 [2018-11-23 12:48:45,429 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 87 [2018-11-23 12:48:45,717 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-23 12:48:46,112 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-11-23 12:48:46,293 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-11-23 12:48:46,441 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2018-11-23 12:48:46,801 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2018-11-23 12:48:46,997 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2018-11-23 12:48:47,104 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2018-11-23 12:48:47,375 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2018-11-23 12:48:47,696 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 88 [2018-11-23 12:48:47,759 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-11-23 12:48:47,760 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) 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)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~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-23 12:48:47,760 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-11-23 12:48:47,760 INFO L451 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-11-23 12:48:47,760 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-11-23 12:48:47,760 INFO L444 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-23 12:48:47,760 INFO L444 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)|)) (and (and (<= 1 ~NP~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(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 12:48:47,760 INFO L448 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-11-23 12:48:47,760 INFO L448 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L444 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)|)) (and (and (<= 1 ~NP~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(~NP~0)|)) (= |old(~myStatus~0)| 259) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 12:48:47,761 INFO L444 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= 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) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |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-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L444 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-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-11-23 12:48:47,761 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L444 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-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L444 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-23 12:48:47,762 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) 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)|)) (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))) (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-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-11-23 12:48:47,762 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-11-23 12:48:47,763 INFO L444 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-23 12:48:47,763 INFO L448 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-11-23 12:48:47,763 INFO L448 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-11-23 12:48:47,763 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-11-23 12:48:47,763 INFO L444 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |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-23 12:48:47,763 INFO L444 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~MPR1~0 5) (not (= ~myStatus~0 259)) (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= 1 ~s~0) (= ~MPR3~0 6) (= ~NP~0 1) (= ~routine~0 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (= |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-23 12:48:47,763 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-11-23 12:48:47,763 INFO L444 ceAbstractionStarter]: At program point L759(lines 682 771) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse0 (= ~DC~0 ~s~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 (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (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)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 12:48:47,763 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-11-23 12:48:47,763 INFO L448 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-11-23 12:48:47,764 INFO L444 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (= main_~status~6 ~lowerDriverReturn~0)) (.cse6 (<= ~compRegistered~0 0)) (.cse0 (= ~DC~0 ~s~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 (and (<= 1 ~NP~0) (<= ~NP~0 1) .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (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)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 12:48:47,764 INFO L444 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-23 12:48:47,764 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-11-23 12:48:47,764 INFO L448 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-11-23 12:48:47,764 INFO L444 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-23 12:48:47,764 INFO L448 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-11-23 12:48:47,764 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-11-23 12:48:47,764 INFO L444 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-23 12:48:47,765 INFO L444 ceAbstractionStarter]: At program point L803(lines 790 825) the Hoare annotation is: (let ((.cse2 (= ~DC~0 ~s~0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse4 (= ~routine~0 0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse6 (not (= ~pended~0 1)))) (let ((.cse7 (= 0 main_~status~6)) (.cse0 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse4 .cse5 .cse6 (= main_~status~6 ~lowerDriverReturn~0) (<= ~compRegistered~0 0)))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (and (and (<= 1 ~NP~0) .cse0 (<= ~NP~0 1) .cse1 (<= (+ ~NP~0 4) ~MPR1~0)) (not (= 259 main_~status~6))) (= 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 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse2 .cse6) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 (<= ~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)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-23 12:48:47,765 INFO L451 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-11-23 12:48:47,765 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-11-23 12:48:47,765 INFO L448 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-11-23 12:48:47,765 INFO L448 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-11-23 12:48:47,765 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (and (<= 1 ~s~0) (<= ~s~0 1)) (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-23 12:48:47,765 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-11-23 12:48:47,765 INFO L444 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-23 12:48:47,765 INFO L444 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-23 12:48:47,765 INFO L448 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-11-23 12:48:47,765 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L444 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-23 12:48:47,766 INFO L448 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L448 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L444 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-23 12:48:47,766 INFO L444 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-23 12:48:47,766 INFO L444 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-23 12:48:47,766 INFO L444 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-23 12:48:47,766 INFO L448 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L448 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L448 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-11-23 12:48:47,766 INFO L444 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-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L444 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-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L444 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-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-11-23 12:48:47,767 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L444 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-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L444 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-23 12:48:47,768 INFO L444 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-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L444 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse8 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse10 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1) .cse10) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse4 .cse0 .cse9)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse10))) [2018-11-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-11-23 12:48:47,768 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-11-23 12:48:47,769 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-11-23 12:48:47,769 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-11-23 12:48:47,769 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-11-23 12:48:47,769 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-11-23 12:48:47,769 INFO L444 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse8 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse10 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1) .cse10) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse4 .cse0 .cse9)) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse10))) [2018-11-23 12:48:47,769 INFO L448 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-11-23 12:48:47,769 INFO L444 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse23 (+ ~SKIP1~0 2))) (let ((.cse21 (+ ~DC~0 2)) (.cse19 (+ ~NP~0 4)) (.cse6 (= ~myStatus~0 259)) (.cse14 (+ ~DC~0 5)) (.cse15 (= ~s~0 ~NP~0)) (.cse16 (<= .cse23 ~MPR1~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 1 ~s~0)) (.cse20 (= ~routine~0 0)) (.cse22 (not (= ~pended~0 1)))) (let ((.cse11 (and (not .cse6) (<= .cse14 ~IPC~0) .cse15 .cse16 .cse17 .cse18 .cse20 (= |old(~customIrp~0)| ~customIrp~0) .cse22)) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~MPR1~0 .cse19)) (.cse1 (< ~SKIP2~0 .cse21)) (.cse13 (< 1 ~NP~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse23)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~compRegistered~0 1)) (.cse2 (and .cse15 .cse16 .cse17 .cse18 (<= .cse19 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse20 (<= .cse21 ~SKIP2~0) (<= ~s~0 1) .cse22 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) .cse2 (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) .cse8 .cse9) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse10 (or .cse3 .cse0 .cse8)) .cse11 .cse12 (not (= |old(~s~0)| ~MPR3~0)) .cse1 .cse13 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (and (= |old(~customIrp~0)| 1) .cse2 (= 0 ~customIrp~0)) .cse8 (< |old(~s~0)| 1) .cse9))))) [2018-11-23 12:48:47,770 INFO L444 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse23 (+ ~SKIP1~0 2))) (let ((.cse21 (+ ~DC~0 2)) (.cse19 (+ ~NP~0 4)) (.cse6 (= ~myStatus~0 259)) (.cse14 (+ ~DC~0 5)) (.cse15 (= ~s~0 ~NP~0)) (.cse16 (<= .cse23 ~MPR1~0)) (.cse17 (<= 1 ~compRegistered~0)) (.cse18 (<= 1 ~s~0)) (.cse20 (= ~routine~0 0)) (.cse22 (not (= ~pended~0 1)))) (let ((.cse11 (and (not .cse6) (<= .cse14 ~IPC~0) .cse15 .cse16 .cse17 .cse18 .cse20 (= |old(~customIrp~0)| ~customIrp~0) .cse22)) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~MPR1~0 .cse19)) (.cse1 (< ~SKIP2~0 .cse21)) (.cse13 (< 1 ~NP~0)) (.cse3 (not (= 0 ~routine~0))) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse5 (< ~MPR1~0 .cse23)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse10 (< ~compRegistered~0 1)) (.cse2 (and .cse15 .cse16 .cse17 .cse18 (<= .cse19 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse20 (<= .cse21 ~SKIP2~0) (<= ~s~0 1) .cse22 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (< ~IPC~0 .cse14)) (.cse9 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 (not (= 6 ~MPR3~0)) .cse2 (not (= 1 ~NP~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) .cse8 .cse9) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse10 (or .cse3 .cse0 .cse8)) .cse11 .cse12 (not (= |old(~s~0)| ~MPR3~0)) .cse1 .cse13 .cse9) (or .cse11 .cse0 .cse12 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (and (= |old(~customIrp~0)| 1) .cse2 (= 0 ~customIrp~0)) .cse8 (< |old(~s~0)| 1) .cse9))))) [2018-11-23 12:48:47,770 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse5 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse6 (= ~myStatus~0 259)) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse11 (< ~compRegistered~0 1)) (.cse4 (not (= 0 ~routine~0))) (.cse0 (= 1 ~pended~0)) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0)) (.cse9 (<= 1 ~setEventCalled~0)) (.cse10 (<= ~setEventCalled~0 1)) (.cse1 (< ~MPR1~0 (+ ~NP~0 4))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse13 (< 1 |old(~setEventCalled~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse7 (and (<= 1 ~s~0) (<= ~s~0 1) .cse8 .cse9 .cse10) .cse11 .cse12 (< |old(~s~0)| 1) .cse13) (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse11 (or .cse4 .cse0 .cse12)) (and (= ~s~0 ~MPR3~0) .cse8 .cse9 .cse10) .cse1 (not (= |old(~s~0)| ~MPR3~0)) .cse2 .cse3 .cse13))) [2018-11-23 12:48:47,770 INFO L444 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 (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-23 12:48:47,770 INFO L448 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-11-23 12:48:47,770 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-11-23 12:48:47,770 INFO L444 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 (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))) (and (<= 1 ~s~0) (<= ~s~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-11-23 12:48:47,770 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-11-23 12:48:47,770 INFO L451 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: true [2018-11-23 12:48:47,770 INFO L451 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: true [2018-11-23 12:48:47,770 INFO L448 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (not (= ~s~0 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)))) (not (= 0 ~routine~0)) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 ~s~0))) [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 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) (not (= |old(~compRegistered~0)| 0)) (not (= 5 ~MPR1~0)) (< ~IPC~0 (+ ~DC~0 5)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 12:48:47,771 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-11-23 12:48:47,771 INFO L444 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-23 12:48:47,772 INFO L444 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-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L444 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-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L444 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 (or (= ~myStatus~0 259) (or (< ~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 (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (and (<= 1 ~s~0) (<= ~s~0 1) .cse0 .cse1 .cse2) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)))) [2018-11-23 12:48:47,772 INFO L448 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-11-23 12:48:47,772 INFO L444 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-11-23 12:48:47,773 INFO L444 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (not (= DiskPerfRegisterDevice_~irp~0 0)) (not (= DiskPerfRegisterDevice_~output~0 0)) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-11-23 12:48:47,773 INFO L444 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (and (<= 1 ~s~0) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,773 INFO L444 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= ~s~0 1)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1))) (<= 0 DiskPerfRegisterDevice_~status~5)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,773 INFO L448 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L444 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~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 (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L444 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (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 (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (and (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0) (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))) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-11-23 12:48:47,774 INFO L444 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (<= 1 ~s~0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L444 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)) (.cse4 (not (= ~pended~0 1))) (.cse5 (<= 1 ~setEventCalled~0)) (.cse6 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not .cse0) (not (= 5 ~MPR1~0)) (and .cse1 .cse2 .cse3 (<= ~s~0 1) .cse4 .cse5 .cse6) (not (= 6 ~MPR3~0)) (and .cse1 (<= 0 DiskPerfRegisterDevice_~status~5) .cse2 .cse3 .cse4 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse5 .cse6) (not (= 1 |old(~s~0)|))))) [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L444 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= ~compRegistered~0 1)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280) (= ~s~0 1)) (not (= DiskPerfRegisterDevice_~output~0 0)) (not (= ~pended~0 1))) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-11-23 12:48:47,775 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L444 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~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-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (let ((.cse1 (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0)) (.cse2 (= DiskPerfRegisterDevice_~__cil_tmp26~1 5046280)) (.cse3 (let ((.cse9 (= ~NP~0 1)) (.cse10 (= ~MPR1~0 5)) (.cse11 (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344)) (.cse12 (= ~routine~0 0))) (or (and .cse0 .cse9 .cse10 .cse11 .cse12 (= ~s~0 1)) (and .cse0 .cse9 .cse10 (= ~s~0 6) .cse11 .cse12)))) (.cse4 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse5 (not (= DiskPerfRegisterDevice_~output~0 0))) (.cse6 (not (= ~pended~0 1))) (.cse7 (<= 1 ~setEventCalled~0)) (.cse8 (<= ~setEventCalled~0 1))) (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not .cse0) (and .cse1 (and .cse2 (= (mod DiskPerfRegisterDevice_~status~5 259) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (not (= 5 ~MPR1~0)) (and .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= ~s~0 1) .cse6 .cse7 .cse8)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))))) [2018-11-23 12:48:47,776 INFO L444 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (or (= ~myStatus~0 259) (or (< ~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 (= 1 ~NP~0)) (not (= 0 ~routine~0)) (and (= DiskPerfRegisterDevice_~__cil_tmp22~0 2953344) (<= 1 ~s~0) (not (= DiskPerfRegisterDevice_~irp~0 0)) (<= ~s~0 1) (not (= ~pended~0 1))) (not (= ~compRegistered~0 1)) (not (= 5 ~MPR1~0)) (not (= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|))) [2018-11-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-11-23 12:48:47,776 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-11-23 12:48:47,777 INFO L444 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (or (= 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)) [2018-11-23 12:48:47,777 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-11-23 12:48:47,777 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-11-23 12:48:47,777 INFO L444 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse2 (= 1 |old(~pended~0)|)) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (not (= 0 |old(~routine~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (= ~myStatus~0 259)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~DC~0 5)))) (and (let ((.cse0 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (= ~compRegistered~0 1))) (or (and .cse0 (= ~s~0 1) .cse1) .cse2 .cse3 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 5 ~MPR1~0)) (and .cse0 (and .cse1 (= (mod DiskPerfForwardIrpSynchronous_~status~3 259) 0))) .cse9 (not (= |old(~customIrp~0)| 0)))) (let ((.cse10 (<= 1 ~compRegistered~0)) (.cse11 (= ~routine~0 0)) (.cse12 (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 259)) (.cse13 (< 258 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse14 (not (= ~pended~0 1))) (.cse15 (<= 1 ~setEventCalled~0)) (.cse16 (<= ~setEventCalled~0 1))) (or (and .cse10 .cse11 (= ~s~0 ~MPR3~0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse10 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) (<= 1 ~s~0) .cse11 .cse12 (<= ~s~0 1) .cse13 .cse14 .cse15 .cse16) .cse2 (< ~MPR1~0 (+ ~NP~0 4)) .cse3 (< 1 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~s~0)| 1))))) [2018-11-23 12:48:47,777 INFO L448 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-11-23 12:48:47,777 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-11-23 12:48:47,777 INFO L448 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-11-23 12:48:47,777 INFO L444 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)))) (and (or .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1)) (or .cse0 (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0)) .cse1 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-11-23 12:48:47,777 INFO L444 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) 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)))) (and (or (and (= 0 ~compRegistered~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) .cse0 (< ~MPR1~0 (+ ~NP~0 4)) .cse1 (< 1 ~NP~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~s~0)| 1)) (or (= |old(~customIrp~0)| ~customIrp~0) .cse0 .cse1 (not (= 6 ~MPR3~0)) (not (= 1 ~NP~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 5 ~MPR1~0)) .cse7 (not (= |old(~customIrp~0)| 0))))) [2018-11-23 12:48:47,778 INFO L448 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-11-23 12:48:47,778 INFO L448 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-11-23 12:48:47,778 INFO L444 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (or (= 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)) [2018-11-23 12:48:47,778 INFO L444 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (and (<= 1 ~compRegistered~0) (<= 1 ~s~0) (not (= 259 DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 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))) [2018-11-23 12:48:47,778 INFO L448 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-11-23 12:48:47,778 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-23 12:48:47,778 INFO L444 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1)))) (or (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (not (= 259 DiskPerfStartDevice_~status~1)) .cse2 .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (< ~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))) [2018-11-23 12:48:47,778 INFO L444 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 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))) [2018-11-23 12:48:47,779 INFO L444 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (or (= 1 |old(~pended~0)|) (and (= ~compRegistered~0 1) (let ((.cse0 (= |old(~myStatus~0)| ~myStatus~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1)))) (or (and .cse0 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (not (= 259 DiskPerfStartDevice_~status~1)) .cse2 .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))))) (< ~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))) [2018-11-23 12:48:47,779 INFO L444 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 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))) [2018-11-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-11-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-11-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-11-23 12:48:47,779 INFO L444 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-23 12:48:47,779 INFO L444 ceAbstractionStarter]: At program point L403-2(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-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-11-23 12:48:47,779 INFO L444 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-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-11-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-11-23 12:48:47,779 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L444 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-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L444 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-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L444 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-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L444 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-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-11-23 12:48:47,780 INFO L444 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-23 12:48:47,780 INFO L448 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-11-23 12:48:47,781 INFO L448 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-11-23 12:48:47,781 INFO L448 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-11-23 12:48:47,781 INFO L444 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 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)) [2018-11-23 12:48:47,781 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-11-23 12:48:47,781 INFO L448 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-11-23 12:48:47,781 INFO L444 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (<= 1 ~s~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= ~s~0 1)) (.cse4 (not (= ~pended~0 1)))) (or (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< ~SKIP2~0 (+ ~DC~0 2)) (< 1 ~NP~0) (and .cse0 (not (= 259 DiskPerfRemoveDevice_~status~2)) .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2) (= |old(~myStatus~0)| ~myStatus~0) .cse0 .cse1 .cse2 .cse3 .cse4) (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))) [2018-11-23 12:48:47,781 INFO L448 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-11-23 12:48:47,781 INFO L444 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 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)) [2018-11-23 12:48:47,781 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-11-23 12:48:47,783 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-11-23 12:48:47,783 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-11-23 12:48:47,783 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-11-23 12:48:47,783 INFO L451 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-11-23 12:48:47,783 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-11-23 12:48:47,783 INFO L448 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-11-23 12:48:47,783 INFO L444 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse21 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse14 (not (= 0 ~routine~0))) (.cse20 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (= 1 |old(~pended~0)|)) (.cse18 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse19 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse14 .cse20 .cse15 .cse16 (< ~compRegistered~0 1) .cse18 .cse19)) (.cse3 (not (= 5 ~MPR1~0))) (.cse5 (<= (+ .cse21 1) 0)) (.cse6 (<= 1 ~setEventCalled~0)) (.cse7 (= (+ IofCallDriver_~compRetStatus~0 1073741802) 0)) (.cse8 (= ~s~0 1)) (.cse9 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse21) 3221225494))) (.cse10 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse11 (not (= ~pended~0 1))) (.cse12 (<= ~setEventCalled~0 1)) (.cse4 (not (= 6 ~MPR3~0))) (.cse13 (not (= 1 |old(~s~0)|))) (.cse17 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= ~customIrp~0 0)) .cse13) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 (and (not (= IofCallDriver_~Irp 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse4 .cse13) (or .cse14 .cse15 .cse16 .cse17 (not (= ~SKIP1~0 |old(~s~0)|)) .cse18 .cse19) (or .cse14 .cse20 .cse16 .cse17 .cse18 .cse19)))) [2018-11-23 12:48:47,784 INFO L444 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (or .cse15 .cse16 .cse21 .cse17 (< ~compRegistered~0 1) .cse19 .cse20)) (.cse12 (not (= 5 ~MPR1~0))) (.cse1 (<= .cse23 0)) (.cse2 (<= 0 .cse23)) (.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse3 (<= (+ .cse22 1) 0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse13 (not (= 6 ~MPR3~0))) (.cse14 (not (= 1 |old(~s~0)|))) (.cse8 (not (= ~pended~0 1))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0)) .cse14) (or (and (= ~s~0 ~NP~0) .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse10 .cse11 .cse12 (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9) .cse13 .cse14) (or .cse15 .cse21 .cse17 (and (= ~s~0 ~SKIP1~0) .cse8) .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20)))) [2018-11-23 12:48:47,784 INFO L444 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse6 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (= 1 |old(~pended~0)|)) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse6 .cse12 .cse7 .cse8 (< ~compRegistered~0 1) .cse10 .cse11)) (.cse3 (not (= 5 ~MPR1~0))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse9 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0)) .cse5) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse6 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2018-11-23 12:48:47,787 INFO L448 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-11-23 12:48:47,787 INFO L444 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse9 (not (= 0 ~routine~0))) (.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (= 1 |old(~pended~0)|)) (.cse13 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse14 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse12 (not (= ~compRegistered~0 0))) (.cse3 (= ~myStatus~0 259)) (.cse0 (<= 1 ~s~0)) (.cse1 (<= ~s~0 1)) (.cse2 (not (= ~pended~0 1))) (.cse4 (not (= ~compRegistered~0 1))) (.cse5 (or .cse9 .cse15 .cse10 .cse11 (< ~compRegistered~0 1) .cse13 .cse14)) (.cse6 (not (= 5 ~MPR1~0))) (.cse7 (not (= 6 ~MPR3~0))) (.cse8 (not (= 1 |old(~s~0)|)))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~customIrp~0 0)) .cse8) (or .cse9 .cse10 .cse11 .cse12 (not (= ~SKIP1~0 |old(~s~0)|)) .cse13 .cse14) (or .cse9 .cse15 .cse11 .cse12 .cse13 .cse14) (or (= |IofCallDriver_#in~Irp| 0) .cse3 (and (not (= IofCallDriver_~Irp 0)) .cse0 .cse1 .cse2) .cse4 .cse5 .cse6 .cse7 .cse8)))) [2018-11-23 12:48:47,787 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (not (= ~pended~0 1)))) (let ((.cse0 (and (<= 1 ~s~0) (<= ~s~0 1) .cse7)) (.cse1 (= ~myStatus~0 259)) (.cse2 (not (= ~compRegistered~0 1))) (.cse3 (or .cse8 .cse9 .cse14 .cse10 (< ~compRegistered~0 1) .cse12 .cse13)) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= 6 ~MPR3~0))) (.cse6 (not (= 1 |old(~s~0)|))) (.cse11 (not (= ~compRegistered~0 0)))) (and (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (and (= ~s~0 ~NP~0) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0)) .cse6) (or .cse8 .cse14 .cse10 (and (= ~s~0 ~SKIP1~0) .cse7) .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13)))) [2018-11-23 12:48:47,787 INFO L448 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-11-23 12:48:47,787 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-11-23 12:48:47,787 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-11-23 12:48:47,787 INFO L448 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-11-23 12:48:47,788 INFO L444 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (not (= 0 ~routine~0))) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse3 (= 1 |old(~pended~0)|)) (.cse5 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse6 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse10 (or .cse1 .cse2 .cse13 .cse3 (< ~compRegistered~0 1) .cse5 .cse6)) (.cse12 (not (= 6 ~MPR3~0))) (.cse7 (let ((.cse14 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= .cse14 0) (<= 0 .cse14) (<= (+ .cse15 1) 0) (<= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) .cse0 (<= ~setEventCalled~0 1)))) (.cse8 (= ~myStatus~0 259)) (.cse9 (not (= ~compRegistered~0 1))) (.cse11 (not (= 5 ~MPR1~0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~customIrp~0 0)) (not (= 1 |old(~s~0)|))) (or .cse1 .cse13 .cse3 (and (= ~s~0 ~SKIP1~0) .cse0) .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6) (or (= |IofCallDriver_#in~Irp| 0) .cse10 .cse12 (not (= 1 ~NP~0)) .cse7 .cse8 .cse9 .cse11)))) [2018-11-23 12:48:47,792 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L444 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 |old(~pended~0)|)) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< ~IPC~0 (+ ~DC~0 5))) (.cse7 (not (= ~pended~0 1)))) (let ((.cse11 (not (= ~compRegistered~0 0))) (.cse1 (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)) .cse7 (<= ~setEventCalled~0 1)))) (.cse0 (= ~myStatus~0 259)) (.cse2 (not (= ~compRegistered~0 1))) (.cse3 (or .cse8 .cse9 .cse14 .cse10 (< ~compRegistered~0 1) .cse12 .cse13)) (.cse4 (not (= 5 ~MPR1~0))) (.cse5 (not (= 6 ~MPR3~0))) (.cse6 (not (= 1 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~customIrp~0 0)) .cse6) (or (and (= ~s~0 ~NP~0) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse8 .cse14 .cse10 (and (= ~s~0 ~SKIP1~0) .cse7) .cse11 (not (= ~SKIP1~0 |old(~s~0)|)) .cse12 .cse13) (or (= |IofCallDriver_#in~Irp| 0) .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6)))) [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-11-23 12:48:47,793 INFO L448 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-11-23 12:48:47,794 INFO L444 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse6 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (= 1 |old(~pended~0)|)) (.cse10 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse11 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse1 (not (= ~compRegistered~0 1))) (.cse2 (or .cse6 .cse12 .cse7 .cse8 (< ~compRegistered~0 1) .cse10 .cse11)) (.cse3 (not (= 5 ~MPR1~0))) (.cse4 (not (= 6 ~MPR3~0))) (.cse5 (not (= 1 |old(~s~0)|))) (.cse9 (not (= ~compRegistered~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~customIrp~0 0)) .cse5) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 (not (= ~SKIP1~0 |old(~s~0)|)) .cse10 .cse11) (or .cse6 .cse12 .cse8 .cse9 .cse10 .cse11)))) [2018-11-23 12:48:47,800 INFO L448 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-11-23 12:48:47,800 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-11-23 12:48:47,800 INFO L444 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse22 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse23 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse15 (not (= 0 ~routine~0))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse21 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse17 (= 1 |old(~pended~0)|)) (.cse19 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse20 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (= ~myStatus~0 259)) (.cse10 (not (= ~compRegistered~0 1))) (.cse11 (or .cse15 .cse16 .cse21 .cse17 (< ~compRegistered~0 1) .cse19 .cse20)) (.cse12 (not (= 5 ~MPR1~0))) (.cse1 (<= .cse23 0)) (.cse2 (<= 0 .cse23)) (.cse5 (= ~MPR1~0 ~s~0)) (.cse6 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse22) 3221225494))) (.cse7 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse3 (<= (+ .cse22 1) 0)) (.cse4 (<= 1 ~setEventCalled~0)) (.cse9 (<= ~setEventCalled~0 1)) (.cse13 (not (= 6 ~MPR3~0))) (.cse14 (not (= 1 |old(~s~0)|))) (.cse8 (not (= ~pended~0 1))) (.cse18 (not (= ~compRegistered~0 0)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 (not (= ~customIrp~0 0)) .cse14) (or (and (= ~s~0 ~NP~0) .cse8) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) .cse0 .cse10 .cse11 .cse12 (and .cse1 .cse2 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9) .cse13 .cse14) (or .cse15 .cse21 .cse17 (and (= ~s~0 ~SKIP1~0) .cse8) .cse18 (not (= ~SKIP1~0 |old(~s~0)|)) .cse19 .cse20)))) [2018-11-23 12:48:47,800 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L451 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: true [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L451 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L451 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-11-23 12:48:47,801 INFO L448 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-11-23 12:48:47,807 INFO L448 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-11-23 12:48:47,807 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-11-23 12:48:47,807 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-11-23 12:48:47,807 INFO L448 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-11-23 12:48:47,807 INFO L451 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-11-23 12:48:47,807 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L444 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)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= |old(~myStatus~0)| 259) (and (= ~DC~0 ~s~0) (not (= 259 DiskPerfDispatchPnp_~status~0)) (= ~routine~0 0) (<= 1 ~compRegistered~0) (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-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-23 12:48:47,808 INFO L444 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-23 12:48:47,808 INFO L444 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (not (= ~pended~0 1))) (= 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))) [2018-11-23 12:48:47,808 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-11-23 12:48:47,809 INFO L444 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 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))) [2018-11-23 12:48:47,811 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (<= 1 ~s~0) (= ~routine~0 0) (<= ~s~0 1) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= 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))) [2018-11-23 12:48:47,811 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-11-23 12:48:47,811 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-11-23 12:48:47,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:48:47,811 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-23 12:48:47,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:48:47,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:48:47,811 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~myStatus~0 259)) (= ~s~0 ~NP~0) (= 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) (not (= ~pended~0 1))) [2018-11-23 12:48:47,811 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:48:47,811 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:48:47,812 INFO L444 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-23 12:48:47,812 INFO L448 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-11-23 12:48:47,812 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-11-23 12:48:47,812 INFO L448 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-11-23 12:48:47,812 INFO L444 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-23 12:48:47,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:48:47 BoogieIcfgContainer [2018-11-23 12:48:47,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:48:47,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:48:47,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:48:47,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:48:47,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:48:08" (3/4) ... [2018-11-23 12:48:47,854 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 12:48:47,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-11-23 12:48:47,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:48:47,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-11-23 12:48:47,889 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-11-23 12:48:47,890 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-23 12:48:47,891 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 12:48:47,892 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:48:47,932 WARN L221 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))) || (((((1 <= NP && 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(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:48:47,933 WARN L221 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))) || (((((1 <= NP && 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(NP))) || \old(myStatus) == 259) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 12:48:47,934 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((1 <= NP && (((((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)) || 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))) || !(\old(customIrp) == 0) [2018-11-23 12:48:47,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-23 12:48:47,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) [2018-11-23 12:48:47,935 WARN L221 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-23 12:48:47,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((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)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(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-23 12:48:47,935 WARN L221 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-23 12:48:47,936 WARN L221 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-23 12:48:47,936 WARN L221 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) && (((((((((((((((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) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(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)) && (((((((\old(Irp) == 0 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(6 == MPR3)) || !(1 == NP)) || ((((((((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)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) [2018-11-23 12:48:47,936 WARN L221 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) || ((((DC == s && !(259 == status)) && routine == 0) && 1 <= compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) [2018-11-23 12:48:47,936 WARN L221 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)) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && !(259 == status))) || (((((((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))) || !(\old(customIrp) == 0) [2018-11-23 12:48:47,937 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((myStatus == 259 || ((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(1 == NP)) || ((1 <= s && s <= 1) && !(pended == 1))) || !(0 == routine)) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s)) [2018-11-23 12:48:47,938 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((1 == pended || ((((1 <= s && s <= 1) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((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)) [2018-11-23 12:48:47,939 WARN L221 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-23 12:48:47,939 WARN L221 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-23 12:48:47,939 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((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)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(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-23 12:48:47,939 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((myStatus == 259 || ((((((((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)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || ((((((((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)) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s))) [2018-11-23 12:48:47,939 WARN L221 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-23 12:48:47,940 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == \old(pended) || ((((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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-23 12:48:47,940 WARN L221 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-23 12:48:47,941 WARN L221 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-23 12:48:47,941 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) || 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) [2018-11-23 12:48:47,941 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && !(pended == 1)) || 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) [2018-11-23 12:48:47,941 WARN L221 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-23 12:48:47,943 WARN L221 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-23 12:48:47,943 WARN L221 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-23 12:48:48,025 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ee8d7777-44ef-4d0a-9c4b-54b9ed6707c6/bin-2019/utaipan/witness.graphml [2018-11-23 12:48:48,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:48:48,026 INFO L168 Benchmark]: Toolchain (without parser) took 40623.78 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 957.6 MB in the beginning and 1.4 GB in the end (delta: -482.8 MB). Peak memory consumption was 819.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,026 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-23 12:48:48,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.55 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,027 INFO L168 Benchmark]: Boogie Preprocessor took 38.82 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,027 INFO L168 Benchmark]: RCFGBuilder took 741.07 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: 86.6 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,027 INFO L168 Benchmark]: TraceAbstraction took 39271.80 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -414.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,028 INFO L168 Benchmark]: Witness Printer took 174.49 ms. Allocated memory is still 2.3 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:48:48,029 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 372.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 41.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.55 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.82 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 741.07 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: 86.6 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39271.80 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -414.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 174.49 ms. Allocated memory is still 2.3 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 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: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 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))) || (((((1 <= NP && 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(NP))) || \old(myStatus) == 259) || !(\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: ((((((((((((((1 == pended || SKIP2 < DC + 2) || !(6 == MPR3)) || (((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || !(compRegistered == 1)) || !(5 == MPR1)) || IPC < DC + 5) || 1 < \old(setEventCalled)) && ((((((((((MPR1 < SKIP1 + 2 || myStatus == 259) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || ((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1))) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled))) && ((((((((((((((((((((((!(myStatus == 259) && DC + 5 <= IPC) && s == NP) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || ((\old(customIrp) == 1 && ((((((((((s == NP && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((((myStatus == 259 || ((((((((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)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || ((((((((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)) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s))) - 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: (((((((((((((1 == pended || ((((1 <= s && s <= 1) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || myStatus == 259) || \old(setEventCalled) < 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && (((((((((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)) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((1 <= NP && (((((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)) || 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))) || !(\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: (((((((((myStatus == 259 || ((((((((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)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(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) || ((((((((((((MPR1 == 5 && !(myStatus == 259)) && DC + 5 <= IPC) && 0 == compRegistered) && SKIP1 + 2 <= MPR1) && 1 <= s) && MPR3 == 6) && NP == 1) && routine == 0) && DC + 2 <= SKIP2) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1))) || !(\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: 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)) || (((((1 <= NP && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && !(259 == status))) || (((((((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))) || !(\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))) || (((((1 <= NP && 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(NP))) || \old(myStatus) == 259) || !(\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) && (((((((((((((((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) || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(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)) && (((((((\old(Irp) == 0 || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(6 == MPR3)) || !(1 == NP)) || ((((((((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)) || myStatus == 259) || !(compRegistered == 1)) || !(5 == MPR1)) - 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: ((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && !(pended == 1)) || 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) - 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)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(myStatus) == 259) || ((((DC == s && !(259 == status)) && routine == 0) && 1 <= compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(5 == MPR1)) || IPC < DC + 5) || !(\old(customIrp) == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && 1 <= s) && routine == 0) && s <= 1) && \old(customIrp) == customIrp) && !(pended == 1)) || 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) - 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: 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: 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: (((((((((myStatus == 259 || ((((((((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)) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || !(6 == MPR3)) || !(customIrp == 0)) || !(1 == \old(s))) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && (((((((\old(Irp) == 0 || myStatus == 259) || !(compRegistered == 1)) || (((((!(0 == routine) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || !(5 == MPR1)) || ((((((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && MPR1 == s) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(6 == MPR3)) || !(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 || ((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || !(\old(customIrp) == 0)) || !(1 == NP)) || ((1 <= s && s <= 1) && !(pended == 1))) || !(0 == routine)) || !(compRegistered == 1)) || !(5 == MPR1)) || !(6 == MPR3)) || !(1 == \old(s)) - 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, 307 locations, 1 error locations. SAFE Result, 39.1s OverallTime, 44 OverallIterations, 4 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 9.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 12964 SDtfs, 7779 SDslu, 36780 SDs, 0 SdLazy, 12091 SolverSat, 2051 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 900 GetRequests, 532 SyntacticMatches, 13 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9438488180591708 AbsIntWeakeningRatio, 2.1481481481481484 AbsIntAvgWeakeningVarsNumRemoved, 10.839506172839506 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 44 MinimizatonAttempts, 1272 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4386 PreInvPairs, 4627 NumberOfFragments, 9601 HoareAnnotationTreeSize, 4386 FomulaSimplifications, 66727 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 109 FomulaSimplificationsInter, 45437 FormulaSimplificationTreeSizeReductionInter, 8.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3393 NumberOfCodeBlocks, 3393 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3510 ConstructedInterpolants, 0 QuantifiedInterpolants, 519597 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 46 InterpolantComputations, 43 PerfectInterpolantSequences, 830/848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...