./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/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 c60fa6dcffe947607e07f04cc37f17d0aae2288e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:06:57,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:06:57,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:06:57,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:06:57,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:06:57,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:06:57,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:06:57,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:06:57,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:06:57,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:06:57,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:06:57,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:06:57,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:06:57,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:06:57,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:06:57,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:06:57,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:06:57,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:06:57,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:06:57,313 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:06:57,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:06:57,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:06:57,316 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:06:57,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:06:57,316 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:06:57,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:06:57,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:06:57,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:06:57,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:06:57,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:06:57,318 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:06:57,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:06:57,319 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:06:57,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:06:57,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:06:57,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:06:57,320 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:06:57,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:06:57,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:06:57,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:06:57,328 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:06:57,328 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:06:57,328 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:06:57,328 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:06:57,328 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:06:57,328 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:06:57,328 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:06:57,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:06:57,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:06:57,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:06:57,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:06:57,331 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:06:57,331 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:06:57,331 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:06:57,331 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:06:57,331 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:06:57,331 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:06:57,331 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:06:57,331 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_e8978254-035a-4a46-a6a3-1c31c8b19d04/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 -> c60fa6dcffe947607e07f04cc37f17d0aae2288e [2018-12-02 05:06:57,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:06:57,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:06:57,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:06:57,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:06:57,363 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:06:57,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 05:06:57,405 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/data/4c058faa2/2f51597ec3e246ebbb40c2afd0e91a29/FLAGd017eb696 [2018-12-02 05:06:57,739 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:06:57,739 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 05:06:57,748 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/data/4c058faa2/2f51597ec3e246ebbb40c2afd0e91a29/FLAGd017eb696 [2018-12-02 05:06:57,757 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/data/4c058faa2/2f51597ec3e246ebbb40c2afd0e91a29 [2018-12-02 05:06:57,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:06:57,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:06:57,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:06:57,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:06:57,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:06:57,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:06:57" (1/1) ... [2018-12-02 05:06:57,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a96ab85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:57, skipping insertion in model container [2018-12-02 05:06:57,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:06:57" (1/1) ... [2018-12-02 05:06:57,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:06:57,797 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:06:57,989 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:06:57,992 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:06:58,095 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:06:58,108 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:06:58,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58 WrapperNode [2018-12-02 05:06:58,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:06:58,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:06:58,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:06:58,109 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:06:58,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:06:58,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:06:58,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:06:58,130 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:06:58,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... [2018-12-02 05:06:58,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:06:58,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:06:58,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:06:58,172 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:06:58,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/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-12-02 05:06:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-02 05:06:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-02 05:06:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-02 05:06:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-02 05:06:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-02 05:06:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-02 05:06:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-02 05:06:58,207 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-02 05:06:58,207 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-02 05:06:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-02 05:06:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-02 05:06:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-02 05:06:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-02 05:06:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-02 05:06:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-02 05:06:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-02 05:06:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-02 05:06:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-02 05:06:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-02 05:06:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-02 05:06:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-02 05:06:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-02 05:06:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-02 05:06:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-02 05:06:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-02 05:06:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:06:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:06:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-02 05:06:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-02 05:06:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:06:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-02 05:06:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-02 05:06:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-02 05:06:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-02 05:06:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-02 05:06:58,428 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,428 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,491 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,491 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,527 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,527 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,573 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,573 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,607 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,607 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,691 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,691 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,725 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,725 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,737 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,738 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,848 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:06:58,848 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:06:58,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:06:58,864 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 05:06:58,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:06:58 BoogieIcfgContainer [2018-12-02 05:06:58,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:06:58,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:06:58,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:06:58,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:06:58,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:06:57" (1/3) ... [2018-12-02 05:06:58,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5352892d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:06:58, skipping insertion in model container [2018-12-02 05:06:58,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:06:58" (2/3) ... [2018-12-02 05:06:58,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5352892d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:06:58, skipping insertion in model container [2018-12-02 05:06:58,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:06:58" (3/3) ... [2018-12-02 05:06:58,871 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 05:06:58,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:06:58,886 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:06:58,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:06:58,920 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:06:58,920 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:06:58,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:06:58,921 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:06:58,921 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:06:58,921 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:06:58,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:06:58,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:06:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2018-12-02 05:06:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 05:06:58,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:06:58,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:06:58,949 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:06:58,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:06:58,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2018-12-02 05:06:58,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:06:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:06:58,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:58,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:06:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:06:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:06:59,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:06:59,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:06:59,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:06:59,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:06:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:06:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,094 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2018-12-02 05:06:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:06:59,198 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2018-12-02 05:06:59,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:06:59,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 05:06:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:06:59,208 INFO L225 Difference]: With dead ends: 891 [2018-12-02 05:06:59,208 INFO L226 Difference]: Without dead ends: 509 [2018-12-02 05:06:59,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-02 05:06:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-12-02 05:06:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-02 05:06:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2018-12-02 05:06:59,260 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2018-12-02 05:06:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:06:59,260 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2018-12-02 05:06:59,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:06:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2018-12-02 05:06:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:06:59,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:06:59,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:06:59,262 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:06:59,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:06:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2018-12-02 05:06:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:06:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:06:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:06:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:06:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:06:59,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:06:59,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:06:59,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:06:59,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:06:59,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:06:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,333 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2018-12-02 05:06:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:06:59,488 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2018-12-02 05:06:59,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:06:59,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 05:06:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:06:59,493 INFO L225 Difference]: With dead ends: 795 [2018-12-02 05:06:59,493 INFO L226 Difference]: Without dead ends: 674 [2018-12-02 05:06:59,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-12-02 05:06:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2018-12-02 05:06:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-12-02 05:06:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2018-12-02 05:06:59,517 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2018-12-02 05:06:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:06:59,517 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2018-12-02 05:06:59,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:06:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2018-12-02 05:06:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 05:06:59,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:06:59,518 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] [2018-12-02 05:06:59,518 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:06:59,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:06:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash 880506904, now seen corresponding path program 1 times [2018-12-02 05:06:59,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:06:59,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:06:59,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:06:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:06:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:06:59,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:06:59,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:06:59,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:06:59,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:06:59,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:06:59,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,571 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2018-12-02 05:06:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:06:59,609 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2018-12-02 05:06:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:06:59,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 05:06:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:06:59,614 INFO L225 Difference]: With dead ends: 1001 [2018-12-02 05:06:59,615 INFO L226 Difference]: Without dead ends: 823 [2018-12-02 05:06:59,616 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-12-02 05:06:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-02 05:06:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2018-12-02 05:06:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-02 05:06:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2018-12-02 05:06:59,654 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2018-12-02 05:06:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:06:59,654 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2018-12-02 05:06:59,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:06:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2018-12-02 05:06:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 05:06:59,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:06:59,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:06:59,656 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:06:59,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:06:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2133514060, now seen corresponding path program 1 times [2018-12-02 05:06:59,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:06:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:06:59,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:06:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:06:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:06:59,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:06:59,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:06:59,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:06:59,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:06:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:06:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,690 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2018-12-02 05:06:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:06:59,851 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2018-12-02 05:06:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:06:59,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 05:06:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:06:59,855 INFO L225 Difference]: With dead ends: 1430 [2018-12-02 05:06:59,856 INFO L226 Difference]: Without dead ends: 1164 [2018-12-02 05:06:59,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:06:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-12-02 05:06:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2018-12-02 05:06:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 05:06:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-12-02 05:06:59,889 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2018-12-02 05:06:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:06:59,890 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-12-02 05:06:59,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:06:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-12-02 05:06:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 05:06:59,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:06:59,892 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] [2018-12-02 05:06:59,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:06:59,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:06:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1952820015, now seen corresponding path program 1 times [2018-12-02 05:06:59,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:06:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:06:59,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:06:59,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:06:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:06:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:06:59,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:06:59,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:06:59,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:06:59,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:06:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:06:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:06:59,955 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-12-02 05:07:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:00,467 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2018-12-02 05:07:00,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:07:00,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-02 05:07:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:00,470 INFO L225 Difference]: With dead ends: 1570 [2018-12-02 05:07:00,470 INFO L226 Difference]: Without dead ends: 990 [2018-12-02 05:07:00,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:07:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-12-02 05:07:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2018-12-02 05:07:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-02 05:07:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2018-12-02 05:07:00,501 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2018-12-02 05:07:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:00,501 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2018-12-02 05:07:00,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2018-12-02 05:07:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 05:07:00,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:00,502 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-12-02 05:07:00,502 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:00,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash -950761943, now seen corresponding path program 1 times [2018-12-02 05:07:00,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:00,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:00,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:00,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:00,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:00,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:00,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,535 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2018-12-02 05:07:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:00,607 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2018-12-02 05:07:00,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:00,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 05:07:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:00,610 INFO L225 Difference]: With dead ends: 892 [2018-12-02 05:07:00,610 INFO L226 Difference]: Without dead ends: 888 [2018-12-02 05:07:00,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-02 05:07:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-02 05:07:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 05:07:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2018-12-02 05:07:00,634 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2018-12-02 05:07:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:00,634 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2018-12-02 05:07:00,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2018-12-02 05:07:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 05:07:00,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:00,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:00,636 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:00,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:00,636 INFO L82 PathProgramCache]: Analyzing trace with hash -826026373, now seen corresponding path program 1 times [2018-12-02 05:07:00,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:00,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:00,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:00,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:00,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,660 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2018-12-02 05:07:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:00,698 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2018-12-02 05:07:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:00,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-02 05:07:00,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:00,703 INFO L225 Difference]: With dead ends: 1280 [2018-12-02 05:07:00,703 INFO L226 Difference]: Without dead ends: 1019 [2018-12-02 05:07:00,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-02 05:07:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2018-12-02 05:07:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-12-02 05:07:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2018-12-02 05:07:00,744 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2018-12-02 05:07:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:00,744 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2018-12-02 05:07:00,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2018-12-02 05:07:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 05:07:00,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:00,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:00,746 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:00,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2018-12-02 05:07:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:00,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:00,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:00,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:00,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:00,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,782 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2018-12-02 05:07:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:00,834 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2018-12-02 05:07:00,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:00,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-02 05:07:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:00,836 INFO L225 Difference]: With dead ends: 976 [2018-12-02 05:07:00,836 INFO L226 Difference]: Without dead ends: 956 [2018-12-02 05:07:00,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-12-02 05:07:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2018-12-02 05:07:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-02 05:07:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2018-12-02 05:07:00,865 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2018-12-02 05:07:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:00,865 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2018-12-02 05:07:00,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2018-12-02 05:07:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:07:00,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:00,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:00,868 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:00,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash 215600759, now seen corresponding path program 1 times [2018-12-02 05:07:00,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:00,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:00,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:00,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:00,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:00,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,896 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2018-12-02 05:07:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:00,945 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2018-12-02 05:07:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:00,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 05:07:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:00,948 INFO L225 Difference]: With dead ends: 1175 [2018-12-02 05:07:00,948 INFO L226 Difference]: Without dead ends: 933 [2018-12-02 05:07:00,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-02 05:07:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-12-02 05:07:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-02 05:07:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2018-12-02 05:07:00,985 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2018-12-02 05:07:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:00,986 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2018-12-02 05:07:00,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2018-12-02 05:07:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:07:00,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:00,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:00,989 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:00,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -564668473, now seen corresponding path program 1 times [2018-12-02 05:07:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:00,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:01,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:07:01,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:01,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:07:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:07:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:07:01,040 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2018-12-02 05:07:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:01,334 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2018-12-02 05:07:01,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:07:01,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 05:07:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:01,336 INFO L225 Difference]: With dead ends: 1022 [2018-12-02 05:07:01,336 INFO L226 Difference]: Without dead ends: 793 [2018-12-02 05:07:01,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:07:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-02 05:07:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2018-12-02 05:07:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-02 05:07:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2018-12-02 05:07:01,359 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2018-12-02 05:07:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:01,359 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2018-12-02 05:07:01,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:07:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2018-12-02 05:07:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:07:01,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:01,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:01,361 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:01,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:01,361 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2018-12-02 05:07:01,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:01,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:01,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:01,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:01,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:01,381 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2018-12-02 05:07:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:01,415 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2018-12-02 05:07:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:01,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-02 05:07:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:01,418 INFO L225 Difference]: With dead ends: 879 [2018-12-02 05:07:01,418 INFO L226 Difference]: Without dead ends: 783 [2018-12-02 05:07:01,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-02 05:07:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2018-12-02 05:07:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-12-02 05:07:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2018-12-02 05:07:01,453 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2018-12-02 05:07:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:01,453 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2018-12-02 05:07:01,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2018-12-02 05:07:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 05:07:01,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:01,454 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-12-02 05:07:01,454 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:01,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2018-12-02 05:07:01,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:01,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:01,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:01,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:01,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:01,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:01,475 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2018-12-02 05:07:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:01,561 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2018-12-02 05:07:01,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:01,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 05:07:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:01,565 INFO L225 Difference]: With dead ends: 957 [2018-12-02 05:07:01,566 INFO L226 Difference]: Without dead ends: 943 [2018-12-02 05:07:01,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-02 05:07:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2018-12-02 05:07:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-02 05:07:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2018-12-02 05:07:01,610 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2018-12-02 05:07:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:01,610 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2018-12-02 05:07:01,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2018-12-02 05:07:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:07:01,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:01,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:01,613 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:01,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2018-12-02 05:07:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:01,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:01,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:01,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:07:01,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:01,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:07:01,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:07:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:01,679 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2018-12-02 05:07:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:01,809 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2018-12-02 05:07:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:07:01,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 05:07:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:01,812 INFO L225 Difference]: With dead ends: 863 [2018-12-02 05:07:01,812 INFO L226 Difference]: Without dead ends: 859 [2018-12-02 05:07:01,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:07:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-12-02 05:07:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2018-12-02 05:07:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-02 05:07:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2018-12-02 05:07:01,842 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2018-12-02 05:07:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:01,842 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2018-12-02 05:07:01,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:07:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2018-12-02 05:07:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:07:01,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:01,844 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-12-02 05:07:01,844 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:01,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2018-12-02 05:07:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:01,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:01,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:01,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:07:01,887 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:01,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:07:01,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:07:01,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:01,887 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2018-12-02 05:07:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:01,962 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2018-12-02 05:07:01,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:07:01,962 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 05:07:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:01,966 INFO L225 Difference]: With dead ends: 898 [2018-12-02 05:07:01,966 INFO L226 Difference]: Without dead ends: 877 [2018-12-02 05:07:01,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:07:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-12-02 05:07:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2018-12-02 05:07:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-02 05:07:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2018-12-02 05:07:02,014 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2018-12-02 05:07:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:02,014 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2018-12-02 05:07:02,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:07:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2018-12-02 05:07:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:07:02,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:02,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:02,016 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:02,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:02,017 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2018-12-02 05:07:02,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:02,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:02,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:02,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:02,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:07:02,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:02,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:07:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:07:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:07:02,050 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2018-12-02 05:07:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:02,092 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2018-12-02 05:07:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:07:02,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 05:07:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:02,095 INFO L225 Difference]: With dead ends: 901 [2018-12-02 05:07:02,096 INFO L226 Difference]: Without dead ends: 879 [2018-12-02 05:07:02,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-02 05:07:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2018-12-02 05:07:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-02 05:07:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2018-12-02 05:07:02,138 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2018-12-02 05:07:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:02,138 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2018-12-02 05:07:02,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:07:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2018-12-02 05:07:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:07:02,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:02,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:02,140 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:02,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2018-12-02 05:07:02,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:02,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:02,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:02,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:02,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:02,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:07:02,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:02,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:07:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:07:02,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:07:02,178 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2018-12-02 05:07:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:02,829 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2018-12-02 05:07:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:07:02,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-02 05:07:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:02,832 INFO L225 Difference]: With dead ends: 1088 [2018-12-02 05:07:02,832 INFO L226 Difference]: Without dead ends: 997 [2018-12-02 05:07:02,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-12-02 05:07:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2018-12-02 05:07:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-02 05:07:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2018-12-02 05:07:02,862 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2018-12-02 05:07:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:02,862 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2018-12-02 05:07:02,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:07:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2018-12-02 05:07:02,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:07:02,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:02,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:02,863 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:02,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:02,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2018-12-02 05:07:02,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:02,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:02,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:02,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:02,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:02,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:02,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:02,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:02,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:02,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:02,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:02,884 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2018-12-02 05:07:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:02,980 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2018-12-02 05:07:02,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:02,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 05:07:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:02,984 INFO L225 Difference]: With dead ends: 1038 [2018-12-02 05:07:02,984 INFO L226 Difference]: Without dead ends: 998 [2018-12-02 05:07:02,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-12-02 05:07:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2018-12-02 05:07:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-02 05:07:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2018-12-02 05:07:03,028 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2018-12-02 05:07:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:03,029 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2018-12-02 05:07:03,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2018-12-02 05:07:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:07:03,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:03,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:03,030 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:03,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2018-12-02 05:07:03,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:03,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:03,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:03,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:03,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:03,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:07:03,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:03,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:07:03,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:07:03,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:07:03,088 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 9 states. [2018-12-02 05:07:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:04,034 INFO L93 Difference]: Finished difference Result 1211 states and 1672 transitions. [2018-12-02 05:07:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:07:04,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-02 05:07:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:04,037 INFO L225 Difference]: With dead ends: 1211 [2018-12-02 05:07:04,037 INFO L226 Difference]: Without dead ends: 1142 [2018-12-02 05:07:04,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:07:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-12-02 05:07:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 902. [2018-12-02 05:07:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-12-02 05:07:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1225 transitions. [2018-12-02 05:07:04,091 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1225 transitions. Word has length 50 [2018-12-02 05:07:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:04,091 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1225 transitions. [2018-12-02 05:07:04,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:07:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1225 transitions. [2018-12-02 05:07:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:07:04,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:04,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:04,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:04,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2018-12-02 05:07:04,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:04,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:04,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:04,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:04,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:04,118 INFO L87 Difference]: Start difference. First operand 902 states and 1225 transitions. Second operand 3 states. [2018-12-02 05:07:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:04,191 INFO L93 Difference]: Finished difference Result 930 states and 1257 transitions. [2018-12-02 05:07:04,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:04,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 05:07:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:04,193 INFO L225 Difference]: With dead ends: 930 [2018-12-02 05:07:04,193 INFO L226 Difference]: Without dead ends: 925 [2018-12-02 05:07:04,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-02 05:07:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 919. [2018-12-02 05:07:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-02 05:07:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1246 transitions. [2018-12-02 05:07:04,241 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1246 transitions. Word has length 52 [2018-12-02 05:07:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:04,242 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1246 transitions. [2018-12-02 05:07:04,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1246 transitions. [2018-12-02 05:07:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:07:04,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:04,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:04,243 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:04,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2018-12-02 05:07:04,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:04,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:04,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:04,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:04,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:04,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:04,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:04,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:04,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:04,266 INFO L87 Difference]: Start difference. First operand 919 states and 1246 transitions. Second operand 3 states. [2018-12-02 05:07:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:04,338 INFO L93 Difference]: Finished difference Result 1135 states and 1537 transitions. [2018-12-02 05:07:04,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:04,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-02 05:07:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:04,340 INFO L225 Difference]: With dead ends: 1135 [2018-12-02 05:07:04,340 INFO L226 Difference]: Without dead ends: 888 [2018-12-02 05:07:04,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-02 05:07:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-02 05:07:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 05:07:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1206 transitions. [2018-12-02 05:07:04,372 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1206 transitions. Word has length 54 [2018-12-02 05:07:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:04,373 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1206 transitions. [2018-12-02 05:07:04,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1206 transitions. [2018-12-02 05:07:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:07:04,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:04,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:04,375 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2018-12-02 05:07:04,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:04,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:04,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:04,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:04,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:04,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:04,409 INFO L87 Difference]: Start difference. First operand 888 states and 1206 transitions. Second operand 5 states. [2018-12-02 05:07:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:04,701 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-12-02 05:07:04,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:04,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 05:07:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:04,704 INFO L225 Difference]: With dead ends: 900 [2018-12-02 05:07:04,704 INFO L226 Difference]: Without dead ends: 894 [2018-12-02 05:07:04,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-02 05:07:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2018-12-02 05:07:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 05:07:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1205 transitions. [2018-12-02 05:07:04,736 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1205 transitions. Word has length 53 [2018-12-02 05:07:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:04,736 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1205 transitions. [2018-12-02 05:07:04,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1205 transitions. [2018-12-02 05:07:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:07:04,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:04,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:04,738 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:04,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:04,738 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2018-12-02 05:07:04,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:04,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:04,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:04,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:04,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:04,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:04,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:04,775 INFO L87 Difference]: Start difference. First operand 888 states and 1205 transitions. Second operand 5 states. [2018-12-02 05:07:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:05,075 INFO L93 Difference]: Finished difference Result 903 states and 1220 transitions. [2018-12-02 05:07:05,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:05,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-02 05:07:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:05,078 INFO L225 Difference]: With dead ends: 903 [2018-12-02 05:07:05,078 INFO L226 Difference]: Without dead ends: 867 [2018-12-02 05:07:05,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:05,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-02 05:07:05,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 861. [2018-12-02 05:07:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-02 05:07:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1175 transitions. [2018-12-02 05:07:05,116 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1175 transitions. Word has length 52 [2018-12-02 05:07:05,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:05,117 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1175 transitions. [2018-12-02 05:07:05,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1175 transitions. [2018-12-02 05:07:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:07:05,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:05,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:05,118 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:05,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2018-12-02 05:07:05,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:05,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:05,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:05,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:05,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:05,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:05,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:05,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:05,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:05,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:05,153 INFO L87 Difference]: Start difference. First operand 861 states and 1175 transitions. Second operand 5 states. [2018-12-02 05:07:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:05,493 INFO L93 Difference]: Finished difference Result 871 states and 1183 transitions. [2018-12-02 05:07:05,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:05,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 05:07:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:05,495 INFO L225 Difference]: With dead ends: 871 [2018-12-02 05:07:05,495 INFO L226 Difference]: Without dead ends: 865 [2018-12-02 05:07:05,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-02 05:07:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2018-12-02 05:07:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-02 05:07:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2018-12-02 05:07:05,551 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 54 [2018-12-02 05:07:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:05,551 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2018-12-02 05:07:05,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2018-12-02 05:07:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:07:05,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:05,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:05,553 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:05,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:05,553 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2018-12-02 05:07:05,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:05,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:05,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:05,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:05,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:05,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:07:05,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:05,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:07:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:07:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:07:05,598 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2018-12-02 05:07:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:05,755 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2018-12-02 05:07:05,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:07:05,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-02 05:07:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:05,757 INFO L225 Difference]: With dead ends: 888 [2018-12-02 05:07:05,758 INFO L226 Difference]: Without dead ends: 852 [2018-12-02 05:07:05,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-12-02 05:07:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2018-12-02 05:07:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-12-02 05:07:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2018-12-02 05:07:05,790 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2018-12-02 05:07:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:05,790 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2018-12-02 05:07:05,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:07:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2018-12-02 05:07:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 05:07:05,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:05,792 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-12-02 05:07:05,792 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:05,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1728183236, now seen corresponding path program 1 times [2018-12-02 05:07:05,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:05,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:05,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:07:05,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:05,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:07:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:07:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:05,871 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2018-12-02 05:07:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:06,056 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2018-12-02 05:07:06,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:07:06,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-02 05:07:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:06,058 INFO L225 Difference]: With dead ends: 868 [2018-12-02 05:07:06,058 INFO L226 Difference]: Without dead ends: 850 [2018-12-02 05:07:06,058 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-12-02 05:07:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-02 05:07:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-12-02 05:07:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-12-02 05:07:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2018-12-02 05:07:06,089 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 56 [2018-12-02 05:07:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:06,090 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2018-12-02 05:07:06,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:07:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2018-12-02 05:07:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:07:06,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:06,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:06,092 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:06,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:06,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1135140490, now seen corresponding path program 1 times [2018-12-02 05:07:06,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:06,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:06,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:07:06,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:06,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:07:06,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:07:06,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:06,170 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2018-12-02 05:07:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:06,323 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2018-12-02 05:07:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:07:06,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-02 05:07:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:06,326 INFO L225 Difference]: With dead ends: 863 [2018-12-02 05:07:06,326 INFO L226 Difference]: Without dead ends: 845 [2018-12-02 05:07:06,327 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-12-02 05:07:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-02 05:07:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-12-02 05:07:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-02 05:07:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2018-12-02 05:07:06,367 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 55 [2018-12-02 05:07:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:06,367 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2018-12-02 05:07:06,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:07:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2018-12-02 05:07:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:07:06,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:06,369 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:06,369 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:06,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash 49569733, now seen corresponding path program 1 times [2018-12-02 05:07:06,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:06,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:06,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:06,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:06,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:06,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:06,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:06,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:06,394 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 3 states. [2018-12-02 05:07:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:06,441 INFO L93 Difference]: Finished difference Result 1098 states and 1473 transitions. [2018-12-02 05:07:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:06,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-02 05:07:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:06,443 INFO L225 Difference]: With dead ends: 1098 [2018-12-02 05:07:06,443 INFO L226 Difference]: Without dead ends: 935 [2018-12-02 05:07:06,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-02 05:07:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 904. [2018-12-02 05:07:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-02 05:07:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1215 transitions. [2018-12-02 05:07:06,477 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1215 transitions. Word has length 74 [2018-12-02 05:07:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:06,477 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1215 transitions. [2018-12-02 05:07:06,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1215 transitions. [2018-12-02 05:07:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:07:06,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:06,478 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] [2018-12-02 05:07:06,478 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:06,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 2094530933, now seen corresponding path program 1 times [2018-12-02 05:07:06,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:06,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:06,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:06,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:07:06,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:06,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:06,564 INFO L87 Difference]: Start difference. First operand 904 states and 1215 transitions. Second operand 12 states. [2018-12-02 05:07:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:06,754 INFO L93 Difference]: Finished difference Result 930 states and 1243 transitions. [2018-12-02 05:07:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:07:06,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-02 05:07:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:06,756 INFO L225 Difference]: With dead ends: 930 [2018-12-02 05:07:06,756 INFO L226 Difference]: Without dead ends: 905 [2018-12-02 05:07:06,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-12-02 05:07:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2018-12-02 05:07:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-12-02 05:07:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1204 transitions. [2018-12-02 05:07:06,789 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1204 transitions. Word has length 59 [2018-12-02 05:07:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:06,789 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1204 transitions. [2018-12-02 05:07:06,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1204 transitions. [2018-12-02 05:07:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:07:06,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:06,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:06,790 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:06,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2018-12-02 05:07:06,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:06,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:06,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:06,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:07:06,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:06,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:07:06,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:07:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:06,875 INFO L87 Difference]: Start difference. First operand 903 states and 1204 transitions. Second operand 11 states. [2018-12-02 05:07:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:07,057 INFO L93 Difference]: Finished difference Result 920 states and 1222 transitions. [2018-12-02 05:07:07,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:07:07,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-02 05:07:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:07,060 INFO L225 Difference]: With dead ends: 920 [2018-12-02 05:07:07,060 INFO L226 Difference]: Without dead ends: 900 [2018-12-02 05:07:07,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-12-02 05:07:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2018-12-02 05:07:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-02 05:07:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1199 transitions. [2018-12-02 05:07:07,093 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1199 transitions. Word has length 58 [2018-12-02 05:07:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:07,093 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1199 transitions. [2018-12-02 05:07:07,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:07:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1199 transitions. [2018-12-02 05:07:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:07:07,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:07,095 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] [2018-12-02 05:07:07,095 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:07,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2018-12-02 05:07:07,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:07,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:07,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:07,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:07:07,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:07,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:07:07,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:07:07,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:07,147 INFO L87 Difference]: Start difference. First operand 900 states and 1199 transitions. Second operand 10 states. [2018-12-02 05:07:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:07,348 INFO L93 Difference]: Finished difference Result 967 states and 1274 transitions. [2018-12-02 05:07:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:07:07,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-12-02 05:07:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:07,351 INFO L225 Difference]: With dead ends: 967 [2018-12-02 05:07:07,351 INFO L226 Difference]: Without dead ends: 858 [2018-12-02 05:07:07,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-12-02 05:07:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 855. [2018-12-02 05:07:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-12-02 05:07:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1118 transitions. [2018-12-02 05:07:07,384 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1118 transitions. Word has length 59 [2018-12-02 05:07:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:07,384 INFO L480 AbstractCegarLoop]: Abstraction has 855 states and 1118 transitions. [2018-12-02 05:07:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:07:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1118 transitions. [2018-12-02 05:07:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:07:07,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:07,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:07,386 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:07,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2018-12-02 05:07:07,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:07,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:07,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:07,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:07,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:07:07,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:07,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:07:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:07:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:07:07,406 INFO L87 Difference]: Start difference. First operand 855 states and 1118 transitions. Second operand 4 states. [2018-12-02 05:07:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:07,510 INFO L93 Difference]: Finished difference Result 1012 states and 1336 transitions. [2018-12-02 05:07:07,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:07:07,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 05:07:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:07,513 INFO L225 Difference]: With dead ends: 1012 [2018-12-02 05:07:07,513 INFO L226 Difference]: Without dead ends: 904 [2018-12-02 05:07:07,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-12-02 05:07:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 862. [2018-12-02 05:07:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-12-02 05:07:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1133 transitions. [2018-12-02 05:07:07,559 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1133 transitions. Word has length 60 [2018-12-02 05:07:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:07,559 INFO L480 AbstractCegarLoop]: Abstraction has 862 states and 1133 transitions. [2018-12-02 05:07:07,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:07:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1133 transitions. [2018-12-02 05:07:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 05:07:07,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:07,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:07,560 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:07,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2018-12-02 05:07:07,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:07,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:07,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:07,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:07,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:07:07,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:07,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:07:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:07:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:07,610 INFO L87 Difference]: Start difference. First operand 862 states and 1133 transitions. Second operand 11 states. [2018-12-02 05:07:07,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:07,727 INFO L93 Difference]: Finished difference Result 931 states and 1224 transitions. [2018-12-02 05:07:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:07:07,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-02 05:07:07,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:07,730 INFO L225 Difference]: With dead ends: 931 [2018-12-02 05:07:07,730 INFO L226 Difference]: Without dead ends: 876 [2018-12-02 05:07:07,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-12-02 05:07:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 866. [2018-12-02 05:07:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-12-02 05:07:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1150 transitions. [2018-12-02 05:07:07,763 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1150 transitions. Word has length 60 [2018-12-02 05:07:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:07,763 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1150 transitions. [2018-12-02 05:07:07,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:07:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1150 transitions. [2018-12-02 05:07:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:07:07,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:07,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:07,764 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:07,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash -340760307, now seen corresponding path program 1 times [2018-12-02 05:07:07,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:07,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:07,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:07,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:07,819 INFO L87 Difference]: Start difference. First operand 866 states and 1150 transitions. Second operand 5 states. [2018-12-02 05:07:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:07,933 INFO L93 Difference]: Finished difference Result 901 states and 1192 transitions. [2018-12-02 05:07:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:07,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 05:07:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:07,936 INFO L225 Difference]: With dead ends: 901 [2018-12-02 05:07:07,936 INFO L226 Difference]: Without dead ends: 873 [2018-12-02 05:07:07,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-12-02 05:07:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 871. [2018-12-02 05:07:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-12-02 05:07:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1159 transitions. [2018-12-02 05:07:07,977 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1159 transitions. Word has length 67 [2018-12-02 05:07:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:07,977 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1159 transitions. [2018-12-02 05:07:07,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1159 transitions. [2018-12-02 05:07:07,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 05:07:07,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:07,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:07,978 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:07,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1988119945, now seen corresponding path program 1 times [2018-12-02 05:07:07,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:07,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:07,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:07,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:08,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:07:08,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:08,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:08,043 INFO L87 Difference]: Start difference. First operand 871 states and 1159 transitions. Second operand 12 states. [2018-12-02 05:07:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:08,238 INFO L93 Difference]: Finished difference Result 893 states and 1182 transitions. [2018-12-02 05:07:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:07:08,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-02 05:07:08,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:08,240 INFO L225 Difference]: With dead ends: 893 [2018-12-02 05:07:08,240 INFO L226 Difference]: Without dead ends: 869 [2018-12-02 05:07:08,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-12-02 05:07:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2018-12-02 05:07:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-12-02 05:07:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1154 transitions. [2018-12-02 05:07:08,281 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1154 transitions. Word has length 63 [2018-12-02 05:07:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:08,282 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1154 transitions. [2018-12-02 05:07:08,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1154 transitions. [2018-12-02 05:07:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:07:08,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:08,283 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] [2018-12-02 05:07:08,283 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:08,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash 398574068, now seen corresponding path program 1 times [2018-12-02 05:07:08,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:08,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:08,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:07:08,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:08,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:08,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:08,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:08,348 INFO L87 Difference]: Start difference. First operand 869 states and 1154 transitions. Second operand 12 states. [2018-12-02 05:07:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:08,551 INFO L93 Difference]: Finished difference Result 893 states and 1179 transitions. [2018-12-02 05:07:08,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:07:08,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-02 05:07:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:08,553 INFO L225 Difference]: With dead ends: 893 [2018-12-02 05:07:08,554 INFO L226 Difference]: Without dead ends: 869 [2018-12-02 05:07:08,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-12-02 05:07:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 867. [2018-12-02 05:07:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-12-02 05:07:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1150 transitions. [2018-12-02 05:07:08,595 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1150 transitions. Word has length 66 [2018-12-02 05:07:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1150 transitions. [2018-12-02 05:07:08,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1150 transitions. [2018-12-02 05:07:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 05:07:08,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:08,596 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-12-02 05:07:08,597 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:08,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1861861007, now seen corresponding path program 1 times [2018-12-02 05:07:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:07:08,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:08,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:08,670 INFO L87 Difference]: Start difference. First operand 867 states and 1150 transitions. Second operand 12 states. [2018-12-02 05:07:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:08,850 INFO L93 Difference]: Finished difference Result 891 states and 1175 transitions. [2018-12-02 05:07:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:07:08,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-02 05:07:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:08,853 INFO L225 Difference]: With dead ends: 891 [2018-12-02 05:07:08,853 INFO L226 Difference]: Without dead ends: 867 [2018-12-02 05:07:08,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-02 05:07:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-12-02 05:07:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-12-02 05:07:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1146 transitions. [2018-12-02 05:07:08,898 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1146 transitions. Word has length 62 [2018-12-02 05:07:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:08,898 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1146 transitions. [2018-12-02 05:07:08,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1146 transitions. [2018-12-02 05:07:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 05:07:08,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:08,899 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-12-02 05:07:08,899 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:08,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2111220271, now seen corresponding path program 1 times [2018-12-02 05:07:08,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:08,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:08,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:08,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-12-02 05:07:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:08,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:08,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:08,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:08,918 INFO L87 Difference]: Start difference. First operand 865 states and 1146 transitions. Second operand 3 states. [2018-12-02 05:07:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:08,944 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2018-12-02 05:07:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:08,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-02 05:07:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:08,946 INFO L225 Difference]: With dead ends: 1137 [2018-12-02 05:07:08,946 INFO L226 Difference]: Without dead ends: 793 [2018-12-02 05:07:08,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-02 05:07:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 762. [2018-12-02 05:07:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-12-02 05:07:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 977 transitions. [2018-12-02 05:07:08,975 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 977 transitions. Word has length 62 [2018-12-02 05:07:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:08,975 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 977 transitions. [2018-12-02 05:07:08,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 977 transitions. [2018-12-02 05:07:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 05:07:08,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:08,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:08,976 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:08,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1839036840, now seen corresponding path program 1 times [2018-12-02 05:07:08,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:08,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:08,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:09,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:09,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:07:09,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:09,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:07:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:07:09,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:09,072 INFO L87 Difference]: Start difference. First operand 762 states and 977 transitions. Second operand 13 states. [2018-12-02 05:07:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:09,236 INFO L93 Difference]: Finished difference Result 779 states and 995 transitions. [2018-12-02 05:07:09,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:09,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-02 05:07:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:09,238 INFO L225 Difference]: With dead ends: 779 [2018-12-02 05:07:09,238 INFO L226 Difference]: Without dead ends: 757 [2018-12-02 05:07:09,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:07:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-12-02 05:07:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2018-12-02 05:07:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-12-02 05:07:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 970 transitions. [2018-12-02 05:07:09,264 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 970 transitions. Word has length 63 [2018-12-02 05:07:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:09,264 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 970 transitions. [2018-12-02 05:07:09,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:07:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 970 transitions. [2018-12-02 05:07:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:07:09,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:09,265 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-12-02 05:07:09,265 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:09,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1496662402, now seen corresponding path program 1 times [2018-12-02 05:07:09,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:09,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:09,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:07:09,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:09,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:07:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:07:09,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:09,364 INFO L87 Difference]: Start difference. First operand 757 states and 970 transitions. Second operand 13 states. [2018-12-02 05:07:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:09,529 INFO L93 Difference]: Finished difference Result 774 states and 988 transitions. [2018-12-02 05:07:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:09,530 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-02 05:07:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:09,531 INFO L225 Difference]: With dead ends: 774 [2018-12-02 05:07:09,531 INFO L226 Difference]: Without dead ends: 746 [2018-12-02 05:07:09,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:07:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-02 05:07:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2018-12-02 05:07:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-12-02 05:07:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 955 transitions. [2018-12-02 05:07:09,558 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 955 transitions. Word has length 69 [2018-12-02 05:07:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:09,558 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 955 transitions. [2018-12-02 05:07:09,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:07:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 955 transitions. [2018-12-02 05:07:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 05:07:09,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:09,559 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-12-02 05:07:09,559 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:09,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 81838798, now seen corresponding path program 1 times [2018-12-02 05:07:09,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:09,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:09,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:07:09,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:09,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:07:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:07:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:09,661 INFO L87 Difference]: Start difference. First operand 746 states and 955 transitions. Second operand 13 states. [2018-12-02 05:07:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:09,815 INFO L93 Difference]: Finished difference Result 763 states and 973 transitions. [2018-12-02 05:07:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:09,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-02 05:07:09,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:09,816 INFO L225 Difference]: With dead ends: 763 [2018-12-02 05:07:09,817 INFO L226 Difference]: Without dead ends: 738 [2018-12-02 05:07:09,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:07:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-02 05:07:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-12-02 05:07:09,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-12-02 05:07:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 945 transitions. [2018-12-02 05:07:09,843 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 945 transitions. Word has length 62 [2018-12-02 05:07:09,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:09,843 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 945 transitions. [2018-12-02 05:07:09,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:07:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 945 transitions. [2018-12-02 05:07:09,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 05:07:09,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:09,844 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] [2018-12-02 05:07:09,844 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:09,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:09,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2087229698, now seen corresponding path program 1 times [2018-12-02 05:07:09,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:09,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:09,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:09,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:09,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:09,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:09,861 INFO L87 Difference]: Start difference. First operand 738 states and 945 transitions. Second operand 3 states. [2018-12-02 05:07:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:09,900 INFO L93 Difference]: Finished difference Result 868 states and 1118 transitions. [2018-12-02 05:07:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:09,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 05:07:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:09,902 INFO L225 Difference]: With dead ends: 868 [2018-12-02 05:07:09,902 INFO L226 Difference]: Without dead ends: 738 [2018-12-02 05:07:09,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-02 05:07:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-12-02 05:07:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-12-02 05:07:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 943 transitions. [2018-12-02 05:07:09,947 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 943 transitions. Word has length 66 [2018-12-02 05:07:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:09,947 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 943 transitions. [2018-12-02 05:07:09,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 943 transitions. [2018-12-02 05:07:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 05:07:09,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:09,948 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-12-02 05:07:09,948 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:09,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:09,948 INFO L82 PathProgramCache]: Analyzing trace with hash -322329126, now seen corresponding path program 1 times [2018-12-02 05:07:09,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:09,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:09,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:09,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:09,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:09,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:09,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:09,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:09,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:09,983 INFO L87 Difference]: Start difference. First operand 738 states and 943 transitions. Second operand 5 states. [2018-12-02 05:07:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:10,025 INFO L93 Difference]: Finished difference Result 784 states and 990 transitions. [2018-12-02 05:07:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:10,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 05:07:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:10,027 INFO L225 Difference]: With dead ends: 784 [2018-12-02 05:07:10,028 INFO L226 Difference]: Without dead ends: 732 [2018-12-02 05:07:10,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-12-02 05:07:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2018-12-02 05:07:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-12-02 05:07:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 933 transitions. [2018-12-02 05:07:10,055 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 933 transitions. Word has length 65 [2018-12-02 05:07:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:10,055 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 933 transitions. [2018-12-02 05:07:10,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 933 transitions. [2018-12-02 05:07:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:07:10,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:10,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:10,056 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:10,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash 127484813, now seen corresponding path program 1 times [2018-12-02 05:07:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:10,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:10,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:10,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:10,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:07:10,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:10,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:10,135 INFO L87 Difference]: Start difference. First operand 732 states and 933 transitions. Second operand 12 states. [2018-12-02 05:07:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:10,252 INFO L93 Difference]: Finished difference Result 755 states and 957 transitions. [2018-12-02 05:07:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:07:10,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-02 05:07:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:10,253 INFO L225 Difference]: With dead ends: 755 [2018-12-02 05:07:10,253 INFO L226 Difference]: Without dead ends: 732 [2018-12-02 05:07:10,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:07:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-12-02 05:07:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2018-12-02 05:07:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-12-02 05:07:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 932 transitions. [2018-12-02 05:07:10,284 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 932 transitions. Word has length 70 [2018-12-02 05:07:10,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:10,284 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 932 transitions. [2018-12-02 05:07:10,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 932 transitions. [2018-12-02 05:07:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:07:10,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:10,285 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] [2018-12-02 05:07:10,285 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:10,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash 360839567, now seen corresponding path program 1 times [2018-12-02 05:07:10,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:10,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:10,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:10,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 05:07:10,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:10,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:07:10,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:07:10,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:07:10,349 INFO L87 Difference]: Start difference. First operand 732 states and 932 transitions. Second operand 12 states. [2018-12-02 05:07:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:10,463 INFO L93 Difference]: Finished difference Result 754 states and 955 transitions. [2018-12-02 05:07:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:07:10,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-02 05:07:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:10,465 INFO L225 Difference]: With dead ends: 754 [2018-12-02 05:07:10,465 INFO L226 Difference]: Without dead ends: 730 [2018-12-02 05:07:10,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:07:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-12-02 05:07:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-12-02 05:07:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-12-02 05:07:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 928 transitions. [2018-12-02 05:07:10,490 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 928 transitions. Word has length 67 [2018-12-02 05:07:10,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:10,490 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 928 transitions. [2018-12-02 05:07:10,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:07:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 928 transitions. [2018-12-02 05:07:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:07:10,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:10,491 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] [2018-12-02 05:07:10,491 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:10,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1568772173, now seen corresponding path program 1 times [2018-12-02 05:07:10,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:10,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:10,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:10,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:10,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:10,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:10,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:10,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:10,525 INFO L87 Difference]: Start difference. First operand 730 states and 928 transitions. Second operand 5 states. [2018-12-02 05:07:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:10,568 INFO L93 Difference]: Finished difference Result 764 states and 963 transitions. [2018-12-02 05:07:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:10,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 05:07:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:10,570 INFO L225 Difference]: With dead ends: 764 [2018-12-02 05:07:10,570 INFO L226 Difference]: Without dead ends: 725 [2018-12-02 05:07:10,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-12-02 05:07:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-12-02 05:07:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-02 05:07:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 921 transitions. [2018-12-02 05:07:10,595 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 921 transitions. Word has length 67 [2018-12-02 05:07:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:10,595 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 921 transitions. [2018-12-02 05:07:10,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 921 transitions. [2018-12-02 05:07:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 05:07:10,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:10,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:10,596 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:10,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1402336471, now seen corresponding path program 1 times [2018-12-02 05:07:10,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:10,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:10,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:10,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:10,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:10,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:10,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:10,631 INFO L87 Difference]: Start difference. First operand 725 states and 921 transitions. Second operand 5 states. [2018-12-02 05:07:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:10,891 INFO L93 Difference]: Finished difference Result 808 states and 1028 transitions. [2018-12-02 05:07:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:10,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 05:07:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:10,893 INFO L225 Difference]: With dead ends: 808 [2018-12-02 05:07:10,893 INFO L226 Difference]: Without dead ends: 799 [2018-12-02 05:07:10,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-12-02 05:07:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 725. [2018-12-02 05:07:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-02 05:07:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 919 transitions. [2018-12-02 05:07:10,919 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 919 transitions. Word has length 68 [2018-12-02 05:07:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:10,919 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 919 transitions. [2018-12-02 05:07:10,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 919 transitions. [2018-12-02 05:07:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:07:10,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:10,920 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] [2018-12-02 05:07:10,920 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:10,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1734361953, now seen corresponding path program 1 times [2018-12-02 05:07:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:10,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:10,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:10,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:10,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:07:10,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:10,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:07:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:07:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:07:10,982 INFO L87 Difference]: Start difference. First operand 725 states and 919 transitions. Second operand 7 states. [2018-12-02 05:07:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:11,054 INFO L93 Difference]: Finished difference Result 771 states and 966 transitions. [2018-12-02 05:07:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:07:11,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 05:07:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:11,055 INFO L225 Difference]: With dead ends: 771 [2018-12-02 05:07:11,055 INFO L226 Difference]: Without dead ends: 726 [2018-12-02 05:07:11,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-12-02 05:07:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 724. [2018-12-02 05:07:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-02 05:07:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 915 transitions. [2018-12-02 05:07:11,084 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 915 transitions. Word has length 74 [2018-12-02 05:07:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:11,084 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 915 transitions. [2018-12-02 05:07:11,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:07:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 915 transitions. [2018-12-02 05:07:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:07:11,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:11,085 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] [2018-12-02 05:07:11,085 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:11,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1859005469, now seen corresponding path program 1 times [2018-12-02 05:07:11,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:11,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:11,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:11,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:11,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:07:11,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:11,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:07:11,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:07:11,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:07:11,153 INFO L87 Difference]: Start difference. First operand 724 states and 915 transitions. Second operand 14 states. [2018-12-02 05:07:11,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:11,280 INFO L93 Difference]: Finished difference Result 746 states and 938 transitions. [2018-12-02 05:07:11,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:07:11,280 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-02 05:07:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:11,281 INFO L225 Difference]: With dead ends: 746 [2018-12-02 05:07:11,281 INFO L226 Difference]: Without dead ends: 714 [2018-12-02 05:07:11,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:07:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-02 05:07:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-12-02 05:07:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-12-02 05:07:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 900 transitions. [2018-12-02 05:07:11,309 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 900 transitions. Word has length 74 [2018-12-02 05:07:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:11,309 INFO L480 AbstractCegarLoop]: Abstraction has 714 states and 900 transitions. [2018-12-02 05:07:11,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:07:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 900 transitions. [2018-12-02 05:07:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:07:11,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:11,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:11,311 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:11,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash 829084687, now seen corresponding path program 1 times [2018-12-02 05:07:11,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:11,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:11,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:07:11,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:11,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:07:11,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:07:11,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:07:11,416 INFO L87 Difference]: Start difference. First operand 714 states and 900 transitions. Second operand 14 states. [2018-12-02 05:07:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:11,547 INFO L93 Difference]: Finished difference Result 738 states and 926 transitions. [2018-12-02 05:07:11,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:07:11,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-02 05:07:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:11,548 INFO L225 Difference]: With dead ends: 738 [2018-12-02 05:07:11,548 INFO L226 Difference]: Without dead ends: 710 [2018-12-02 05:07:11,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:07:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-12-02 05:07:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2018-12-02 05:07:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-12-02 05:07:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 894 transitions. [2018-12-02 05:07:11,575 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 894 transitions. Word has length 70 [2018-12-02 05:07:11,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:11,576 INFO L480 AbstractCegarLoop]: Abstraction has 710 states and 894 transitions. [2018-12-02 05:07:11,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:07:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 894 transitions. [2018-12-02 05:07:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:07:11,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:11,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:11,577 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:11,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:11,577 INFO L82 PathProgramCache]: Analyzing trace with hash 77291112, now seen corresponding path program 1 times [2018-12-02 05:07:11,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:11,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:11,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:11,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:11,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:11,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:11,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:11,597 INFO L87 Difference]: Start difference. First operand 710 states and 894 transitions. Second operand 5 states. [2018-12-02 05:07:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:11,642 INFO L93 Difference]: Finished difference Result 744 states and 929 transitions. [2018-12-02 05:07:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:11,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 05:07:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:11,644 INFO L225 Difference]: With dead ends: 744 [2018-12-02 05:07:11,645 INFO L226 Difference]: Without dead ends: 705 [2018-12-02 05:07:11,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:11,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-12-02 05:07:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2018-12-02 05:07:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-12-02 05:07:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 887 transitions. [2018-12-02 05:07:11,674 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 887 transitions. Word has length 69 [2018-12-02 05:07:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:11,674 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 887 transitions. [2018-12-02 05:07:11,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 887 transitions. [2018-12-02 05:07:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:07:11,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:11,675 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-12-02 05:07:11,676 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:11,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1952246579, now seen corresponding path program 1 times [2018-12-02 05:07:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:11,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:11,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:07:11,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:11,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:07:11,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:07:11,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:11,731 INFO L87 Difference]: Start difference. First operand 705 states and 887 transitions. Second operand 11 states. [2018-12-02 05:07:11,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:11,820 INFO L93 Difference]: Finished difference Result 732 states and 917 transitions. [2018-12-02 05:07:11,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:07:11,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 05:07:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:11,823 INFO L225 Difference]: With dead ends: 732 [2018-12-02 05:07:11,823 INFO L226 Difference]: Without dead ends: 702 [2018-12-02 05:07:11,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-12-02 05:07:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2018-12-02 05:07:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-12-02 05:07:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 882 transitions. [2018-12-02 05:07:11,867 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 882 transitions. Word has length 69 [2018-12-02 05:07:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:11,867 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 882 transitions. [2018-12-02 05:07:11,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:07:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 882 transitions. [2018-12-02 05:07:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:07:11,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:11,868 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-12-02 05:07:11,868 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:11,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083894, now seen corresponding path program 1 times [2018-12-02 05:07:11,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:11,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:11,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:11,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:11,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:11,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:07:11,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:11,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:07:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:07:11,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:11,927 INFO L87 Difference]: Start difference. First operand 702 states and 882 transitions. Second operand 11 states. [2018-12-02 05:07:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:12,048 INFO L93 Difference]: Finished difference Result 712 states and 891 transitions. [2018-12-02 05:07:12,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:07:12,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 05:07:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:12,050 INFO L225 Difference]: With dead ends: 712 [2018-12-02 05:07:12,050 INFO L226 Difference]: Without dead ends: 706 [2018-12-02 05:07:12,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-12-02 05:07:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 699. [2018-12-02 05:07:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-12-02 05:07:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 875 transitions. [2018-12-02 05:07:12,076 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 875 transitions. Word has length 69 [2018-12-02 05:07:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:12,076 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 875 transitions. [2018-12-02 05:07:12,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:07:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 875 transitions. [2018-12-02 05:07:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:07:12,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:12,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:12,078 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:12,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:12,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1163360724, now seen corresponding path program 1 times [2018-12-02 05:07:12,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:12,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:12,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:12,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:12,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:12,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:12,101 INFO L87 Difference]: Start difference. First operand 699 states and 875 transitions. Second operand 5 states. [2018-12-02 05:07:12,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:12,291 INFO L93 Difference]: Finished difference Result 776 states and 976 transitions. [2018-12-02 05:07:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:12,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 05:07:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:12,293 INFO L225 Difference]: With dead ends: 776 [2018-12-02 05:07:12,293 INFO L226 Difference]: Without dead ends: 741 [2018-12-02 05:07:12,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-12-02 05:07:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 670. [2018-12-02 05:07:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-12-02 05:07:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 839 transitions. [2018-12-02 05:07:12,318 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 839 transitions. Word has length 69 [2018-12-02 05:07:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:12,319 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 839 transitions. [2018-12-02 05:07:12,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 839 transitions. [2018-12-02 05:07:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 05:07:12,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:12,319 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-12-02 05:07:12,320 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:12,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:12,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1070160589, now seen corresponding path program 1 times [2018-12-02 05:07:12,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:12,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:12,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:07:12,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:12,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:07:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:07:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:12,333 INFO L87 Difference]: Start difference. First operand 670 states and 839 transitions. Second operand 3 states. [2018-12-02 05:07:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:12,366 INFO L93 Difference]: Finished difference Result 696 states and 869 transitions. [2018-12-02 05:07:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:07:12,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 05:07:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:12,367 INFO L225 Difference]: With dead ends: 696 [2018-12-02 05:07:12,367 INFO L226 Difference]: Without dead ends: 656 [2018-12-02 05:07:12,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:07:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-12-02 05:07:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2018-12-02 05:07:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-02 05:07:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 814 transitions. [2018-12-02 05:07:12,392 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 814 transitions. Word has length 69 [2018-12-02 05:07:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:12,392 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 814 transitions. [2018-12-02 05:07:12,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:07:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 814 transitions. [2018-12-02 05:07:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 05:07:12,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:12,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:12,393 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:12,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash -81188571, now seen corresponding path program 1 times [2018-12-02 05:07:12,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:12,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:12,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:07:12,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:12,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:07:12,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:07:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:07:12,461 INFO L87 Difference]: Start difference. First operand 652 states and 814 transitions. Second operand 14 states. [2018-12-02 05:07:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:12,576 INFO L93 Difference]: Finished difference Result 716 states and 882 transitions. [2018-12-02 05:07:12,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:07:12,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-02 05:07:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:12,578 INFO L225 Difference]: With dead ends: 716 [2018-12-02 05:07:12,578 INFO L226 Difference]: Without dead ends: 646 [2018-12-02 05:07:12,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:07:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-12-02 05:07:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-12-02 05:07:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-12-02 05:07:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 805 transitions. [2018-12-02 05:07:12,603 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 805 transitions. Word has length 71 [2018-12-02 05:07:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:12,603 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 805 transitions. [2018-12-02 05:07:12,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:07:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 805 transitions. [2018-12-02 05:07:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 05:07:12,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:12,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:12,605 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:12,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:12,605 INFO L82 PathProgramCache]: Analyzing trace with hash -37760830, now seen corresponding path program 1 times [2018-12-02 05:07:12,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:12,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:12,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:12,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:12,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:12,634 INFO L87 Difference]: Start difference. First operand 646 states and 805 transitions. Second operand 5 states. [2018-12-02 05:07:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:12,666 INFO L93 Difference]: Finished difference Result 693 states and 854 transitions. [2018-12-02 05:07:12,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:12,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-02 05:07:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:12,667 INFO L225 Difference]: With dead ends: 693 [2018-12-02 05:07:12,668 INFO L226 Difference]: Without dead ends: 650 [2018-12-02 05:07:12,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-12-02 05:07:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 646. [2018-12-02 05:07:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-12-02 05:07:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 804 transitions. [2018-12-02 05:07:12,692 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 804 transitions. Word has length 71 [2018-12-02 05:07:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:12,693 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 804 transitions. [2018-12-02 05:07:12,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 804 transitions. [2018-12-02 05:07:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 05:07:12,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:12,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:12,694 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:12,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2013223168, now seen corresponding path program 1 times [2018-12-02 05:07:12,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:12,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:12,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:12,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:07:12,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:12,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:07:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:07:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:07:12,776 INFO L87 Difference]: Start difference. First operand 646 states and 804 transitions. Second operand 14 states. [2018-12-02 05:07:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:12,893 INFO L93 Difference]: Finished difference Result 670 states and 830 transitions. [2018-12-02 05:07:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:07:12,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-02 05:07:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:12,895 INFO L225 Difference]: With dead ends: 670 [2018-12-02 05:07:12,895 INFO L226 Difference]: Without dead ends: 639 [2018-12-02 05:07:12,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:07:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-02 05:07:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-12-02 05:07:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-12-02 05:07:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 794 transitions. [2018-12-02 05:07:12,919 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 794 transitions. Word has length 71 [2018-12-02 05:07:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:12,920 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 794 transitions. [2018-12-02 05:07:12,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:07:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 794 transitions. [2018-12-02 05:07:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 05:07:12,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:12,921 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] [2018-12-02 05:07:12,921 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:12,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1067828418, now seen corresponding path program 1 times [2018-12-02 05:07:12,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:12,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:12,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:12,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:07:12,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:12,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:07:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:07:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:07:12,963 INFO L87 Difference]: Start difference. First operand 639 states and 794 transitions. Second operand 7 states. [2018-12-02 05:07:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:13,021 INFO L93 Difference]: Finished difference Result 693 states and 855 transitions. [2018-12-02 05:07:13,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:07:13,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-02 05:07:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:13,022 INFO L225 Difference]: With dead ends: 693 [2018-12-02 05:07:13,022 INFO L226 Difference]: Without dead ends: 637 [2018-12-02 05:07:13,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:07:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-12-02 05:07:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2018-12-02 05:07:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-12-02 05:07:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 784 transitions. [2018-12-02 05:07:13,046 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 784 transitions. Word has length 77 [2018-12-02 05:07:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:13,046 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 784 transitions. [2018-12-02 05:07:13,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:07:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 784 transitions. [2018-12-02 05:07:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:07:13,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:13,046 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-12-02 05:07:13,047 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:13,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:13,047 INFO L82 PathProgramCache]: Analyzing trace with hash -615466654, now seen corresponding path program 1 times [2018-12-02 05:07:13,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:13,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:13,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 05:07:13,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:13,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 05:07:13,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 05:07:13,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:07:13,113 INFO L87 Difference]: Start difference. First operand 633 states and 784 transitions. Second operand 14 states. [2018-12-02 05:07:13,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:13,228 INFO L93 Difference]: Finished difference Result 692 states and 846 transitions. [2018-12-02 05:07:13,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:07:13,228 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-02 05:07:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:13,229 INFO L225 Difference]: With dead ends: 692 [2018-12-02 05:07:13,229 INFO L226 Difference]: Without dead ends: 621 [2018-12-02 05:07:13,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:07:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-12-02 05:07:13,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-12-02 05:07:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-12-02 05:07:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 765 transitions. [2018-12-02 05:07:13,254 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 765 transitions. Word has length 72 [2018-12-02 05:07:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:13,254 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 765 transitions. [2018-12-02 05:07:13,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 05:07:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 765 transitions. [2018-12-02 05:07:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 05:07:13,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:13,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:07:13,255 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:13,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2025859791, now seen corresponding path program 1 times [2018-12-02 05:07:13,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:13,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:13,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:07:13,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:13,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:07:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:07:13,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:07:13,307 INFO L87 Difference]: Start difference. First operand 621 states and 765 transitions. Second operand 11 states. [2018-12-02 05:07:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:13,386 INFO L93 Difference]: Finished difference Result 812 states and 992 transitions. [2018-12-02 05:07:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:07:13,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-02 05:07:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:13,387 INFO L225 Difference]: With dead ends: 812 [2018-12-02 05:07:13,388 INFO L226 Difference]: Without dead ends: 663 [2018-12-02 05:07:13,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-12-02 05:07:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 627. [2018-12-02 05:07:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-12-02 05:07:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 767 transitions. [2018-12-02 05:07:13,411 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 767 transitions. Word has length 71 [2018-12-02 05:07:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:13,411 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 767 transitions. [2018-12-02 05:07:13,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:07:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 767 transitions. [2018-12-02 05:07:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 05:07:13,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:13,412 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] [2018-12-02 05:07:13,412 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:13,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1771854681, now seen corresponding path program 1 times [2018-12-02 05:07:13,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:13,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:13,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:13,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:07:13,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:13,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:07:13,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:07:13,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:13,503 INFO L87 Difference]: Start difference. First operand 627 states and 767 transitions. Second operand 13 states. [2018-12-02 05:07:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:13,642 INFO L93 Difference]: Finished difference Result 647 states and 788 transitions. [2018-12-02 05:07:13,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:13,642 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-12-02 05:07:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:13,643 INFO L225 Difference]: With dead ends: 647 [2018-12-02 05:07:13,643 INFO L226 Difference]: Without dead ends: 622 [2018-12-02 05:07:13,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:07:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-12-02 05:07:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2018-12-02 05:07:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-12-02 05:07:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 759 transitions. [2018-12-02 05:07:13,667 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 759 transitions. Word has length 79 [2018-12-02 05:07:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:13,667 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 759 transitions. [2018-12-02 05:07:13,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:07:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 759 transitions. [2018-12-02 05:07:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:07:13,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:13,668 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-12-02 05:07:13,668 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:13,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash -253233342, now seen corresponding path program 1 times [2018-12-02 05:07:13,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:13,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:13,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:13,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-12-02 05:07:13,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:13,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:07:13,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:13,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:07:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:07:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:07:13,754 INFO L87 Difference]: Start difference. First operand 622 states and 759 transitions. Second operand 13 states. [2018-12-02 05:07:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:13,886 INFO L93 Difference]: Finished difference Result 624 states and 760 transitions. [2018-12-02 05:07:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:07:13,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-02 05:07:13,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:13,887 INFO L225 Difference]: With dead ends: 624 [2018-12-02 05:07:13,887 INFO L226 Difference]: Without dead ends: 573 [2018-12-02 05:07:13,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:07:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-12-02 05:07:13,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2018-12-02 05:07:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-12-02 05:07:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 705 transitions. [2018-12-02 05:07:13,909 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 705 transitions. Word has length 72 [2018-12-02 05:07:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:13,909 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 705 transitions. [2018-12-02 05:07:13,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:07:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 705 transitions. [2018-12-02 05:07:13,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:07:13,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:13,909 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] [2018-12-02 05:07:13,910 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:13,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:13,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1632556457, now seen corresponding path program 1 times [2018-12-02 05:07:13,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:13,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:13,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:13,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:07:13,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:13,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:07:13,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:07:13,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:07:13,953 INFO L87 Difference]: Start difference. First operand 573 states and 705 transitions. Second operand 10 states. [2018-12-02 05:07:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:14,718 INFO L93 Difference]: Finished difference Result 1190 states and 1457 transitions. [2018-12-02 05:07:14,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:07:14,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-02 05:07:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:14,720 INFO L225 Difference]: With dead ends: 1190 [2018-12-02 05:07:14,720 INFO L226 Difference]: Without dead ends: 1043 [2018-12-02 05:07:14,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:07:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-12-02 05:07:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 907. [2018-12-02 05:07:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-12-02 05:07:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1135 transitions. [2018-12-02 05:07:14,756 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1135 transitions. Word has length 73 [2018-12-02 05:07:14,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:14,756 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1135 transitions. [2018-12-02 05:07:14,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:07:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1135 transitions. [2018-12-02 05:07:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:07:14,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:14,757 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] [2018-12-02 05:07:14,757 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:14,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1983138585, now seen corresponding path program 1 times [2018-12-02 05:07:14,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:14,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:14,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:14,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:14,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:14,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:14,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:07:14,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:14,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:07:14,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:07:14,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:07:14,788 INFO L87 Difference]: Start difference. First operand 907 states and 1135 transitions. Second operand 6 states. [2018-12-02 05:07:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:15,154 INFO L93 Difference]: Finished difference Result 1189 states and 1450 transitions. [2018-12-02 05:07:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:07:15,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 05:07:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:15,156 INFO L225 Difference]: With dead ends: 1189 [2018-12-02 05:07:15,156 INFO L226 Difference]: Without dead ends: 1059 [2018-12-02 05:07:15,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:07:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-12-02 05:07:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 998. [2018-12-02 05:07:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-12-02 05:07:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1243 transitions. [2018-12-02 05:07:15,207 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1243 transitions. Word has length 73 [2018-12-02 05:07:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:15,207 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1243 transitions. [2018-12-02 05:07:15,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:07:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1243 transitions. [2018-12-02 05:07:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:07:15,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:15,209 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] [2018-12-02 05:07:15,209 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:15,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:15,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1013991573, now seen corresponding path program 1 times [2018-12-02 05:07:15,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:15,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:15,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:07:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:07:15,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:07:15,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:07:15,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:07:15,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:07:15,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:07:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:15,242 INFO L87 Difference]: Start difference. First operand 998 states and 1243 transitions. Second operand 5 states. [2018-12-02 05:07:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:07:15,287 INFO L93 Difference]: Finished difference Result 1043 states and 1291 transitions. [2018-12-02 05:07:15,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:07:15,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 05:07:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:07:15,289 INFO L225 Difference]: With dead ends: 1043 [2018-12-02 05:07:15,289 INFO L226 Difference]: Without dead ends: 978 [2018-12-02 05:07:15,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:07:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-12-02 05:07:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2018-12-02 05:07:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-12-02 05:07:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1215 transitions. [2018-12-02 05:07:15,329 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1215 transitions. Word has length 73 [2018-12-02 05:07:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:07:15,329 INFO L480 AbstractCegarLoop]: Abstraction has 978 states and 1215 transitions. [2018-12-02 05:07:15,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:07:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1215 transitions. [2018-12-02 05:07:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:07:15,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:07:15,330 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] [2018-12-02 05:07:15,330 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:07:15,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:07:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1533375131, now seen corresponding path program 1 times [2018-12-02 05:07:15,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:07:15,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:15,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:07:15,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:07:15,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:07:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:07:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:07:15,375 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:07:15,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:07:15 BoogieIcfgContainer [2018-12-02 05:07:15,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:07:15,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:07:15,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:07:15,434 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:07:15,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:06:58" (3/4) ... [2018-12-02 05:07:15,437 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:07:15,508 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e8978254-035a-4a46-a6a3-1c31c8b19d04/bin-2019/utaipan/witness.graphml [2018-12-02 05:07:15,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:07:15,508 INFO L168 Benchmark]: Toolchain (without parser) took 17749.35 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 725.6 MB). Free memory was 947.0 MB in the beginning and 1.6 GB in the end (delta: -613.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:15,509 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:07:15,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:15,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:07:15,510 INFO L168 Benchmark]: Boogie Preprocessor took 41.09 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:15,510 INFO L168 Benchmark]: RCFGBuilder took 693.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.9 MB in the end (delta: 144.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:15,510 INFO L168 Benchmark]: TraceAbstraction took 16567.95 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 576.2 MB). Free memory was 972.8 MB in the beginning and 1.6 GB in the end (delta: -605.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:07:15,510 INFO L168 Benchmark]: Witness Printer took 74.05 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-12-02 05:07:15,511 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.09 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 693.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 979.9 MB in the end (delta: 144.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16567.95 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 576.2 MB). Free memory was 972.8 MB in the beginning and 1.6 GB in the end (delta: -605.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 74.05 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int s ; [L32] int UNLOADED ; [L33] int NP ; [L34] int DC ; [L35] int SKIP1 ; [L36] int SKIP2 ; [L37] int MPR1 ; [L38] int MPR3 ; [L39] int IPC ; [L40] int pended ; [L41] int compFptr ; [L42] int compRegistered ; [L43] int lowerDriverReturn ; [L44] int setEventCalled ; [L45] int customIrp ; [L46] int routine ; [L47] int myStatus ; [L48] int pirp ; [L49] int Executive ; [L50] int Suspended ; [L51] int KernelMode ; [L52] int DeviceUsageTypePaging ; VAL [\old(compFptr)=276, \old(compRegistered)=265, \old(customIrp)=268, \old(DC)=261, \old(DeviceUsageTypePaging)=273, \old(Executive)=266, \old(IPC)=262, \old(KernelMode)=281, \old(lowerDriverReturn)=279, \old(MPR1)=275, \old(MPR3)=271, \old(myStatus)=278, \old(NP)=267, \old(pended)=280, \old(pirp)=272, \old(routine)=269, \old(s)=263, \old(setEventCalled)=274, \old(SKIP1)=270, \old(SKIP2)=264, \old(Suspended)=277, \old(UNLOADED)=260, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1717] int pirp__IoStatus__Status ; [L1718] int d = __VERIFIER_nondet_int() ; [L1719] int status = __VERIFIER_nondet_int() ; [L1720] int irp = __VERIFIER_nondet_int() ; [L1721] int we_should_unload = __VERIFIER_nondet_int() ; [L1722] int irp_choice = __VERIFIER_nondet_int() ; [L1723] int devobj = __VERIFIER_nondet_int() ; [L1724] int __cil_tmp9 ; [L1729] s = 0 [L1730] UNLOADED = 0 [L1731] NP = 0 [L1732] DC = 0 [L1733] SKIP1 = 0 [L1734] SKIP2 = 0 [L1735] MPR1 = 0 [L1736] MPR3 = 0 [L1737] IPC = 0 [L1738] pended = 0 [L1739] compFptr = 0 [L1740] compRegistered = 0 [L1741] lowerDriverReturn = 0 [L1742] setEventCalled = 0 [L1743] customIrp = 0 [L1744] routine = 0 [L1745] myStatus = 0 [L1746] pirp = 0 [L1747] Executive = 0 [L1748] Suspended = 5 [L1749] KernelMode = 0 [L1750] DeviceUsageTypePaging = 1 [L1753] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=0, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1754] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=5, UNLOADED=0] [L66] UNLOADED = 0 [L67] NP = 1 [L68] DC = 2 [L69] SKIP1 = 3 [L70] SKIP2 = 4 [L71] MPR1 = 5 [L72] MPR3 = 6 [L73] IPC = 7 [L74] s = UNLOADED [L75] pended = 0 [L76] compFptr = 0 [L77] compRegistered = 0 [L78] lowerDriverReturn = 0 [L79] setEventCalled = 0 [L80] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1754] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1756] COND TRUE status >= 0 [L1757] s = NP [L1758] customIrp = 0 [L1759] setEventCalled = customIrp [L1760] lowerDriverReturn = setEventCalled [L1761] compRegistered = lowerDriverReturn [L1762] compFptr = compRegistered [L1763] pended = compFptr [L1764] pirp__IoStatus__Status = 0 [L1765] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1766] COND TRUE irp_choice == 0 [L1767] pirp__IoStatus__Status = -1073741637 [L1768] myStatus = -1073741637 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1771] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1706] s = NP [L1707] customIrp = 0 [L1708] setEventCalled = customIrp [L1709] lowerDriverReturn = setEventCalled [L1710] compRegistered = lowerDriverReturn [L1711] compFptr = compRegistered [L1712] pended = compFptr VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1771] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1774] COND FALSE !(status < 0) [L1778] int tmp_ndt_1; [L1779] tmp_ndt_1 = __VERIFIER_nondet_int() [L1780] COND TRUE tmp_ndt_1 == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1797] CALL, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L312] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L313] int status ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L316] COND FALSE !(deviceExtension__Active == 2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L319] COND FALSE !(deviceExtension__Active == 3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L322] COND FALSE !(deviceExtension__Active == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L325] COND TRUE deviceExtension__Active == 7 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L347] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1590] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1591] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1592] int irpSp__Control ; [L1593] int tmp ; [L1594] int tmp___0 ; [L1595] int __cil_tmp8 ; [L1596] int __cil_tmp9 ; [L1597] int __cil_tmp10 ; [L1598] int __cil_tmp11 ; [L1599] int __cil_tmp12 ; [L1603] __cil_tmp8 = 56 [L1604] __cil_tmp9 = 16384 [L1605] __cil_tmp10 = 131072 [L1606] __cil_tmp11 = 147456 [L1607] __cil_tmp12 = 147512 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1608] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND FALSE !(s != NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1614] COND FALSE !(compRegistered != 0) [L1619] compRegistered = 1 [L1620] routine = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1624] irpSp__Control = 224 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1899] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1900] int returnVal2 ; [L1901] int compRetStatus ; [L1902] int lcontext = __VERIFIER_nondet_int() ; [L1903] unsigned long __cil_tmp8 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1906] COND TRUE \read(compRegistered) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE routine == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1568] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1569] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1572] COND TRUE \read(Irp__PendingReturned) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1573] COND TRUE pended == 0 [L1574] pended = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1581] COND FALSE !(myStatus >= 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1586] return (myStatus); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(Context)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=0, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1909] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1919] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1920] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1927] COND FALSE !(\read(Irp__PendingReturned)) [L1930] int tmp_ndt_4; [L1931] tmp_ndt_4 = __VERIFIER_nondet_int() [L1932] COND TRUE tmp_ndt_4 == 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1943] returnVal2 = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1957] COND TRUE s == NP [L1958] s = IPC [L1959] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1980] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1625] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1627] return (tmp); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L347] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioHPCdrDeviceControl(DeviceObject, Irp)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L347] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L362] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=-1073741637, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1797] RET, EXPR CdAudioDeviceControl(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, CdAudioDeviceControl(devobj, pirp)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1797] status = CdAudioDeviceControl(devobj, pirp) [L1818] COND FALSE !(\read(we_should_unload)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1824] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1832] COND TRUE pended == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND FALSE !(s == MPR3) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1840] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE s != SKIP2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND FALSE !(s != IPC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1856] COND FALSE !(pended != 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1868] COND TRUE status != 259 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1870] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L58] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceUsageTypePaging)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(pirp)=0, \old(routine)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(Suspended)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 536 locations, 1 error locations. UNSAFE Result, 16.5s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38229 SDtfs, 15918 SDslu, 162841 SDs, 0 SdLazy, 13299 SolverSat, 2552 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=998occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 65 MinimizatonAttempts, 1879 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3896 NumberOfCodeBlocks, 3896 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3758 ConstructedInterpolants, 0 QuantifiedInterpolants, 489102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...