./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_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/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_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/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-09 19:02:05,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:02:05,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:02:05,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:02:05,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:02:05,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:02:05,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:02:05,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:02:05,419 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:02:05,419 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:02:05,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:02:05,420 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:02:05,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:02:05,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:02:05,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:02:05,422 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:02:05,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:02:05,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:02:05,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:02:05,424 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:02:05,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:02:05,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:02:05,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:02:05,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:02:05,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:02:05,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:02:05,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:02:05,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:02:05,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:02:05,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:02:05,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:02:05,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:02:05,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:02:05,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:02:05,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:02:05,431 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:02:05,431 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:02:05,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:02:05,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:02:05,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:02:05,439 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:02:05,439 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:02:05,439 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:02:05,439 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:02:05,439 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:02:05,439 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:02:05,439 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:02:05,440 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:02:05,440 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:02:05,440 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:02:05,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:02:05,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:02:05,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:02:05,441 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:02:05,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:02:05,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:02:05,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:02:05,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:02:05,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:02:05,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:02:05,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:02:05,443 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:02:05,443 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:02:05,443 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:02:05,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:02:05,443 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:02:05,443 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_8ec90142-21c2-480e-853f-50b45a79d1b7/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-09 19:02:05,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:02:05,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:02:05,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:02:05,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:02:05,470 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:02:05,470 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 19:02:05,504 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/data/54b6fcfb6/b8185ac8ae424c70af01007e23d8c1a8/FLAG70c1d061a [2018-12-09 19:02:05,926 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:02:05,927 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 19:02:05,935 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/data/54b6fcfb6/b8185ac8ae424c70af01007e23d8c1a8/FLAG70c1d061a [2018-12-09 19:02:05,943 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/data/54b6fcfb6/b8185ac8ae424c70af01007e23d8c1a8 [2018-12-09 19:02:05,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:02:05,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:02:05,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:02:05,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:02:05,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:02:05,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:02:05" (1/1) ... [2018-12-09 19:02:05,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3936bd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:05, skipping insertion in model container [2018-12-09 19:02:05,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:02:05" (1/1) ... [2018-12-09 19:02:05,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:02:05,984 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:02:06,175 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:02:06,215 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:02:06,287 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:02:06,299 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:02:06,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06 WrapperNode [2018-12-09 19:02:06,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:02:06,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:02:06,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:02:06,300 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:02:06,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:02:06,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:02:06,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:02:06,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:02:06,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... [2018-12-09 19:02:06,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:02:06,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:02:06,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:02:06,361 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:02:06,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/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-09 19:02:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-09 19:02:06,395 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-09 19:02:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-09 19:02:06,395 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-09 19:02:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-09 19:02:06,395 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-09 19:02:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-09 19:02:06,395 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-09 19:02:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-09 19:02:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-09 19:02:06,396 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-09 19:02:06,397 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-09 19:02:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-09 19:02:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-09 19:02:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-09 19:02:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-09 19:02:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-09 19:02:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-09 19:02:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-09 19:02:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-09 19:02:06,605 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,605 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,669 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,670 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,710 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,710 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,772 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,772 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,819 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,820 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,905 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,906 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,943 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,944 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:06,959 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:06,959 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:07,096 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:02:07,096 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:02:07,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:02:07,113 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:02:07,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:02:07 BoogieIcfgContainer [2018-12-09 19:02:07,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:02:07,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:02:07,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:02:07,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:02:07,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:02:05" (1/3) ... [2018-12-09 19:02:07,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe4fd36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:02:07, skipping insertion in model container [2018-12-09 19:02:07,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:02:06" (2/3) ... [2018-12-09 19:02:07,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe4fd36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:02:07, skipping insertion in model container [2018-12-09 19:02:07,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:02:07" (3/3) ... [2018-12-09 19:02:07,119 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-09 19:02:07,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:02:07,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:02:07,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:02:07,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:02:07,169 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:02:07,169 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:02:07,169 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:02:07,169 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:02:07,169 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:02:07,169 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:02:07,169 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:02:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2018-12-09 19:02:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 19:02:07,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:07,197 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-09 19:02:07,198 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:07,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2018-12-09 19:02:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:07,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:07,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:07,346 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-09 19:02:07,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:07,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:07,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:07,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:07,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:07,361 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2018-12-09 19:02:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:07,472 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2018-12-09 19:02:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:07,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 19:02:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:07,485 INFO L225 Difference]: With dead ends: 891 [2018-12-09 19:02:07,485 INFO L226 Difference]: Without dead ends: 509 [2018-12-09 19:02:07,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-09 19:02:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-12-09 19:02:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-09 19:02:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2018-12-09 19:02:07,539 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2018-12-09 19:02:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2018-12-09 19:02:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2018-12-09 19:02:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 19:02:07,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:07,540 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-09 19:02:07,540 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:07,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2018-12-09 19:02:07,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:07,613 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-09 19:02:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:07,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:07,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:07,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:07,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:07,615 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2018-12-09 19:02:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:07,768 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2018-12-09 19:02:07,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:07,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 19:02:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:07,774 INFO L225 Difference]: With dead ends: 795 [2018-12-09 19:02:07,774 INFO L226 Difference]: Without dead ends: 674 [2018-12-09 19:02:07,775 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-09 19:02:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-12-09 19:02:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2018-12-09 19:02:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-12-09 19:02:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2018-12-09 19:02:07,809 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2018-12-09 19:02:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:07,809 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2018-12-09 19:02:07,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2018-12-09 19:02:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:02:07,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:07,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:07,811 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:07,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash 880506904, now seen corresponding path program 1 times [2018-12-09 19:02:07,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:07,869 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-09 19:02:07,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:07,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:07,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:07,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:07,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:07,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:07,870 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2018-12-09 19:02:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:07,917 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2018-12-09 19:02:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:07,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:02:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:07,922 INFO L225 Difference]: With dead ends: 1001 [2018-12-09 19:02:07,922 INFO L226 Difference]: Without dead ends: 823 [2018-12-09 19:02:07,923 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-09 19:02:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-09 19:02:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2018-12-09 19:02:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-09 19:02:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2018-12-09 19:02:07,955 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2018-12-09 19:02:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:07,955 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2018-12-09 19:02:07,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2018-12-09 19:02:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 19:02:07,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:07,957 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-09 19:02:07,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:07,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:07,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2133514060, now seen corresponding path program 1 times [2018-12-09 19:02:07,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:07,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:07,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:07,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:07,992 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-09 19:02:07,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:07,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:07,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:07,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:07,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:07,993 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2018-12-09 19:02:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:08,119 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2018-12-09 19:02:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:08,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 19:02:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:08,124 INFO L225 Difference]: With dead ends: 1430 [2018-12-09 19:02:08,124 INFO L226 Difference]: Without dead ends: 1164 [2018-12-09 19:02:08,125 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-09 19:02:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-12-09 19:02:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2018-12-09 19:02:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-09 19:02:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-12-09 19:02:08,160 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2018-12-09 19:02:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:08,160 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-12-09 19:02:08,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-12-09 19:02:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 19:02:08,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:08,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:08,162 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:08,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1952820015, now seen corresponding path program 1 times [2018-12-09 19:02:08,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:08,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:08,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:08,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:08,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:08,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:08,216 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-12-09 19:02:08,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:08,726 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2018-12-09 19:02:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:02:08,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-09 19:02:08,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:08,730 INFO L225 Difference]: With dead ends: 1570 [2018-12-09 19:02:08,730 INFO L226 Difference]: Without dead ends: 990 [2018-12-09 19:02:08,731 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-09 19:02:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-12-09 19:02:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2018-12-09 19:02:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-09 19:02:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2018-12-09 19:02:08,769 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2018-12-09 19:02:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:08,769 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2018-12-09 19:02:08,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2018-12-09 19:02:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 19:02:08,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:08,771 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-09 19:02:08,771 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:08,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash -950761943, now seen corresponding path program 1 times [2018-12-09 19:02:08,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:08,801 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-09 19:02:08,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:08,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:08,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:08,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:08,803 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2018-12-09 19:02:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:08,861 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2018-12-09 19:02:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:08,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 19:02:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:08,863 INFO L225 Difference]: With dead ends: 892 [2018-12-09 19:02:08,864 INFO L226 Difference]: Without dead ends: 888 [2018-12-09 19:02:08,864 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-09 19:02:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-09 19:02:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-09 19:02:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-09 19:02:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2018-12-09 19:02:08,888 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2018-12-09 19:02:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:08,888 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2018-12-09 19:02:08,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2018-12-09 19:02:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 19:02:08,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:08,890 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-09 19:02:08,890 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:08,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash -826026373, now seen corresponding path program 1 times [2018-12-09 19:02:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:08,916 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-09 19:02:08,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:08,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:08,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:08,917 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2018-12-09 19:02:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:08,952 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2018-12-09 19:02:08,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:08,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 19:02:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:08,955 INFO L225 Difference]: With dead ends: 1280 [2018-12-09 19:02:08,956 INFO L226 Difference]: Without dead ends: 1019 [2018-12-09 19:02:08,957 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-09 19:02:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-09 19:02:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2018-12-09 19:02:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-12-09 19:02:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2018-12-09 19:02:08,983 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2018-12-09 19:02:08,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:08,983 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2018-12-09 19:02:08,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2018-12-09 19:02:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 19:02:08,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:08,984 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-09 19:02:08,984 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:08,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2018-12-09 19:02:08,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:08,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,012 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-09 19:02:09,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:09,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:09,013 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2018-12-09 19:02:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:09,061 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2018-12-09 19:02:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:09,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-09 19:02:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:09,066 INFO L225 Difference]: With dead ends: 976 [2018-12-09 19:02:09,066 INFO L226 Difference]: Without dead ends: 956 [2018-12-09 19:02:09,067 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-09 19:02:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-12-09 19:02:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2018-12-09 19:02:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-09 19:02:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2018-12-09 19:02:09,103 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2018-12-09 19:02:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:09,103 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2018-12-09 19:02:09,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2018-12-09 19:02:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:02:09,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:09,105 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-09 19:02:09,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:09,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 215600759, now seen corresponding path program 1 times [2018-12-09 19:02:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:09,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:09,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:09,139 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2018-12-09 19:02:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:09,171 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2018-12-09 19:02:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:09,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-09 19:02:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:09,173 INFO L225 Difference]: With dead ends: 1175 [2018-12-09 19:02:09,174 INFO L226 Difference]: Without dead ends: 933 [2018-12-09 19:02:09,174 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-09 19:02:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-09 19:02:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-12-09 19:02:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-09 19:02:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2018-12-09 19:02:09,201 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2018-12-09 19:02:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:09,201 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2018-12-09 19:02:09,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2018-12-09 19:02:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:02:09,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:09,203 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-09 19:02:09,203 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:09,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash -564668473, now seen corresponding path program 1 times [2018-12-09 19:02:09,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:09,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,242 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-09 19:02:09,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:02:09,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:02:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:02:09,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:02:09,242 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2018-12-09 19:02:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:09,472 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2018-12-09 19:02:09,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:02:09,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-09 19:02:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:09,475 INFO L225 Difference]: With dead ends: 1022 [2018-12-09 19:02:09,475 INFO L226 Difference]: Without dead ends: 793 [2018-12-09 19:02:09,475 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-09 19:02:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-09 19:02:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2018-12-09 19:02:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-09 19:02:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2018-12-09 19:02:09,502 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2018-12-09 19:02:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:09,502 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2018-12-09 19:02:09,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:02:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2018-12-09 19:02:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 19:02:09,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:09,504 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-09 19:02:09,504 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:09,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2018-12-09 19:02:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:09,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:09,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:09,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:09,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:09,531 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2018-12-09 19:02:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:09,559 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2018-12-09 19:02:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:09,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-09 19:02:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:09,562 INFO L225 Difference]: With dead ends: 879 [2018-12-09 19:02:09,562 INFO L226 Difference]: Without dead ends: 783 [2018-12-09 19:02:09,563 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-09 19:02:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-09 19:02:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2018-12-09 19:02:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-12-09 19:02:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2018-12-09 19:02:09,605 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2018-12-09 19:02:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:09,606 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2018-12-09 19:02:09,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2018-12-09 19:02:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 19:02:09,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:09,607 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-09 19:02:09,607 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:09,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2018-12-09 19:02:09,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:09,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:09,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,625 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-09 19:02:09,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:09,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:09,626 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2018-12-09 19:02:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:09,715 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2018-12-09 19:02:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:09,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 19:02:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:09,718 INFO L225 Difference]: With dead ends: 957 [2018-12-09 19:02:09,718 INFO L226 Difference]: Without dead ends: 943 [2018-12-09 19:02:09,718 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-09 19:02:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-09 19:02:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2018-12-09 19:02:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-09 19:02:09,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2018-12-09 19:02:09,743 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2018-12-09 19:02:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:09,743 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2018-12-09 19:02:09,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2018-12-09 19:02:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:02:09,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:09,745 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-09 19:02:09,745 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:09,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2018-12-09 19:02:09,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:09,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,791 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-09 19:02:09,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:02:09,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:02:09,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:02:09,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:02:09,792 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2018-12-09 19:02:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:09,894 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2018-12-09 19:02:09,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:02:09,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-09 19:02:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:09,898 INFO L225 Difference]: With dead ends: 863 [2018-12-09 19:02:09,898 INFO L226 Difference]: Without dead ends: 859 [2018-12-09 19:02:09,898 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-09 19:02:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-12-09 19:02:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2018-12-09 19:02:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-09 19:02:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2018-12-09 19:02:09,947 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2018-12-09 19:02:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:09,947 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2018-12-09 19:02:09,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:02:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2018-12-09 19:02:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 19:02:09,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:09,950 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-09 19:02:09,950 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:09,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2018-12-09 19:02:09,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:09,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:09,992 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-09 19:02:09,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:09,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 19:02:09,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:09,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:02:09,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:02:09,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:02:09,993 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2018-12-09 19:02:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:10,071 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2018-12-09 19:02:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:02:10,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-09 19:02:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:10,075 INFO L225 Difference]: With dead ends: 898 [2018-12-09 19:02:10,075 INFO L226 Difference]: Without dead ends: 877 [2018-12-09 19:02:10,076 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-09 19:02:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-12-09 19:02:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2018-12-09 19:02:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-09 19:02:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2018-12-09 19:02:10,107 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2018-12-09 19:02:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:10,107 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2018-12-09 19:02:10,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:02:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2018-12-09 19:02:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:02:10,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:10,108 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-09 19:02:10,109 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:10,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2018-12-09 19:02:10,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:10,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:10,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:10,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:10,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:10,137 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-09 19:02:10,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:10,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:02:10,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:10,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:02:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:02:10,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:02:10,138 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2018-12-09 19:02:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:10,185 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2018-12-09 19:02:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:02:10,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-09 19:02:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:10,188 INFO L225 Difference]: With dead ends: 901 [2018-12-09 19:02:10,188 INFO L226 Difference]: Without dead ends: 879 [2018-12-09 19:02:10,189 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-09 19:02:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-09 19:02:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2018-12-09 19:02:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-09 19:02:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2018-12-09 19:02:10,218 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2018-12-09 19:02:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:10,218 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2018-12-09 19:02:10,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:02:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2018-12-09 19:02:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:02:10,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:10,219 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-09 19:02:10,219 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:10,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2018-12-09 19:02:10,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:10,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:10,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:10,275 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-09 19:02:10,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:10,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:02:10,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:10,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:02:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:02:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:02:10,276 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2018-12-09 19:02:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:10,946 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2018-12-09 19:02:10,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:02:10,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-09 19:02:10,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:10,949 INFO L225 Difference]: With dead ends: 1088 [2018-12-09 19:02:10,949 INFO L226 Difference]: Without dead ends: 997 [2018-12-09 19:02:10,950 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-09 19:02:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-12-09 19:02:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2018-12-09 19:02:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-09 19:02:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2018-12-09 19:02:10,981 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2018-12-09 19:02:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:10,981 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2018-12-09 19:02:10,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:02:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2018-12-09 19:02:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:02:10,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:10,983 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-09 19:02:10,983 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:10,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2018-12-09 19:02:10,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:10,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:10,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:10,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:11,005 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-09 19:02:11,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:11,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:11,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:11,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:11,006 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2018-12-09 19:02:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:11,116 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2018-12-09 19:02:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:11,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 19:02:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:11,120 INFO L225 Difference]: With dead ends: 1038 [2018-12-09 19:02:11,120 INFO L226 Difference]: Without dead ends: 998 [2018-12-09 19:02:11,121 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-09 19:02:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-12-09 19:02:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2018-12-09 19:02:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-09 19:02:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2018-12-09 19:02:11,173 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2018-12-09 19:02:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:11,173 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2018-12-09 19:02:11,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2018-12-09 19:02:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:02:11,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:11,176 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-09 19:02:11,176 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:11,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2018-12-09 19:02:11,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:11,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:11,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:11,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:11,243 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-09 19:02:11,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:11,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:02:11,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:11,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:02:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:02:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:02:11,244 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 9 states. [2018-12-09 19:02:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:12,215 INFO L93 Difference]: Finished difference Result 1211 states and 1672 transitions. [2018-12-09 19:02:12,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:02:12,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-09 19:02:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:12,218 INFO L225 Difference]: With dead ends: 1211 [2018-12-09 19:02:12,218 INFO L226 Difference]: Without dead ends: 1142 [2018-12-09 19:02:12,219 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-09 19:02:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-12-09 19:02:12,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 902. [2018-12-09 19:02:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-12-09 19:02:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1225 transitions. [2018-12-09 19:02:12,252 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1225 transitions. Word has length 50 [2018-12-09 19:02:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:12,252 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1225 transitions. [2018-12-09 19:02:12,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:02:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1225 transitions. [2018-12-09 19:02:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:02:12,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:12,254 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-09 19:02:12,254 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:12,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2018-12-09 19:02:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:12,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:12,282 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-09 19:02:12,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:12,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:12,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:12,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:12,283 INFO L87 Difference]: Start difference. First operand 902 states and 1225 transitions. Second operand 3 states. [2018-12-09 19:02:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:12,348 INFO L93 Difference]: Finished difference Result 930 states and 1257 transitions. [2018-12-09 19:02:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:12,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 19:02:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:12,351 INFO L225 Difference]: With dead ends: 930 [2018-12-09 19:02:12,352 INFO L226 Difference]: Without dead ends: 925 [2018-12-09 19:02:12,352 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-09 19:02:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-09 19:02:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 919. [2018-12-09 19:02:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-09 19:02:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1246 transitions. [2018-12-09 19:02:12,390 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1246 transitions. Word has length 52 [2018-12-09 19:02:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:12,390 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1246 transitions. [2018-12-09 19:02:12,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1246 transitions. [2018-12-09 19:02:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:02:12,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:12,392 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-09 19:02:12,392 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:12,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2018-12-09 19:02:12,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:12,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:12,412 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-09 19:02:12,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:12,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:12,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:12,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:12,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:12,413 INFO L87 Difference]: Start difference. First operand 919 states and 1246 transitions. Second operand 3 states. [2018-12-09 19:02:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:12,483 INFO L93 Difference]: Finished difference Result 1135 states and 1537 transitions. [2018-12-09 19:02:12,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:12,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 19:02:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:12,486 INFO L225 Difference]: With dead ends: 1135 [2018-12-09 19:02:12,486 INFO L226 Difference]: Without dead ends: 888 [2018-12-09 19:02:12,487 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-09 19:02:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-09 19:02:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-09 19:02:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-09 19:02:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1206 transitions. [2018-12-09 19:02:12,529 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1206 transitions. Word has length 54 [2018-12-09 19:02:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:12,529 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1206 transitions. [2018-12-09 19:02:12,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1206 transitions. [2018-12-09 19:02:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:02:12,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:12,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:12,530 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:12,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2018-12-09 19:02:12,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:12,571 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-09 19:02:12,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:12,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:12,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:12,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:12,572 INFO L87 Difference]: Start difference. First operand 888 states and 1206 transitions. Second operand 5 states. [2018-12-09 19:02:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:12,868 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-12-09 19:02:12,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:12,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 19:02:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:12,870 INFO L225 Difference]: With dead ends: 900 [2018-12-09 19:02:12,870 INFO L226 Difference]: Without dead ends: 894 [2018-12-09 19:02:12,870 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-09 19:02:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-09 19:02:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2018-12-09 19:02:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-09 19:02:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1205 transitions. [2018-12-09 19:02:12,901 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1205 transitions. Word has length 53 [2018-12-09 19:02:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:12,901 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1205 transitions. [2018-12-09 19:02:12,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1205 transitions. [2018-12-09 19:02:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:02:12,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:12,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:12,902 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:12,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2018-12-09 19:02:12,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:12,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:12,928 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-09 19:02:12,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:12,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:12,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:12,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:12,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:12,929 INFO L87 Difference]: Start difference. First operand 888 states and 1205 transitions. Second operand 5 states. [2018-12-09 19:02:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:13,221 INFO L93 Difference]: Finished difference Result 903 states and 1220 transitions. [2018-12-09 19:02:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:13,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 19:02:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:13,223 INFO L225 Difference]: With dead ends: 903 [2018-12-09 19:02:13,223 INFO L226 Difference]: Without dead ends: 867 [2018-12-09 19:02:13,223 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-09 19:02:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-09 19:02:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 861. [2018-12-09 19:02:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-09 19:02:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1175 transitions. [2018-12-09 19:02:13,254 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1175 transitions. Word has length 52 [2018-12-09 19:02:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:13,254 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1175 transitions. [2018-12-09 19:02:13,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1175 transitions. [2018-12-09 19:02:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:02:13,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:13,256 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-09 19:02:13,256 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:13,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2018-12-09 19:02:13,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:13,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:13,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:13,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:13,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:13,292 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-09 19:02:13,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:13,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:13,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:13,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:13,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:13,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:13,293 INFO L87 Difference]: Start difference. First operand 861 states and 1175 transitions. Second operand 5 states. [2018-12-09 19:02:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:13,612 INFO L93 Difference]: Finished difference Result 871 states and 1183 transitions. [2018-12-09 19:02:13,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:13,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 19:02:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:13,614 INFO L225 Difference]: With dead ends: 871 [2018-12-09 19:02:13,614 INFO L226 Difference]: Without dead ends: 865 [2018-12-09 19:02:13,615 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-09 19:02:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-09 19:02:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2018-12-09 19:02:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-09 19:02:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2018-12-09 19:02:13,669 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 54 [2018-12-09 19:02:13,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:13,670 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2018-12-09 19:02:13,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2018-12-09 19:02:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:02:13,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:13,672 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-09 19:02:13,672 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:13,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2018-12-09 19:02:13,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:13,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:13,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:13,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:13,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:13,736 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-09 19:02:13,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:13,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:02:13,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:13,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:02:13,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:02:13,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:02:13,737 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2018-12-09 19:02:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:13,870 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2018-12-09 19:02:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:02:13,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-09 19:02:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:13,872 INFO L225 Difference]: With dead ends: 888 [2018-12-09 19:02:13,872 INFO L226 Difference]: Without dead ends: 852 [2018-12-09 19:02:13,872 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-09 19:02:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-12-09 19:02:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2018-12-09 19:02:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-12-09 19:02:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2018-12-09 19:02:13,906 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2018-12-09 19:02:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:13,907 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2018-12-09 19:02:13,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:02:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2018-12-09 19:02:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 19:02:13,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:13,908 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-09 19:02:13,908 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:13,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1728183236, now seen corresponding path program 1 times [2018-12-09 19:02:13,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:13,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:13,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:14,005 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-09 19:02:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:14,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:02:14,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:14,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:02:14,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:02:14,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:02:14,007 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2018-12-09 19:02:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:14,183 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2018-12-09 19:02:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:02:14,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-09 19:02:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:14,186 INFO L225 Difference]: With dead ends: 868 [2018-12-09 19:02:14,186 INFO L226 Difference]: Without dead ends: 850 [2018-12-09 19:02:14,187 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-09 19:02:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-09 19:02:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-12-09 19:02:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-12-09 19:02:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2018-12-09 19:02:14,231 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 56 [2018-12-09 19:02:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:14,232 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2018-12-09 19:02:14,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:02:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2018-12-09 19:02:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:02:14,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:14,233 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-09 19:02:14,234 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:14,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1135140490, now seen corresponding path program 1 times [2018-12-09 19:02:14,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:14,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:14,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:14,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:14,294 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-09 19:02:14,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:14,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:02:14,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:14,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:02:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:02:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:02:14,294 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2018-12-09 19:02:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:14,434 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2018-12-09 19:02:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:02:14,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-09 19:02:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:14,436 INFO L225 Difference]: With dead ends: 863 [2018-12-09 19:02:14,436 INFO L226 Difference]: Without dead ends: 845 [2018-12-09 19:02:14,437 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-09 19:02:14,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-09 19:02:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-12-09 19:02:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-09 19:02:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2018-12-09 19:02:14,467 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 55 [2018-12-09 19:02:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:14,468 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2018-12-09 19:02:14,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:02:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2018-12-09 19:02:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:02:14,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:14,469 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] [2018-12-09 19:02:14,470 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:14,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash 247485060, now seen corresponding path program 1 times [2018-12-09 19:02:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:14,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:14,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:14,499 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-09 19:02:14,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:14,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:14,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:14,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:14,500 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 5 states. [2018-12-09 19:02:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:14,989 INFO L93 Difference]: Finished difference Result 1397 states and 1954 transitions. [2018-12-09 19:02:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:02:14,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-09 19:02:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:14,992 INFO L225 Difference]: With dead ends: 1397 [2018-12-09 19:02:14,992 INFO L226 Difference]: Without dead ends: 1233 [2018-12-09 19:02:14,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:02:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-09 19:02:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 883. [2018-12-09 19:02:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-12-09 19:02:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1194 transitions. [2018-12-09 19:02:15,030 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1194 transitions. Word has length 61 [2018-12-09 19:02:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:15,030 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1194 transitions. [2018-12-09 19:02:15,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1194 transitions. [2018-12-09 19:02:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 19:02:15,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:15,032 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-09 19:02:15,032 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:15,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2094530933, now seen corresponding path program 1 times [2018-12-09 19:02:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:15,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:15,110 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-09 19:02:15,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:15,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:02:15,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:15,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:02:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:02:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:15,111 INFO L87 Difference]: Start difference. First operand 883 states and 1194 transitions. Second operand 12 states. [2018-12-09 19:02:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:15,295 INFO L93 Difference]: Finished difference Result 909 states and 1222 transitions. [2018-12-09 19:02:15,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:02:15,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-09 19:02:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:15,298 INFO L225 Difference]: With dead ends: 909 [2018-12-09 19:02:15,298 INFO L226 Difference]: Without dead ends: 884 [2018-12-09 19:02:15,299 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-09 19:02:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-12-09 19:02:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2018-12-09 19:02:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-12-09 19:02:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1183 transitions. [2018-12-09 19:02:15,334 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1183 transitions. Word has length 59 [2018-12-09 19:02:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:15,334 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1183 transitions. [2018-12-09 19:02:15,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:02:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1183 transitions. [2018-12-09 19:02:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 19:02:15,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:15,336 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-09 19:02:15,336 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:15,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2018-12-09 19:02:15,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:15,436 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-09 19:02:15,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:15,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:02:15,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:15,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:02:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:02:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:02:15,437 INFO L87 Difference]: Start difference. First operand 882 states and 1183 transitions. Second operand 11 states. [2018-12-09 19:02:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:15,599 INFO L93 Difference]: Finished difference Result 899 states and 1201 transitions. [2018-12-09 19:02:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:02:15,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-09 19:02:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:15,602 INFO L225 Difference]: With dead ends: 899 [2018-12-09 19:02:15,602 INFO L226 Difference]: Without dead ends: 879 [2018-12-09 19:02:15,603 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-09 19:02:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-09 19:02:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-12-09 19:02:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-09 19:02:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1178 transitions. [2018-12-09 19:02:15,638 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1178 transitions. Word has length 58 [2018-12-09 19:02:15,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:15,638 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1178 transitions. [2018-12-09 19:02:15,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:02:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1178 transitions. [2018-12-09 19:02:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 19:02:15,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:15,640 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-09 19:02:15,640 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:15,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2018-12-09 19:02:15,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:15,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:15,692 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-09 19:02:15,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:15,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:02:15,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:15,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:02:15,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:02:15,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:02:15,693 INFO L87 Difference]: Start difference. First operand 879 states and 1178 transitions. Second operand 10 states. [2018-12-09 19:02:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:15,877 INFO L93 Difference]: Finished difference Result 946 states and 1253 transitions. [2018-12-09 19:02:15,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:02:15,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-12-09 19:02:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:15,880 INFO L225 Difference]: With dead ends: 946 [2018-12-09 19:02:15,880 INFO L226 Difference]: Without dead ends: 837 [2018-12-09 19:02:15,881 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-09 19:02:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-12-09 19:02:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 834. [2018-12-09 19:02:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-12-09 19:02:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1097 transitions. [2018-12-09 19:02:15,914 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1097 transitions. Word has length 59 [2018-12-09 19:02:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:15,914 INFO L480 AbstractCegarLoop]: Abstraction has 834 states and 1097 transitions. [2018-12-09 19:02:15,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:02:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1097 transitions. [2018-12-09 19:02:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:02:15,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:15,915 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-09 19:02:15,915 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:15,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2018-12-09 19:02:15,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:15,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:15,935 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-09 19:02:15,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:15,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:02:15,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:15,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:02:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:02:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:02:15,936 INFO L87 Difference]: Start difference. First operand 834 states and 1097 transitions. Second operand 4 states. [2018-12-09 19:02:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:16,044 INFO L93 Difference]: Finished difference Result 987 states and 1310 transitions. [2018-12-09 19:02:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:02:16,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 19:02:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:16,046 INFO L225 Difference]: With dead ends: 987 [2018-12-09 19:02:16,046 INFO L226 Difference]: Without dead ends: 879 [2018-12-09 19:02:16,047 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-09 19:02:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-09 19:02:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 841. [2018-12-09 19:02:16,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-09 19:02:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1112 transitions. [2018-12-09 19:02:16,079 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1112 transitions. Word has length 60 [2018-12-09 19:02:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:16,080 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1112 transitions. [2018-12-09 19:02:16,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:02:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1112 transitions. [2018-12-09 19:02:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 19:02:16,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:16,081 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-09 19:02:16,081 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:16,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2018-12-09 19:02:16,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:16,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:16,131 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-09 19:02:16,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:16,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:02:16,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:16,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:02:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:02:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:02:16,132 INFO L87 Difference]: Start difference. First operand 841 states and 1112 transitions. Second operand 11 states. [2018-12-09 19:02:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:16,210 INFO L93 Difference]: Finished difference Result 910 states and 1203 transitions. [2018-12-09 19:02:16,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:02:16,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-09 19:02:16,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:16,212 INFO L225 Difference]: With dead ends: 910 [2018-12-09 19:02:16,212 INFO L226 Difference]: Without dead ends: 855 [2018-12-09 19:02:16,212 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-09 19:02:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-09 19:02:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 845. [2018-12-09 19:02:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-09 19:02:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1129 transitions. [2018-12-09 19:02:16,244 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1129 transitions. Word has length 60 [2018-12-09 19:02:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:16,245 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1129 transitions. [2018-12-09 19:02:16,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:02:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1129 transitions. [2018-12-09 19:02:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:02:16,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:16,246 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-09 19:02:16,246 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:16,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash -303025806, now seen corresponding path program 1 times [2018-12-09 19:02:16,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:16,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:16,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:16,344 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-09 19:02:16,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:16,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:02:16,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:16,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:02:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:02:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:16,345 INFO L87 Difference]: Start difference. First operand 845 states and 1129 transitions. Second operand 12 states. [2018-12-09 19:02:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:16,510 INFO L93 Difference]: Finished difference Result 869 states and 1154 transitions. [2018-12-09 19:02:16,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:02:16,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-09 19:02:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:16,512 INFO L225 Difference]: With dead ends: 869 [2018-12-09 19:02:16,513 INFO L226 Difference]: Without dead ends: 845 [2018-12-09 19:02:16,513 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-09 19:02:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-09 19:02:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 843. [2018-12-09 19:02:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-12-09 19:02:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1125 transitions. [2018-12-09 19:02:16,566 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1125 transitions. Word has length 66 [2018-12-09 19:02:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:16,566 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1125 transitions. [2018-12-09 19:02:16,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:02:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1125 transitions. [2018-12-09 19:02:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:02:16,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:16,568 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-09 19:02:16,568 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:16,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:16,568 INFO L82 PathProgramCache]: Analyzing trace with hash -340760307, now seen corresponding path program 1 times [2018-12-09 19:02:16,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:16,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:16,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:16,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:16,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:16,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:16,633 INFO L87 Difference]: Start difference. First operand 843 states and 1125 transitions. Second operand 5 states. [2018-12-09 19:02:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:16,813 INFO L93 Difference]: Finished difference Result 877 states and 1165 transitions. [2018-12-09 19:02:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:16,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:02:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:16,815 INFO L225 Difference]: With dead ends: 877 [2018-12-09 19:02:16,815 INFO L226 Difference]: Without dead ends: 850 [2018-12-09 19:02:16,815 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-09 19:02:16,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-09 19:02:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2018-12-09 19:02:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-09 19:02:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1134 transitions. [2018-12-09 19:02:16,872 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1134 transitions. Word has length 67 [2018-12-09 19:02:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:16,872 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1134 transitions. [2018-12-09 19:02:16,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1134 transitions. [2018-12-09 19:02:16,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:02:16,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:16,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:16,873 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:16,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1988119945, now seen corresponding path program 1 times [2018-12-09 19:02:16,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:16,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:16,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:16,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:16,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:16,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:02:16,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:16,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:02:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:02:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:16,942 INFO L87 Difference]: Start difference. First operand 848 states and 1134 transitions. Second operand 12 states. [2018-12-09 19:02:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:17,097 INFO L93 Difference]: Finished difference Result 870 states and 1157 transitions. [2018-12-09 19:02:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:02:17,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-09 19:02:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:17,098 INFO L225 Difference]: With dead ends: 870 [2018-12-09 19:02:17,099 INFO L226 Difference]: Without dead ends: 846 [2018-12-09 19:02:17,099 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-09 19:02:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-12-09 19:02:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2018-12-09 19:02:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-12-09 19:02:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1129 transitions. [2018-12-09 19:02:17,131 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1129 transitions. Word has length 63 [2018-12-09 19:02:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:17,131 INFO L480 AbstractCegarLoop]: Abstraction has 846 states and 1129 transitions. [2018-12-09 19:02:17,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:02:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1129 transitions. [2018-12-09 19:02:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:02:17,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:17,132 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-09 19:02:17,132 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:17,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash 360839567, now seen corresponding path program 1 times [2018-12-09 19:02:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:17,197 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-09 19:02:17,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:02:17,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:02:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:02:17,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:17,197 INFO L87 Difference]: Start difference. First operand 846 states and 1129 transitions. Second operand 12 states. [2018-12-09 19:02:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:17,336 INFO L93 Difference]: Finished difference Result 870 states and 1154 transitions. [2018-12-09 19:02:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:02:17,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-09 19:02:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:17,338 INFO L225 Difference]: With dead ends: 870 [2018-12-09 19:02:17,338 INFO L226 Difference]: Without dead ends: 846 [2018-12-09 19:02:17,339 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-09 19:02:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-12-09 19:02:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2018-12-09 19:02:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-09 19:02:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1125 transitions. [2018-12-09 19:02:17,371 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1125 transitions. Word has length 67 [2018-12-09 19:02:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:17,372 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1125 transitions. [2018-12-09 19:02:17,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:02:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1125 transitions. [2018-12-09 19:02:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:02:17,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:17,373 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-09 19:02:17,373 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:17,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1861861007, now seen corresponding path program 1 times [2018-12-09 19:02:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:17,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:17,432 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-09 19:02:17,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:17,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:02:17,433 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:17,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:02:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:02:17,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:17,434 INFO L87 Difference]: Start difference. First operand 844 states and 1125 transitions. Second operand 12 states. [2018-12-09 19:02:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:17,544 INFO L93 Difference]: Finished difference Result 866 states and 1148 transitions. [2018-12-09 19:02:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:02:17,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-09 19:02:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:17,546 INFO L225 Difference]: With dead ends: 866 [2018-12-09 19:02:17,546 INFO L226 Difference]: Without dead ends: 842 [2018-12-09 19:02:17,547 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-09 19:02:17,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-12-09 19:02:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 837. [2018-12-09 19:02:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-09 19:02:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1113 transitions. [2018-12-09 19:02:17,578 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1113 transitions. Word has length 62 [2018-12-09 19:02:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:17,578 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1113 transitions. [2018-12-09 19:02:17,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:02:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1113 transitions. [2018-12-09 19:02:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:02:17,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:17,580 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-09 19:02:17,580 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:17,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:17,580 INFO L82 PathProgramCache]: Analyzing trace with hash 2111220271, now seen corresponding path program 1 times [2018-12-09 19:02:17,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:17,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:17,604 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-09 19:02:17,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:17,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:17,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:17,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:17,605 INFO L87 Difference]: Start difference. First operand 837 states and 1113 transitions. Second operand 3 states. [2018-12-09 19:02:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:17,632 INFO L93 Difference]: Finished difference Result 1091 states and 1446 transitions. [2018-12-09 19:02:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:17,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-09 19:02:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:17,634 INFO L225 Difference]: With dead ends: 1091 [2018-12-09 19:02:17,634 INFO L226 Difference]: Without dead ends: 779 [2018-12-09 19:02:17,635 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-09 19:02:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-12-09 19:02:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 730. [2018-12-09 19:02:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-12-09 19:02:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 934 transitions. [2018-12-09 19:02:17,663 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 934 transitions. Word has length 62 [2018-12-09 19:02:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:17,663 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 934 transitions. [2018-12-09 19:02:17,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 934 transitions. [2018-12-09 19:02:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:02:17,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:17,664 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-09 19:02:17,664 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:17,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1496662402, now seen corresponding path program 1 times [2018-12-09 19:02:17,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:17,785 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-09 19:02:17,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:17,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:02:17,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:17,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:02:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:02:17,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:02:17,785 INFO L87 Difference]: Start difference. First operand 730 states and 934 transitions. Second operand 13 states. [2018-12-09 19:02:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:17,958 INFO L93 Difference]: Finished difference Result 747 states and 952 transitions. [2018-12-09 19:02:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:02:17,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-09 19:02:17,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:17,960 INFO L225 Difference]: With dead ends: 747 [2018-12-09 19:02:17,960 INFO L226 Difference]: Without dead ends: 719 [2018-12-09 19:02:17,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:02:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-12-09 19:02:17,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2018-12-09 19:02:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-12-09 19:02:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 919 transitions. [2018-12-09 19:02:17,988 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 919 transitions. Word has length 69 [2018-12-09 19:02:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:17,988 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 919 transitions. [2018-12-09 19:02:17,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:02:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 919 transitions. [2018-12-09 19:02:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:02:17,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:17,989 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-09 19:02:17,989 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:17,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:17,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1839036840, now seen corresponding path program 1 times [2018-12-09 19:02:17,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:17,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:17,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:17,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:02:18,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:18,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:02:18,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:02:18,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:02:18,089 INFO L87 Difference]: Start difference. First operand 719 states and 919 transitions. Second operand 13 states. [2018-12-09 19:02:18,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:18,233 INFO L93 Difference]: Finished difference Result 736 states and 937 transitions. [2018-12-09 19:02:18,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:02:18,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-09 19:02:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:18,234 INFO L225 Difference]: With dead ends: 736 [2018-12-09 19:02:18,234 INFO L226 Difference]: Without dead ends: 714 [2018-12-09 19:02:18,235 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-09 19:02:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-09 19:02:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-12-09 19:02:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-12-09 19:02:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 912 transitions. [2018-12-09 19:02:18,282 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 912 transitions. Word has length 63 [2018-12-09 19:02:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:18,282 INFO L480 AbstractCegarLoop]: Abstraction has 714 states and 912 transitions. [2018-12-09 19:02:18,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:02:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 912 transitions. [2018-12-09 19:02:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:02:18,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:18,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] [2018-12-09 19:02:18,283 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:18,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash 81838798, now seen corresponding path program 1 times [2018-12-09 19:02:18,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:18,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:18,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:18,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:18,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:02:18,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:18,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:02:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:02:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:02:18,383 INFO L87 Difference]: Start difference. First operand 714 states and 912 transitions. Second operand 13 states. [2018-12-09 19:02:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:18,544 INFO L93 Difference]: Finished difference Result 731 states and 930 transitions. [2018-12-09 19:02:18,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:02:18,544 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-09 19:02:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:18,546 INFO L225 Difference]: With dead ends: 731 [2018-12-09 19:02:18,546 INFO L226 Difference]: Without dead ends: 706 [2018-12-09 19:02:18,546 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-09 19:02:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-12-09 19:02:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2018-12-09 19:02:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-12-09 19:02:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 902 transitions. [2018-12-09 19:02:18,573 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 902 transitions. Word has length 62 [2018-12-09 19:02:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:18,574 INFO L480 AbstractCegarLoop]: Abstraction has 706 states and 902 transitions. [2018-12-09 19:02:18,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:02:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 902 transitions. [2018-12-09 19:02:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:02:18,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:18,574 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-09 19:02:18,575 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:18,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1762030758, now seen corresponding path program 1 times [2018-12-09 19:02:18,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:18,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:18,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:18,631 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-09 19:02:18,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:18,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:18,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:18,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:18,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:18,632 INFO L87 Difference]: Start difference. First operand 706 states and 902 transitions. Second operand 5 states. [2018-12-09 19:02:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:18,878 INFO L93 Difference]: Finished difference Result 963 states and 1229 transitions. [2018-12-09 19:02:18,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:02:18,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:02:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:18,880 INFO L225 Difference]: With dead ends: 963 [2018-12-09 19:02:18,880 INFO L226 Difference]: Without dead ends: 826 [2018-12-09 19:02:18,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:02:18,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-12-09 19:02:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 747. [2018-12-09 19:02:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-09 19:02:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 953 transitions. [2018-12-09 19:02:18,913 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 953 transitions. Word has length 67 [2018-12-09 19:02:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:18,913 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 953 transitions. [2018-12-09 19:02:18,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 953 transitions. [2018-12-09 19:02:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:02:18,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:18,914 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-09 19:02:18,914 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:18,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:18,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2087229698, now seen corresponding path program 1 times [2018-12-09 19:02:18,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:18,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:18,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:18,931 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-09 19:02:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:18,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:18,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:18,931 INFO L87 Difference]: Start difference. First operand 747 states and 953 transitions. Second operand 3 states. [2018-12-09 19:02:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:18,967 INFO L93 Difference]: Finished difference Result 877 states and 1126 transitions. [2018-12-09 19:02:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:18,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-09 19:02:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:18,969 INFO L225 Difference]: With dead ends: 877 [2018-12-09 19:02:18,969 INFO L226 Difference]: Without dead ends: 747 [2018-12-09 19:02:18,970 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-09 19:02:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-09 19:02:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2018-12-09 19:02:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-09 19:02:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 950 transitions. [2018-12-09 19:02:19,004 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 950 transitions. Word has length 66 [2018-12-09 19:02:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:19,004 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 950 transitions. [2018-12-09 19:02:19,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 950 transitions. [2018-12-09 19:02:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:02:19,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:19,005 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-09 19:02:19,005 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:19,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:19,005 INFO L82 PathProgramCache]: Analyzing trace with hash -322329126, now seen corresponding path program 1 times [2018-12-09 19:02:19,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:19,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:19,038 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-09 19:02:19,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:19,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:19,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:19,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:19,039 INFO L87 Difference]: Start difference. First operand 747 states and 950 transitions. Second operand 5 states. [2018-12-09 19:02:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:19,089 INFO L93 Difference]: Finished difference Result 793 states and 997 transitions. [2018-12-09 19:02:19,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:19,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 19:02:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:19,091 INFO L225 Difference]: With dead ends: 793 [2018-12-09 19:02:19,091 INFO L226 Difference]: Without dead ends: 741 [2018-12-09 19:02:19,092 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-09 19:02:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-12-09 19:02:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2018-12-09 19:02:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-09 19:02:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 940 transitions. [2018-12-09 19:02:19,123 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 940 transitions. Word has length 65 [2018-12-09 19:02:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:19,123 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 940 transitions. [2018-12-09 19:02:19,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 940 transitions. [2018-12-09 19:02:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 19:02:19,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:19,125 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-09 19:02:19,125 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:19,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1568772173, now seen corresponding path program 1 times [2018-12-09 19:02:19,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:19,160 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-09 19:02:19,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:19,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:19,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:19,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:19,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:19,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:19,161 INFO L87 Difference]: Start difference. First operand 741 states and 940 transitions. Second operand 5 states. [2018-12-09 19:02:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:19,205 INFO L93 Difference]: Finished difference Result 775 states and 975 transitions. [2018-12-09 19:02:19,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:19,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 19:02:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:19,207 INFO L225 Difference]: With dead ends: 775 [2018-12-09 19:02:19,207 INFO L226 Difference]: Without dead ends: 736 [2018-12-09 19:02:19,207 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-09 19:02:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-12-09 19:02:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2018-12-09 19:02:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-09 19:02:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 933 transitions. [2018-12-09 19:02:19,237 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 933 transitions. Word has length 67 [2018-12-09 19:02:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:19,237 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 933 transitions. [2018-12-09 19:02:19,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:19,237 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 933 transitions. [2018-12-09 19:02:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:02:19,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:19,238 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-09 19:02:19,238 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:19,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:19,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1402336471, now seen corresponding path program 1 times [2018-12-09 19:02:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:19,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:19,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:19,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:19,268 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:19,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:19,269 INFO L87 Difference]: Start difference. First operand 736 states and 933 transitions. Second operand 5 states. [2018-12-09 19:02:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:19,522 INFO L93 Difference]: Finished difference Result 802 states and 1018 transitions. [2018-12-09 19:02:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:19,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-09 19:02:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:19,523 INFO L225 Difference]: With dead ends: 802 [2018-12-09 19:02:19,523 INFO L226 Difference]: Without dead ends: 793 [2018-12-09 19:02:19,524 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-09 19:02:19,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-09 19:02:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 736. [2018-12-09 19:02:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-09 19:02:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 931 transitions. [2018-12-09 19:02:19,555 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 931 transitions. Word has length 68 [2018-12-09 19:02:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:19,555 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 931 transitions. [2018-12-09 19:02:19,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 931 transitions. [2018-12-09 19:02:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:02:19,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:19,556 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-09 19:02:19,556 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:19,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:19,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1734361953, now seen corresponding path program 1 times [2018-12-09 19:02:19,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:19,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:19,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:02:19,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:19,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:02:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:02:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:02:19,610 INFO L87 Difference]: Start difference. First operand 736 states and 931 transitions. Second operand 7 states. [2018-12-09 19:02:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:19,697 INFO L93 Difference]: Finished difference Result 782 states and 981 transitions. [2018-12-09 19:02:19,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:02:19,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 19:02:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:19,698 INFO L225 Difference]: With dead ends: 782 [2018-12-09 19:02:19,698 INFO L226 Difference]: Without dead ends: 742 [2018-12-09 19:02:19,699 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-09 19:02:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-09 19:02:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-12-09 19:02:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-12-09 19:02:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 935 transitions. [2018-12-09 19:02:19,733 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 935 transitions. Word has length 74 [2018-12-09 19:02:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:19,733 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 935 transitions. [2018-12-09 19:02:19,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:02:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 935 transitions. [2018-12-09 19:02:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:02:19,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:19,734 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-09 19:02:19,734 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:19,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 127484813, now seen corresponding path program 1 times [2018-12-09 19:02:19,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:19,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:19,826 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-09 19:02:19,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:19,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:02:19,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:19,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:02:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:02:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:02:19,827 INFO L87 Difference]: Start difference. First operand 740 states and 935 transitions. Second operand 12 states. [2018-12-09 19:02:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:19,946 INFO L93 Difference]: Finished difference Result 763 states and 959 transitions. [2018-12-09 19:02:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:02:19,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-09 19:02:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:19,948 INFO L225 Difference]: With dead ends: 763 [2018-12-09 19:02:19,948 INFO L226 Difference]: Without dead ends: 740 [2018-12-09 19:02:19,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:02:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-12-09 19:02:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-12-09 19:02:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-12-09 19:02:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 934 transitions. [2018-12-09 19:02:19,979 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 934 transitions. Word has length 70 [2018-12-09 19:02:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:19,979 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 934 transitions. [2018-12-09 19:02:19,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:02:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 934 transitions. [2018-12-09 19:02:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 19:02:19,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:19,980 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-09 19:02:19,980 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:19,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:19,981 INFO L82 PathProgramCache]: Analyzing trace with hash 829084687, now seen corresponding path program 1 times [2018-12-09 19:02:19,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:19,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:19,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:19,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:20,081 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-09 19:02:20,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:20,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:02:20,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:20,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:02:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:02:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:02:20,082 INFO L87 Difference]: Start difference. First operand 740 states and 934 transitions. Second operand 14 states. [2018-12-09 19:02:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:20,214 INFO L93 Difference]: Finished difference Result 764 states and 960 transitions. [2018-12-09 19:02:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:02:20,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-09 19:02:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:20,215 INFO L225 Difference]: With dead ends: 764 [2018-12-09 19:02:20,215 INFO L226 Difference]: Without dead ends: 736 [2018-12-09 19:02:20,216 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-09 19:02:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-12-09 19:02:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2018-12-09 19:02:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-09 19:02:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 928 transitions. [2018-12-09 19:02:20,248 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 928 transitions. Word has length 70 [2018-12-09 19:02:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:20,248 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 928 transitions. [2018-12-09 19:02:20,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:02:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 928 transitions. [2018-12-09 19:02:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:02:20,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:20,250 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-09 19:02:20,250 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:20,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:20,250 INFO L82 PathProgramCache]: Analyzing trace with hash 77291112, now seen corresponding path program 1 times [2018-12-09 19:02:20,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:20,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:20,271 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-09 19:02:20,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:20,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:20,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:20,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:20,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:20,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:20,272 INFO L87 Difference]: Start difference. First operand 736 states and 928 transitions. Second operand 5 states. [2018-12-09 19:02:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:20,321 INFO L93 Difference]: Finished difference Result 770 states and 963 transitions. [2018-12-09 19:02:20,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:20,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 19:02:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:20,323 INFO L225 Difference]: With dead ends: 770 [2018-12-09 19:02:20,323 INFO L226 Difference]: Without dead ends: 731 [2018-12-09 19:02:20,323 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-09 19:02:20,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-09 19:02:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-09 19:02:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-09 19:02:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 921 transitions. [2018-12-09 19:02:20,366 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 921 transitions. Word has length 69 [2018-12-09 19:02:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:20,366 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 921 transitions. [2018-12-09 19:02:20,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 921 transitions. [2018-12-09 19:02:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:02:20,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:20,368 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-09 19:02:20,368 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:20,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1952246579, now seen corresponding path program 1 times [2018-12-09 19:02:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:20,425 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-09 19:02:20,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:20,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:02:20,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:20,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:02:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:02:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:02:20,426 INFO L87 Difference]: Start difference. First operand 731 states and 921 transitions. Second operand 11 states. [2018-12-09 19:02:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:20,509 INFO L93 Difference]: Finished difference Result 758 states and 951 transitions. [2018-12-09 19:02:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:02:20,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-09 19:02:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:20,511 INFO L225 Difference]: With dead ends: 758 [2018-12-09 19:02:20,511 INFO L226 Difference]: Without dead ends: 728 [2018-12-09 19:02:20,511 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-09 19:02:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-09 19:02:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-12-09 19:02:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-09 19:02:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 916 transitions. [2018-12-09 19:02:20,544 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 916 transitions. Word has length 69 [2018-12-09 19:02:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:20,544 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 916 transitions. [2018-12-09 19:02:20,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:02:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 916 transitions. [2018-12-09 19:02:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:02:20,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:20,545 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-09 19:02:20,546 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:20,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083894, now seen corresponding path program 1 times [2018-12-09 19:02:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:20,605 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-09 19:02:20,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:20,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:02:20,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:20,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:02:20,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:02:20,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:02:20,606 INFO L87 Difference]: Start difference. First operand 728 states and 916 transitions. Second operand 11 states. [2018-12-09 19:02:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:20,736 INFO L93 Difference]: Finished difference Result 738 states and 925 transitions. [2018-12-09 19:02:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:02:20,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-09 19:02:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:20,738 INFO L225 Difference]: With dead ends: 738 [2018-12-09 19:02:20,738 INFO L226 Difference]: Without dead ends: 732 [2018-12-09 19:02:20,738 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-09 19:02:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-12-09 19:02:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 725. [2018-12-09 19:02:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-09 19:02:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 909 transitions. [2018-12-09 19:02:20,777 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 909 transitions. Word has length 69 [2018-12-09 19:02:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:20,777 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 909 transitions. [2018-12-09 19:02:20,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:02:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 909 transitions. [2018-12-09 19:02:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:02:20,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:20,778 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-09 19:02:20,778 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:20,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:20,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1163360724, now seen corresponding path program 1 times [2018-12-09 19:02:20,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:20,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:20,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:20,799 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-09 19:02:20,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:20,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:20,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:20,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:20,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:20,800 INFO L87 Difference]: Start difference. First operand 725 states and 909 transitions. Second operand 5 states. [2018-12-09 19:02:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:21,018 INFO L93 Difference]: Finished difference Result 785 states and 988 transitions. [2018-12-09 19:02:21,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:21,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-09 19:02:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:21,019 INFO L225 Difference]: With dead ends: 785 [2018-12-09 19:02:21,019 INFO L226 Difference]: Without dead ends: 750 [2018-12-09 19:02:21,020 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-09 19:02:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-12-09 19:02:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 696. [2018-12-09 19:02:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-09 19:02:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 873 transitions. [2018-12-09 19:02:21,053 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 873 transitions. Word has length 69 [2018-12-09 19:02:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:21,053 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 873 transitions. [2018-12-09 19:02:21,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:21,053 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 873 transitions. [2018-12-09 19:02:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 19:02:21,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:21,054 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-09 19:02:21,054 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:21,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1070160589, now seen corresponding path program 1 times [2018-12-09 19:02:21,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:21,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:21,068 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-09 19:02:21,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:21,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:02:21,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:21,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:02:21,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:02:21,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:02:21,069 INFO L87 Difference]: Start difference. First operand 696 states and 873 transitions. Second operand 3 states. [2018-12-09 19:02:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:21,105 INFO L93 Difference]: Finished difference Result 722 states and 903 transitions. [2018-12-09 19:02:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:02:21,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 19:02:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:21,106 INFO L225 Difference]: With dead ends: 722 [2018-12-09 19:02:21,106 INFO L226 Difference]: Without dead ends: 682 [2018-12-09 19:02:21,107 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-09 19:02:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-09 19:02:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2018-12-09 19:02:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-12-09 19:02:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 848 transitions. [2018-12-09 19:02:21,136 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 848 transitions. Word has length 69 [2018-12-09 19:02:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:21,136 INFO L480 AbstractCegarLoop]: Abstraction has 678 states and 848 transitions. [2018-12-09 19:02:21,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:02:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 848 transitions. [2018-12-09 19:02:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 19:02:21,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:21,137 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-09 19:02:21,137 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:21,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1859005469, now seen corresponding path program 1 times [2018-12-09 19:02:21,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:21,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:21,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:21,217 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-09 19:02:21,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:21,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:02:21,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:21,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:02:21,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:02:21,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:02:21,217 INFO L87 Difference]: Start difference. First operand 678 states and 848 transitions. Second operand 14 states. [2018-12-09 19:02:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:21,345 INFO L93 Difference]: Finished difference Result 700 states and 871 transitions. [2018-12-09 19:02:21,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:02:21,345 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-09 19:02:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:21,346 INFO L225 Difference]: With dead ends: 700 [2018-12-09 19:02:21,347 INFO L226 Difference]: Without dead ends: 668 [2018-12-09 19:02:21,347 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-09 19:02:21,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-12-09 19:02:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2018-12-09 19:02:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-12-09 19:02:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 833 transitions. [2018-12-09 19:02:21,375 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 833 transitions. Word has length 74 [2018-12-09 19:02:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:21,375 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 833 transitions. [2018-12-09 19:02:21,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:02:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 833 transitions. [2018-12-09 19:02:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:02:21,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:21,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:02:21,376 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:21,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash -81188571, now seen corresponding path program 1 times [2018-12-09 19:02:21,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:21,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:21,445 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-09 19:02:21,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:02:21,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:21,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:02:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:02:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:02:21,446 INFO L87 Difference]: Start difference. First operand 668 states and 833 transitions. Second operand 14 states. [2018-12-09 19:02:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:21,564 INFO L93 Difference]: Finished difference Result 732 states and 901 transitions. [2018-12-09 19:02:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:02:21,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-09 19:02:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:21,565 INFO L225 Difference]: With dead ends: 732 [2018-12-09 19:02:21,565 INFO L226 Difference]: Without dead ends: 662 [2018-12-09 19:02:21,565 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-09 19:02:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-12-09 19:02:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2018-12-09 19:02:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-12-09 19:02:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 824 transitions. [2018-12-09 19:02:21,593 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 824 transitions. Word has length 71 [2018-12-09 19:02:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:21,594 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 824 transitions. [2018-12-09 19:02:21,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:02:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 824 transitions. [2018-12-09 19:02:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:02:21,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:21,594 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-09 19:02:21,595 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:21,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash -37760830, now seen corresponding path program 1 times [2018-12-09 19:02:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:21,614 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-09 19:02:21,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:21,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:21,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:21,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:21,615 INFO L87 Difference]: Start difference. First operand 662 states and 824 transitions. Second operand 5 states. [2018-12-09 19:02:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:21,652 INFO L93 Difference]: Finished difference Result 709 states and 873 transitions. [2018-12-09 19:02:21,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:21,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-09 19:02:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:21,653 INFO L225 Difference]: With dead ends: 709 [2018-12-09 19:02:21,653 INFO L226 Difference]: Without dead ends: 666 [2018-12-09 19:02:21,654 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-09 19:02:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-09 19:02:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 662. [2018-12-09 19:02:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-12-09 19:02:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 823 transitions. [2018-12-09 19:02:21,682 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 823 transitions. Word has length 71 [2018-12-09 19:02:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:21,683 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 823 transitions. [2018-12-09 19:02:21,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 823 transitions. [2018-12-09 19:02:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:02:21,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:21,683 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-09 19:02:21,684 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:21,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2013223168, now seen corresponding path program 1 times [2018-12-09 19:02:21,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:21,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:21,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:21,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:02:21,772 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:21,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:02:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:02:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:02:21,773 INFO L87 Difference]: Start difference. First operand 662 states and 823 transitions. Second operand 14 states. [2018-12-09 19:02:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:21,891 INFO L93 Difference]: Finished difference Result 686 states and 849 transitions. [2018-12-09 19:02:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:02:21,892 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-09 19:02:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:21,893 INFO L225 Difference]: With dead ends: 686 [2018-12-09 19:02:21,893 INFO L226 Difference]: Without dead ends: 655 [2018-12-09 19:02:21,893 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-09 19:02:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-09 19:02:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-12-09 19:02:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-12-09 19:02:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 813 transitions. [2018-12-09 19:02:21,921 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 813 transitions. Word has length 71 [2018-12-09 19:02:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:21,921 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 813 transitions. [2018-12-09 19:02:21,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:02:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 813 transitions. [2018-12-09 19:02:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 19:02:21,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:21,922 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-09 19:02:21,922 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:21,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1067828418, now seen corresponding path program 1 times [2018-12-09 19:02:21,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:21,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:21,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:21,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:21,987 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-09 19:02:21,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:21,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:02:21,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:21,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:02:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:02:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:02:21,988 INFO L87 Difference]: Start difference. First operand 655 states and 813 transitions. Second operand 7 states. [2018-12-09 19:02:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:22,061 INFO L93 Difference]: Finished difference Result 709 states and 874 transitions. [2018-12-09 19:02:22,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:02:22,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-09 19:02:22,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:22,063 INFO L225 Difference]: With dead ends: 709 [2018-12-09 19:02:22,063 INFO L226 Difference]: Without dead ends: 653 [2018-12-09 19:02:22,063 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-09 19:02:22,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-12-09 19:02:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2018-12-09 19:02:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-12-09 19:02:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 803 transitions. [2018-12-09 19:02:22,100 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 803 transitions. Word has length 77 [2018-12-09 19:02:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:22,100 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 803 transitions. [2018-12-09 19:02:22,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:02:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 803 transitions. [2018-12-09 19:02:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 19:02:22,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:22,101 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-09 19:02:22,101 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:22,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash -366228544, now seen corresponding path program 1 times [2018-12-09 19:02:22,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:22,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:22,191 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-09 19:02:22,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:22,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:02:22,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:22,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:02:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:02:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:02:22,192 INFO L87 Difference]: Start difference. First operand 649 states and 803 transitions. Second operand 14 states. [2018-12-09 19:02:22,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:22,304 INFO L93 Difference]: Finished difference Result 675 states and 831 transitions. [2018-12-09 19:02:22,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:02:22,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-12-09 19:02:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:22,305 INFO L225 Difference]: With dead ends: 675 [2018-12-09 19:02:22,305 INFO L226 Difference]: Without dead ends: 651 [2018-12-09 19:02:22,305 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-09 19:02:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-09 19:02:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 647. [2018-12-09 19:02:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-12-09 19:02:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 799 transitions. [2018-12-09 19:02:22,333 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 799 transitions. Word has length 77 [2018-12-09 19:02:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:22,333 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 799 transitions. [2018-12-09 19:02:22,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:02:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 799 transitions. [2018-12-09 19:02:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:02:22,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:22,334 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-09 19:02:22,334 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:22,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -615466654, now seen corresponding path program 1 times [2018-12-09 19:02:22,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:22,402 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-09 19:02:22,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:22,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 19:02:22,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:02:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:02:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:02:22,403 INFO L87 Difference]: Start difference. First operand 647 states and 799 transitions. Second operand 14 states. [2018-12-09 19:02:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:22,513 INFO L93 Difference]: Finished difference Result 706 states and 861 transitions. [2018-12-09 19:02:22,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:02:22,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-09 19:02:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:22,514 INFO L225 Difference]: With dead ends: 706 [2018-12-09 19:02:22,514 INFO L226 Difference]: Without dead ends: 635 [2018-12-09 19:02:22,515 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-09 19:02:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-12-09 19:02:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2018-12-09 19:02:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-12-09 19:02:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 780 transitions. [2018-12-09 19:02:22,542 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 780 transitions. Word has length 72 [2018-12-09 19:02:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:22,542 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 780 transitions. [2018-12-09 19:02:22,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:02:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 780 transitions. [2018-12-09 19:02:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 19:02:22,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:22,543 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-09 19:02:22,543 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:22,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2025859791, now seen corresponding path program 1 times [2018-12-09 19:02:22,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:22,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:22,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:22,602 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-09 19:02:22,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:22,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:02:22,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:22,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:02:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:02:22,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:02:22,602 INFO L87 Difference]: Start difference. First operand 635 states and 780 transitions. Second operand 11 states. [2018-12-09 19:02:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:22,683 INFO L93 Difference]: Finished difference Result 826 states and 1007 transitions. [2018-12-09 19:02:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:02:22,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-09 19:02:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:22,684 INFO L225 Difference]: With dead ends: 826 [2018-12-09 19:02:22,684 INFO L226 Difference]: Without dead ends: 677 [2018-12-09 19:02:22,685 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-09 19:02:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-12-09 19:02:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 641. [2018-12-09 19:02:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-09 19:02:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 782 transitions. [2018-12-09 19:02:22,714 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 782 transitions. Word has length 71 [2018-12-09 19:02:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:22,714 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 782 transitions. [2018-12-09 19:02:22,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:02:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 782 transitions. [2018-12-09 19:02:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:02:22,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:22,715 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-09 19:02:22,715 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:22,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash -253233342, now seen corresponding path program 1 times [2018-12-09 19:02:22,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:22,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:22,809 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-09 19:02:22,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:22,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 19:02:22,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:22,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 19:02:22,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 19:02:22,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:02:22,809 INFO L87 Difference]: Start difference. First operand 641 states and 782 transitions. Second operand 13 states. [2018-12-09 19:02:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:22,963 INFO L93 Difference]: Finished difference Result 661 states and 803 transitions. [2018-12-09 19:02:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 19:02:22,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-09 19:02:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:22,965 INFO L225 Difference]: With dead ends: 661 [2018-12-09 19:02:22,965 INFO L226 Difference]: Without dead ends: 639 [2018-12-09 19:02:22,965 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-09 19:02:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-09 19:02:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-12-09 19:02:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-12-09 19:02:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 778 transitions. [2018-12-09 19:02:22,993 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 778 transitions. Word has length 72 [2018-12-09 19:02:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:22,993 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 778 transitions. [2018-12-09 19:02:22,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 19:02:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 778 transitions. [2018-12-09 19:02:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:02:22,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:22,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:22,994 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:22,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:22,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1632556457, now seen corresponding path program 1 times [2018-12-09 19:02:22,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:22,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:22,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:23,054 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-09 19:02:23,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:02:23,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:23,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:02:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:02:23,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:02:23,054 INFO L87 Difference]: Start difference. First operand 639 states and 778 transitions. Second operand 10 states. [2018-12-09 19:02:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:23,918 INFO L93 Difference]: Finished difference Result 1323 states and 1604 transitions. [2018-12-09 19:02:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:02:23,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-09 19:02:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:23,920 INFO L225 Difference]: With dead ends: 1323 [2018-12-09 19:02:23,920 INFO L226 Difference]: Without dead ends: 1176 [2018-12-09 19:02:23,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-09 19:02:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2018-12-09 19:02:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1035. [2018-12-09 19:02:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-12-09 19:02:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1282 transitions. [2018-12-09 19:02:23,967 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1282 transitions. Word has length 73 [2018-12-09 19:02:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:23,967 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1282 transitions. [2018-12-09 19:02:23,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:02:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1282 transitions. [2018-12-09 19:02:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:02:23,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:23,968 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-09 19:02:23,969 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:23,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1983138585, now seen corresponding path program 1 times [2018-12-09 19:02:23,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:23,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:23,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:24,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:24,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:02:24,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:24,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:02:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:02:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:02:24,005 INFO L87 Difference]: Start difference. First operand 1035 states and 1282 transitions. Second operand 6 states. [2018-12-09 19:02:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:24,403 INFO L93 Difference]: Finished difference Result 1321 states and 1596 transitions. [2018-12-09 19:02:24,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:02:24,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-09 19:02:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:24,404 INFO L225 Difference]: With dead ends: 1321 [2018-12-09 19:02:24,404 INFO L226 Difference]: Without dead ends: 1191 [2018-12-09 19:02:24,405 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-09 19:02:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-12-09 19:02:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1115. [2018-12-09 19:02:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-09 19:02:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1373 transitions. [2018-12-09 19:02:24,458 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1373 transitions. Word has length 73 [2018-12-09 19:02:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:24,458 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1373 transitions. [2018-12-09 19:02:24,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:02:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1373 transitions. [2018-12-09 19:02:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:02:24,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:24,459 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-09 19:02:24,459 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:24,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1013991573, now seen corresponding path program 1 times [2018-12-09 19:02:24,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:24,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:24,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:24,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:24,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:02:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:02:24,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:02:24,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:02:24,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:02:24,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:02:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:02:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:02:24,480 INFO L87 Difference]: Start difference. First operand 1115 states and 1373 transitions. Second operand 5 states. [2018-12-09 19:02:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:02:24,535 INFO L93 Difference]: Finished difference Result 1160 states and 1421 transitions. [2018-12-09 19:02:24,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:02:24,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 19:02:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:02:24,537 INFO L225 Difference]: With dead ends: 1160 [2018-12-09 19:02:24,537 INFO L226 Difference]: Without dead ends: 1099 [2018-12-09 19:02:24,537 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-09 19:02:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-12-09 19:02:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2018-12-09 19:02:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2018-12-09 19:02:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1349 transitions. [2018-12-09 19:02:24,589 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1349 transitions. Word has length 73 [2018-12-09 19:02:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:02:24,589 INFO L480 AbstractCegarLoop]: Abstraction has 1099 states and 1349 transitions. [2018-12-09 19:02:24,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:02:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1349 transitions. [2018-12-09 19:02:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 19:02:24,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:02:24,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:02:24,590 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:02:24,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:02:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1533375131, now seen corresponding path program 1 times [2018-12-09 19:02:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:02:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:24,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:02:24,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:02:24,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:02:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:02:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:02:24,633 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:02:24,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:02:24 BoogieIcfgContainer [2018-12-09 19:02:24,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:02:24,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:02:24,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:02:24,711 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:02:24,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:02:07" (3/4) ... [2018-12-09 19:02:24,713 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:02:24,784 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8ec90142-21c2-480e-853f-50b45a79d1b7/bin-2019/utaipan/witness.graphml [2018-12-09 19:02:24,785 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:02:24,785 INFO L168 Benchmark]: Toolchain (without parser) took 18840.11 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 686.3 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -205.1 MB). Peak memory consumption was 481.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:02:24,786 INFO L168 Benchmark]: CDTParser took 0.12 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-09 19:02:24,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:02:24,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:02:24,786 INFO L168 Benchmark]: Boogie Preprocessor took 40.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:02:24,786 INFO L168 Benchmark]: RCFGBuilder took 753.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 930.5 MB in the end (delta: 149.7 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:02:24,787 INFO L168 Benchmark]: TraceAbstraction took 17596.40 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 583.0 MB). Free memory was 930.5 MB in the beginning and 1.2 GB in the end (delta: -240.1 MB). Peak memory consumption was 342.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:02:24,787 INFO L168 Benchmark]: Witness Printer took 73.27 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-09 19:02:24,788 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.12 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 353.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 753.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 930.5 MB in the end (delta: 149.7 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17596.40 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 583.0 MB). Free memory was 930.5 MB in the beginning and 1.2 GB in the end (delta: -240.1 MB). Peak memory consumption was 342.9 MB. Max. memory is 11.5 GB. * Witness Printer took 73.27 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 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, 17.5s OverallTime, 67 OverallIterations, 1 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39240 SDtfs, 17818 SDslu, 166302 SDs, 0 SdLazy, 14169 SolverSat, 2941 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1115occurred in iteration=65, 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.2s AutomataMinimizationTime, 66 MinimizatonAttempts, 2286 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3948 NumberOfCodeBlocks, 3948 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3809 ConstructedInterpolants, 0 QuantifiedInterpolants, 502683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 66 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...