./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_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/config/AutomizerReach.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_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c60fa6dcffe947607e07f04cc37f17d0aae2288e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:22:19,460 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:22:19,461 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:22:19,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:22:19,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:22:19,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:22:19,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:22:19,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:22:19,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:22:19,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:22:19,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:22:19,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:22:19,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:22:19,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:22:19,476 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:22:19,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:22:19,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:22:19,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:22:19,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:22:19,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:22:19,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:22:19,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:22:19,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:22:19,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:22:19,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:22:19,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:22:19,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:22:19,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:22:19,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:22:19,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:22:19,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:22:19,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:22:19,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:22:19,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:22:19,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:22:19,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:22:19,486 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 23:22:19,492 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:22:19,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:22:19,493 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:22:19,493 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:22:19,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 23:22:19,494 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 23:22:19,494 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 23:22:19,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:22:19,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:22:19,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:22:19,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:22:19,495 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 23:22:19,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:22:19,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:22:19,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:22:19,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:22:19,496 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:22:19,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:22:19,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:22:19,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:22:19,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:22:19,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 23:22:19,497 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:22:19,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:22:19,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60fa6dcffe947607e07f04cc37f17d0aae2288e [2018-12-02 23:22:19,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:22:19,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:22:19,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:22:19,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:22:19,529 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:22:19,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 23:22:19,566 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/data/77cc3e5e4/c78ff684cc984faca84c3fab8f0fb8b1/FLAGfc48d1267 [2018-12-02 23:22:19,917 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:22:19,917 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 23:22:19,927 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/data/77cc3e5e4/c78ff684cc984faca84c3fab8f0fb8b1/FLAGfc48d1267 [2018-12-02 23:22:20,309 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/data/77cc3e5e4/c78ff684cc984faca84c3fab8f0fb8b1 [2018-12-02 23:22:20,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:22:20,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:22:20,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:22:20,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:22:20,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:22:20,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342d1c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20, skipping insertion in model container [2018-12-02 23:22:20,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:22:20,349 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:22:20,545 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:22:20,548 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:22:20,650 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:22:20,662 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:22:20,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20 WrapperNode [2018-12-02 23:22:20,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:22:20,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:22:20,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:22:20,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:22:20,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:22:20,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:22:20,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:22:20,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:22:20,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... [2018-12-02 23:22:20,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:22:20,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:22:20,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:22:20,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:22:20,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:22:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-02 23:22:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-02 23:22:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-02 23:22:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-02 23:22:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-02 23:22:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-02 23:22:20,760 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-02 23:22:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-02 23:22:20,761 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-02 23:22:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-02 23:22:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-02 23:22:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-02 23:22:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-02 23:22:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-02 23:22:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-02 23:22:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-02 23:22:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-02 23:22:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-02 23:22:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-02 23:22:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 23:22:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 23:22:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-02 23:22:20,763 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-02 23:22:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-02 23:22:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-02 23:22:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:22:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:22:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-02 23:22:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-02 23:22:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-02 23:22:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-02 23:22:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-02 23:22:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-02 23:22:20,764 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-02 23:22:20,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-02 23:22:20,971 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:20,971 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,016 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,016 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,060 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,060 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,099 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,099 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,129 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,129 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,219 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,219 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,253 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,253 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,268 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,268 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,392 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 23:22:21,392 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 23:22:21,404 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:22:21,404 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 23:22:21,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:22:21 BoogieIcfgContainer [2018-12-02 23:22:21,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:22:21,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:22:21,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:22:21,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:22:21,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:22:20" (1/3) ... [2018-12-02 23:22:21,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153bc11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:22:21, skipping insertion in model container [2018-12-02 23:22:21,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:22:20" (2/3) ... [2018-12-02 23:22:21,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153bc11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:22:21, skipping insertion in model container [2018-12-02 23:22:21,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:22:21" (3/3) ... [2018-12-02 23:22:21,409 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-02 23:22:21,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:22:21,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 23:22:21,431 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 23:22:21,452 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 23:22:21,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:22:21,453 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:22:21,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:22:21,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:22:21,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:22:21,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:22:21,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:22:21,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:22:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2018-12-02 23:22:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 23:22:21,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:21,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:21,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:21,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2018-12-02 23:22:21,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:21,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:21,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:21,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:21,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-02 23:22:21,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:21,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:21,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:21,627 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2018-12-02 23:22:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:21,748 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2018-12-02 23:22:21,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:21,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 23:22:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:21,758 INFO L225 Difference]: With dead ends: 891 [2018-12-02 23:22:21,758 INFO L226 Difference]: Without dead ends: 509 [2018-12-02 23:22:21,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-02 23:22:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-12-02 23:22:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-02 23:22:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2018-12-02 23:22:21,811 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2018-12-02 23:22:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:21,811 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2018-12-02 23:22:21,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2018-12-02 23:22:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 23:22:21,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:21,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:21,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:21,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2018-12-02 23:22:21,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:21,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:21,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:21,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:21,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:21,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:21,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:21,902 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2018-12-02 23:22:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:22,084 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2018-12-02 23:22:22,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:22,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 23:22:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:22,090 INFO L225 Difference]: With dead ends: 795 [2018-12-02 23:22:22,090 INFO L226 Difference]: Without dead ends: 674 [2018-12-02 23:22:22,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-12-02 23:22:22,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2018-12-02 23:22:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-12-02 23:22:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2018-12-02 23:22:22,124 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2018-12-02 23:22:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:22,125 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2018-12-02 23:22:22,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2018-12-02 23:22:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 23:22:22,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:22,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:22,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:22,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash 880506904, now seen corresponding path program 1 times [2018-12-02 23:22:22,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:22,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:22,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:22,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:22,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:22,188 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2018-12-02 23:22:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:22,215 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2018-12-02 23:22:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:22,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 23:22:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:22,218 INFO L225 Difference]: With dead ends: 1001 [2018-12-02 23:22:22,218 INFO L226 Difference]: Without dead ends: 823 [2018-12-02 23:22:22,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-02 23:22:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2018-12-02 23:22:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-02 23:22:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2018-12-02 23:22:22,240 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2018-12-02 23:22:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:22,240 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2018-12-02 23:22:22,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2018-12-02 23:22:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 23:22:22,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:22,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:22,242 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:22,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2133514060, now seen corresponding path program 1 times [2018-12-02 23:22:22,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:22,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:22,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:22,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:22,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:22,268 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2018-12-02 23:22:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:22,374 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2018-12-02 23:22:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:22,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 23:22:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:22,377 INFO L225 Difference]: With dead ends: 1430 [2018-12-02 23:22:22,378 INFO L226 Difference]: Without dead ends: 1164 [2018-12-02 23:22:22,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-12-02 23:22:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2018-12-02 23:22:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 23:22:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-12-02 23:22:22,406 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2018-12-02 23:22:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-12-02 23:22:22,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-12-02 23:22:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 23:22:22,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:22,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:22,408 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:22,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1952820015, now seen corresponding path program 1 times [2018-12-02 23:22:22,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:22,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:22,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:22,460 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-12-02 23:22:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:22,959 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2018-12-02 23:22:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:22:22,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-02 23:22:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:22,963 INFO L225 Difference]: With dead ends: 1570 [2018-12-02 23:22:22,963 INFO L226 Difference]: Without dead ends: 990 [2018-12-02 23:22:22,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:22:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-12-02 23:22:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2018-12-02 23:22:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-02 23:22:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2018-12-02 23:22:23,001 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2018-12-02 23:22:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,001 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2018-12-02 23:22:23,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2018-12-02 23:22:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:22:23,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:23,002 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash -950761943, now seen corresponding path program 1 times [2018-12-02 23:22:23,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:23,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:23,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:23,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,031 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2018-12-02 23:22:23,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:23,096 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2018-12-02 23:22:23,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:23,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:22:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:23,099 INFO L225 Difference]: With dead ends: 892 [2018-12-02 23:22:23,099 INFO L226 Difference]: Without dead ends: 888 [2018-12-02 23:22:23,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-02 23:22:23,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-02 23:22:23,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 23:22:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2018-12-02 23:22:23,123 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2018-12-02 23:22:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,123 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2018-12-02 23:22:23,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2018-12-02 23:22:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 23:22:23,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:23,124 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash -826026373, now seen corresponding path program 1 times [2018-12-02 23:22:23,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:23,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,152 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2018-12-02 23:22:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:23,190 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2018-12-02 23:22:23,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:23,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-02 23:22:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:23,193 INFO L225 Difference]: With dead ends: 1280 [2018-12-02 23:22:23,193 INFO L226 Difference]: Without dead ends: 1019 [2018-12-02 23:22:23,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-02 23:22:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2018-12-02 23:22:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-12-02 23:22:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2018-12-02 23:22:23,220 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2018-12-02 23:22:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,220 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2018-12-02 23:22:23,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2018-12-02 23:22:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 23:22:23,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:23,221 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2018-12-02 23:22:23,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:23,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,256 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2018-12-02 23:22:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:23,304 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2018-12-02 23:22:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:23,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-02 23:22:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:23,307 INFO L225 Difference]: With dead ends: 976 [2018-12-02 23:22:23,307 INFO L226 Difference]: Without dead ends: 956 [2018-12-02 23:22:23,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-12-02 23:22:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2018-12-02 23:22:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-02 23:22:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2018-12-02 23:22:23,336 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2018-12-02 23:22:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,336 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2018-12-02 23:22:23,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2018-12-02 23:22:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 23:22:23,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:23,339 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 215600759, now seen corresponding path program 1 times [2018-12-02 23:22:23,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:23,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,376 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2018-12-02 23:22:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:23,421 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2018-12-02 23:22:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:23,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 23:22:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:23,426 INFO L225 Difference]: With dead ends: 1175 [2018-12-02 23:22:23,426 INFO L226 Difference]: Without dead ends: 933 [2018-12-02 23:22:23,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-02 23:22:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-12-02 23:22:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-02 23:22:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2018-12-02 23:22:23,467 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2018-12-02 23:22:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,467 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2018-12-02 23:22:23,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2018-12-02 23:22:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 23:22:23,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,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] [2018-12-02 23:22:23,469 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash -564668473, now seen corresponding path program 1 times [2018-12-02 23:22:23,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:22:23,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:22:23,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:22:23,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:22:23,508 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2018-12-02 23:22:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:23,750 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2018-12-02 23:22:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:22:23,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-02 23:22:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:23,752 INFO L225 Difference]: With dead ends: 1022 [2018-12-02 23:22:23,753 INFO L226 Difference]: Without dead ends: 793 [2018-12-02 23:22:23,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:22:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-02 23:22:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2018-12-02 23:22:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-02 23:22:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2018-12-02 23:22:23,782 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2018-12-02 23:22:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,782 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2018-12-02 23:22:23,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:22:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2018-12-02 23:22:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 23:22:23,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:23,784 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2018-12-02 23:22:23,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:23,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,814 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2018-12-02 23:22:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:23,860 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2018-12-02 23:22:23,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:23,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-02 23:22:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:23,864 INFO L225 Difference]: With dead ends: 879 [2018-12-02 23:22:23,864 INFO L226 Difference]: Without dead ends: 783 [2018-12-02 23:22:23,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-02 23:22:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2018-12-02 23:22:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-12-02 23:22:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2018-12-02 23:22:23,907 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2018-12-02 23:22:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:23,908 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2018-12-02 23:22:23,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2018-12-02 23:22:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 23:22:23,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:23,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:23,909 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:23,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2018-12-02 23:22:23,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:23,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:23,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:23,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:23,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:23,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:23,933 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2018-12-02 23:22:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:24,020 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2018-12-02 23:22:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-02 23:22:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:24,023 INFO L225 Difference]: With dead ends: 957 [2018-12-02 23:22:24,023 INFO L226 Difference]: Without dead ends: 943 [2018-12-02 23:22:24,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-02 23:22:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2018-12-02 23:22:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-02 23:22:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2018-12-02 23:22:24,050 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2018-12-02 23:22:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:24,050 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2018-12-02 23:22:24,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2018-12-02 23:22:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 23:22:24,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:24,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:24,052 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:24,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:24,052 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2018-12-02 23:22:24,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:24,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:24,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:24,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:22:24,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:22:24,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:22:24,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:22:24,108 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2018-12-02 23:22:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:24,205 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2018-12-02 23:22:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:22:24,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 23:22:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:24,209 INFO L225 Difference]: With dead ends: 863 [2018-12-02 23:22:24,209 INFO L226 Difference]: Without dead ends: 859 [2018-12-02 23:22:24,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:22:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-12-02 23:22:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2018-12-02 23:22:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-02 23:22:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2018-12-02 23:22:24,256 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2018-12-02 23:22:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:24,256 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2018-12-02 23:22:24,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:22:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2018-12-02 23:22:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 23:22:24,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:24,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:24,258 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:24,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2018-12-02 23:22:24,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:24,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:24,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:24,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 23:22:24,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 23:22:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:22:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:22:24,319 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2018-12-02 23:22:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:24,388 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2018-12-02 23:22:24,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:22:24,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-02 23:22:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:24,392 INFO L225 Difference]: With dead ends: 898 [2018-12-02 23:22:24,392 INFO L226 Difference]: Without dead ends: 877 [2018-12-02 23:22:24,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:22:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-12-02 23:22:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2018-12-02 23:22:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-02 23:22:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2018-12-02 23:22:24,426 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2018-12-02 23:22:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:24,426 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2018-12-02 23:22:24,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 23:22:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2018-12-02 23:22:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 23:22:24,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:24,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:24,428 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:24,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2018-12-02 23:22:24,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:24,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:24,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:24,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:22:24,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:22:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:22:24,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:22:24,448 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2018-12-02 23:22:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:24,507 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2018-12-02 23:22:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:22:24,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-02 23:22:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:24,510 INFO L225 Difference]: With dead ends: 901 [2018-12-02 23:22:24,510 INFO L226 Difference]: Without dead ends: 879 [2018-12-02 23:22:24,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-02 23:22:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2018-12-02 23:22:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-02 23:22:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2018-12-02 23:22:24,537 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2018-12-02 23:22:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:24,537 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2018-12-02 23:22:24,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:22:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2018-12-02 23:22:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 23:22:24,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:24,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:24,539 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:24,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:24,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2018-12-02 23:22:24,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:24,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:24,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:24,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:24,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:22:24,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:22:24,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:22:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:22:24,573 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2018-12-02 23:22:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:25,238 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2018-12-02 23:22:25,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:22:25,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-02 23:22:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:25,241 INFO L225 Difference]: With dead ends: 1088 [2018-12-02 23:22:25,241 INFO L226 Difference]: Without dead ends: 997 [2018-12-02 23:22:25,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-12-02 23:22:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2018-12-02 23:22:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-02 23:22:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2018-12-02 23:22:25,273 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2018-12-02 23:22:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2018-12-02 23:22:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:22:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2018-12-02 23:22:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 23:22:25,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:25,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:25,275 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:25,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2018-12-02 23:22:25,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:25,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:25,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:25,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:25,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:25,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:25,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:25,301 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2018-12-02 23:22:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:25,387 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2018-12-02 23:22:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:25,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 23:22:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:25,389 INFO L225 Difference]: With dead ends: 1038 [2018-12-02 23:22:25,389 INFO L226 Difference]: Without dead ends: 998 [2018-12-02 23:22:25,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-12-02 23:22:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2018-12-02 23:22:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-02 23:22:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2018-12-02 23:22:25,423 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2018-12-02 23:22:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:25,423 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2018-12-02 23:22:25,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2018-12-02 23:22:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 23:22:25,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:25,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:25,425 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:25,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2018-12-02 23:22:25,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:25,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:25,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:25,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:22:25,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:22:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:22:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:22:25,488 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 9 states. [2018-12-02 23:22:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:26,472 INFO L93 Difference]: Finished difference Result 1211 states and 1672 transitions. [2018-12-02 23:22:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 23:22:26,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-02 23:22:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:26,475 INFO L225 Difference]: With dead ends: 1211 [2018-12-02 23:22:26,475 INFO L226 Difference]: Without dead ends: 1142 [2018-12-02 23:22:26,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-12-02 23:22:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-12-02 23:22:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 902. [2018-12-02 23:22:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-12-02 23:22:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1225 transitions. [2018-12-02 23:22:26,509 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1225 transitions. Word has length 50 [2018-12-02 23:22:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:26,509 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1225 transitions. [2018-12-02 23:22:26,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:22:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1225 transitions. [2018-12-02 23:22:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 23:22:26,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:26,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:26,511 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:26,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2018-12-02 23:22:26,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:26,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:26,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:26,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:26,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:26,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:26,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:26,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:26,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:26,533 INFO L87 Difference]: Start difference. First operand 902 states and 1225 transitions. Second operand 3 states. [2018-12-02 23:22:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:26,592 INFO L93 Difference]: Finished difference Result 930 states and 1257 transitions. [2018-12-02 23:22:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:26,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 23:22:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:26,595 INFO L225 Difference]: With dead ends: 930 [2018-12-02 23:22:26,595 INFO L226 Difference]: Without dead ends: 925 [2018-12-02 23:22:26,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-02 23:22:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 919. [2018-12-02 23:22:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-02 23:22:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1246 transitions. [2018-12-02 23:22:26,652 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1246 transitions. Word has length 52 [2018-12-02 23:22:26,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:26,652 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1246 transitions. [2018-12-02 23:22:26,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1246 transitions. [2018-12-02 23:22:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 23:22:26,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:26,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:26,655 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:26,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2018-12-02 23:22:26,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:26,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:26,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:26,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:26,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:26,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:26,684 INFO L87 Difference]: Start difference. First operand 919 states and 1246 transitions. Second operand 3 states. [2018-12-02 23:22:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:26,761 INFO L93 Difference]: Finished difference Result 1135 states and 1537 transitions. [2018-12-02 23:22:26,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:26,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-02 23:22:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:26,763 INFO L225 Difference]: With dead ends: 1135 [2018-12-02 23:22:26,763 INFO L226 Difference]: Without dead ends: 888 [2018-12-02 23:22:26,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:26,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-02 23:22:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-02 23:22:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 23:22:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1206 transitions. [2018-12-02 23:22:26,796 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1206 transitions. Word has length 54 [2018-12-02 23:22:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:26,796 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1206 transitions. [2018-12-02 23:22:26,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1206 transitions. [2018-12-02 23:22:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 23:22:26,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:26,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:26,797 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:26,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2018-12-02 23:22:26,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:26,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:26,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:26,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:26,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:26,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:26,837 INFO L87 Difference]: Start difference. First operand 888 states and 1206 transitions. Second operand 5 states. [2018-12-02 23:22:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:27,120 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-12-02 23:22:27,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:27,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 23:22:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:27,122 INFO L225 Difference]: With dead ends: 900 [2018-12-02 23:22:27,122 INFO L226 Difference]: Without dead ends: 894 [2018-12-02 23:22:27,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-02 23:22:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2018-12-02 23:22:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-02 23:22:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1205 transitions. [2018-12-02 23:22:27,164 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1205 transitions. Word has length 53 [2018-12-02 23:22:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:27,165 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1205 transitions. [2018-12-02 23:22:27,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1205 transitions. [2018-12-02 23:22:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 23:22:27,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:27,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:27,166 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:27,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2018-12-02 23:22:27,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:27,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:27,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:27,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:27,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:27,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:27,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:27,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:27,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:27,196 INFO L87 Difference]: Start difference. First operand 888 states and 1205 transitions. Second operand 5 states. [2018-12-02 23:22:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:27,497 INFO L93 Difference]: Finished difference Result 903 states and 1220 transitions. [2018-12-02 23:22:27,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:27,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-02 23:22:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:27,500 INFO L225 Difference]: With dead ends: 903 [2018-12-02 23:22:27,500 INFO L226 Difference]: Without dead ends: 867 [2018-12-02 23:22:27,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-02 23:22:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 861. [2018-12-02 23:22:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-02 23:22:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1175 transitions. [2018-12-02 23:22:27,552 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1175 transitions. Word has length 52 [2018-12-02 23:22:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:27,552 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1175 transitions. [2018-12-02 23:22:27,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1175 transitions. [2018-12-02 23:22:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 23:22:27,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:27,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:27,554 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:27,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2018-12-02 23:22:27,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:27,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:27,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:27,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:27,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:27,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:27,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:27,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:27,596 INFO L87 Difference]: Start difference. First operand 861 states and 1175 transitions. Second operand 5 states. [2018-12-02 23:22:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:27,900 INFO L93 Difference]: Finished difference Result 871 states and 1183 transitions. [2018-12-02 23:22:27,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:27,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 23:22:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:27,902 INFO L225 Difference]: With dead ends: 871 [2018-12-02 23:22:27,902 INFO L226 Difference]: Without dead ends: 865 [2018-12-02 23:22:27,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-02 23:22:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2018-12-02 23:22:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-02 23:22:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2018-12-02 23:22:27,943 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 54 [2018-12-02 23:22:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:27,943 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2018-12-02 23:22:27,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2018-12-02 23:22:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 23:22:27,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:27,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:27,946 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:27,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2018-12-02 23:22:27,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:27,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:27,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:27,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:28,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:28,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 23:22:28,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 23:22:28,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:22:28,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:22:28,011 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2018-12-02 23:22:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:28,143 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2018-12-02 23:22:28,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:22:28,143 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-02 23:22:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:28,145 INFO L225 Difference]: With dead ends: 888 [2018-12-02 23:22:28,145 INFO L226 Difference]: Without dead ends: 852 [2018-12-02 23:22:28,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-12-02 23:22:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2018-12-02 23:22:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-12-02 23:22:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2018-12-02 23:22:28,195 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2018-12-02 23:22:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:28,195 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2018-12-02 23:22:28,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 23:22:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2018-12-02 23:22:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 23:22:28,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:28,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:28,196 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:28,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:28,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1728183236, now seen corresponding path program 1 times [2018-12-02 23:22:28,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:28,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:28,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:28,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:28,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:28,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:22:28,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:22:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:22:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:22:28,272 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2018-12-02 23:22:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:28,462 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2018-12-02 23:22:28,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 23:22:28,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-02 23:22:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:28,466 INFO L225 Difference]: With dead ends: 868 [2018-12-02 23:22:28,466 INFO L226 Difference]: Without dead ends: 850 [2018-12-02 23:22:28,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:28,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-02 23:22:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-12-02 23:22:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-12-02 23:22:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2018-12-02 23:22:28,522 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 56 [2018-12-02 23:22:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:28,522 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2018-12-02 23:22:28,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:22:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2018-12-02 23:22:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 23:22:28,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:28,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:28,525 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:28,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1135140490, now seen corresponding path program 1 times [2018-12-02 23:22:28,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:28,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-02 23:22:28,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:28,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:22:28,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:22:28,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:22:28,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:22:28,605 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2018-12-02 23:22:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:28,744 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2018-12-02 23:22:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 23:22:28,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-02 23:22:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:28,746 INFO L225 Difference]: With dead ends: 863 [2018-12-02 23:22:28,746 INFO L226 Difference]: Without dead ends: 845 [2018-12-02 23:22:28,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-02 23:22:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-12-02 23:22:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-02 23:22:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2018-12-02 23:22:28,778 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 55 [2018-12-02 23:22:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:28,778 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2018-12-02 23:22:28,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:22:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2018-12-02 23:22:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 23:22:28,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:28,779 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-02 23:22:28,780 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:28,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash 247485060, now seen corresponding path program 1 times [2018-12-02 23:22:28,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:28,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:28,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:28,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:28,819 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 5 states. [2018-12-02 23:22:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:29,273 INFO L93 Difference]: Finished difference Result 1397 states and 1954 transitions. [2018-12-02 23:22:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:22:29,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-02 23:22:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:29,275 INFO L225 Difference]: With dead ends: 1397 [2018-12-02 23:22:29,275 INFO L226 Difference]: Without dead ends: 1233 [2018-12-02 23:22:29,276 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-02 23:22:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-02 23:22:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 883. [2018-12-02 23:22:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-12-02 23:22:29,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1194 transitions. [2018-12-02 23:22:29,325 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1194 transitions. Word has length 61 [2018-12-02 23:22:29,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:29,325 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1194 transitions. [2018-12-02 23:22:29,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1194 transitions. [2018-12-02 23:22:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:22:29,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:29,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:29,326 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:29,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2094530933, now seen corresponding path program 1 times [2018-12-02 23:22:29,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:29,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:29,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:29,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:29,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:29,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 23:22:29,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:22:29,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:22:29,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:29,422 INFO L87 Difference]: Start difference. First operand 883 states and 1194 transitions. Second operand 12 states. [2018-12-02 23:22:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:29,595 INFO L93 Difference]: Finished difference Result 909 states and 1222 transitions. [2018-12-02 23:22:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:22:29,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-02 23:22:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:29,598 INFO L225 Difference]: With dead ends: 909 [2018-12-02 23:22:29,598 INFO L226 Difference]: Without dead ends: 884 [2018-12-02 23:22:29,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:22:29,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-12-02 23:22:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2018-12-02 23:22:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-12-02 23:22:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1183 transitions. [2018-12-02 23:22:29,633 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1183 transitions. Word has length 59 [2018-12-02 23:22:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:29,633 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1183 transitions. [2018-12-02 23:22:29,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:22:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1183 transitions. [2018-12-02 23:22:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 23:22:29,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:29,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:29,635 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:29,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:29,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2018-12-02 23:22:29,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:29,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:29,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:29,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:29,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:29,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:22:29,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:22:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:22:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:29,722 INFO L87 Difference]: Start difference. First operand 882 states and 1183 transitions. Second operand 11 states. [2018-12-02 23:22:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:29,906 INFO L93 Difference]: Finished difference Result 899 states and 1201 transitions. [2018-12-02 23:22:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:22:29,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-02 23:22:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:29,907 INFO L225 Difference]: With dead ends: 899 [2018-12-02 23:22:29,908 INFO L226 Difference]: Without dead ends: 879 [2018-12-02 23:22:29,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-02 23:22:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-12-02 23:22:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-02 23:22:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1178 transitions. [2018-12-02 23:22:29,941 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1178 transitions. Word has length 58 [2018-12-02 23:22:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:29,941 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1178 transitions. [2018-12-02 23:22:29,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:22:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1178 transitions. [2018-12-02 23:22:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 23:22:29,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:29,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:29,942 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:29,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2018-12-02 23:22:29,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:22:30,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:22:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:22:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:22:30,018 INFO L87 Difference]: Start difference. First operand 879 states and 1178 transitions. Second operand 10 states. [2018-12-02 23:22:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:30,206 INFO L93 Difference]: Finished difference Result 946 states and 1253 transitions. [2018-12-02 23:22:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:22:30,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-12-02 23:22:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:30,208 INFO L225 Difference]: With dead ends: 946 [2018-12-02 23:22:30,208 INFO L226 Difference]: Without dead ends: 837 [2018-12-02 23:22:30,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-12-02 23:22:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 834. [2018-12-02 23:22:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-12-02 23:22:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1097 transitions. [2018-12-02 23:22:30,240 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1097 transitions. Word has length 59 [2018-12-02 23:22:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:30,240 INFO L480 AbstractCegarLoop]: Abstraction has 834 states and 1097 transitions. [2018-12-02 23:22:30,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:22:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1097 transitions. [2018-12-02 23:22:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:22:30,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:30,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:30,241 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:30,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2018-12-02 23:22:30,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:30,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:30,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:30,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:22:30,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:22:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:22:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:22:30,257 INFO L87 Difference]: Start difference. First operand 834 states and 1097 transitions. Second operand 4 states. [2018-12-02 23:22:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:30,376 INFO L93 Difference]: Finished difference Result 987 states and 1310 transitions. [2018-12-02 23:22:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:22:30,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-02 23:22:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:30,378 INFO L225 Difference]: With dead ends: 987 [2018-12-02 23:22:30,379 INFO L226 Difference]: Without dead ends: 879 [2018-12-02 23:22:30,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-02 23:22:30,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 841. [2018-12-02 23:22:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-02 23:22:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1112 transitions. [2018-12-02 23:22:30,412 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1112 transitions. Word has length 60 [2018-12-02 23:22:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:30,412 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1112 transitions. [2018-12-02 23:22:30,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:22:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1112 transitions. [2018-12-02 23:22:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 23:22:30,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:30,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:30,413 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:30,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2018-12-02 23:22:30,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:30,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:30,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:30,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:22:30,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:22:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:22:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:30,499 INFO L87 Difference]: Start difference. First operand 841 states and 1112 transitions. Second operand 11 states. [2018-12-02 23:22:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:30,605 INFO L93 Difference]: Finished difference Result 910 states and 1203 transitions. [2018-12-02 23:22:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:22:30,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-02 23:22:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:30,608 INFO L225 Difference]: With dead ends: 910 [2018-12-02 23:22:30,608 INFO L226 Difference]: Without dead ends: 855 [2018-12-02 23:22:30,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-02 23:22:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 845. [2018-12-02 23:22:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-02 23:22:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1129 transitions. [2018-12-02 23:22:30,663 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1129 transitions. Word has length 60 [2018-12-02 23:22:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:30,663 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1129 transitions. [2018-12-02 23:22:30,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:22:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1129 transitions. [2018-12-02 23:22:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 23:22:30,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:30,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:30,665 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -340760307, now seen corresponding path program 1 times [2018-12-02 23:22:30,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:30,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:30,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:30,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:30,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:30,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:30,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:30,725 INFO L87 Difference]: Start difference. First operand 845 states and 1129 transitions. Second operand 5 states. [2018-12-02 23:22:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:30,857 INFO L93 Difference]: Finished difference Result 880 states and 1171 transitions. [2018-12-02 23:22:30,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:30,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 23:22:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:30,860 INFO L225 Difference]: With dead ends: 880 [2018-12-02 23:22:30,860 INFO L226 Difference]: Without dead ends: 852 [2018-12-02 23:22:30,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-12-02 23:22:30,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 850. [2018-12-02 23:22:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-12-02 23:22:30,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1138 transitions. [2018-12-02 23:22:30,917 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1138 transitions. Word has length 67 [2018-12-02 23:22:30,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:30,917 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1138 transitions. [2018-12-02 23:22:30,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:30,917 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1138 transitions. [2018-12-02 23:22:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 23:22:30,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:30,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:30,918 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:30,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:30,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1988119945, now seen corresponding path program 1 times [2018-12-02 23:22:30,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:30,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:31,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:31,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 23:22:31,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:22:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:22:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:31,003 INFO L87 Difference]: Start difference. First operand 850 states and 1138 transitions. Second operand 12 states. [2018-12-02 23:22:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:31,191 INFO L93 Difference]: Finished difference Result 872 states and 1161 transitions. [2018-12-02 23:22:31,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:22:31,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-02 23:22:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:31,193 INFO L225 Difference]: With dead ends: 872 [2018-12-02 23:22:31,193 INFO L226 Difference]: Without dead ends: 848 [2018-12-02 23:22:31,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:22:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-12-02 23:22:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2018-12-02 23:22:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-02 23:22:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1133 transitions. [2018-12-02 23:22:31,234 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1133 transitions. Word has length 63 [2018-12-02 23:22:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:31,234 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1133 transitions. [2018-12-02 23:22:31,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:22:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1133 transitions. [2018-12-02 23:22:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 23:22:31,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:31,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:31,235 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:31,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1861861007, now seen corresponding path program 1 times [2018-12-02 23:22:31,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:31,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 23:22:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:22:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:22:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:31,318 INFO L87 Difference]: Start difference. First operand 848 states and 1133 transitions. Second operand 12 states. [2018-12-02 23:22:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:31,504 INFO L93 Difference]: Finished difference Result 872 states and 1158 transitions. [2018-12-02 23:22:31,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:22:31,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-02 23:22:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:31,506 INFO L225 Difference]: With dead ends: 872 [2018-12-02 23:22:31,506 INFO L226 Difference]: Without dead ends: 848 [2018-12-02 23:22:31,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:22:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-12-02 23:22:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2018-12-02 23:22:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-12-02 23:22:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1129 transitions. [2018-12-02 23:22:31,553 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1129 transitions. Word has length 62 [2018-12-02 23:22:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:31,553 INFO L480 AbstractCegarLoop]: Abstraction has 846 states and 1129 transitions. [2018-12-02 23:22:31,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:22:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1129 transitions. [2018-12-02 23:22:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 23:22:31,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:31,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:31,555 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:31,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2111220271, now seen corresponding path program 1 times [2018-12-02 23:22:31,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:31,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:31,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:31,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:31,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:31,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:31,570 INFO L87 Difference]: Start difference. First operand 846 states and 1129 transitions. Second operand 3 states. [2018-12-02 23:22:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:31,598 INFO L93 Difference]: Finished difference Result 1105 states and 1470 transitions. [2018-12-02 23:22:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:31,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-02 23:22:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:31,600 INFO L225 Difference]: With dead ends: 1105 [2018-12-02 23:22:31,601 INFO L226 Difference]: Without dead ends: 788 [2018-12-02 23:22:31,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-12-02 23:22:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 739. [2018-12-02 23:22:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-12-02 23:22:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 950 transitions. [2018-12-02 23:22:31,631 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 950 transitions. Word has length 62 [2018-12-02 23:22:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:31,631 INFO L480 AbstractCegarLoop]: Abstraction has 739 states and 950 transitions. [2018-12-02 23:22:31,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 950 transitions. [2018-12-02 23:22:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 23:22:31,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:31,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:31,632 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:31,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:31,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1839036840, now seen corresponding path program 1 times [2018-12-02 23:22:31,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:31,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:31,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:31,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:31,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:31,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 23:22:31,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 23:22:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:22:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:31,742 INFO L87 Difference]: Start difference. First operand 739 states and 950 transitions. Second operand 13 states. [2018-12-02 23:22:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:31,911 INFO L93 Difference]: Finished difference Result 756 states and 968 transitions. [2018-12-02 23:22:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:22:31,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-02 23:22:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:31,913 INFO L225 Difference]: With dead ends: 756 [2018-12-02 23:22:31,913 INFO L226 Difference]: Without dead ends: 734 [2018-12-02 23:22:31,913 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-02 23:22:31,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-12-02 23:22:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-12-02 23:22:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-12-02 23:22:31,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 943 transitions. [2018-12-02 23:22:31,940 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 943 transitions. Word has length 63 [2018-12-02 23:22:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:31,940 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 943 transitions. [2018-12-02 23:22:31,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 23:22:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 943 transitions. [2018-12-02 23:22:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 23:22:31,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:31,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:31,941 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:31,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash 81838798, now seen corresponding path program 1 times [2018-12-02 23:22:31,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:31,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:31,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:31,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:32,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:32,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 23:22:32,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 23:22:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:22:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:32,029 INFO L87 Difference]: Start difference. First operand 734 states and 943 transitions. Second operand 13 states. [2018-12-02 23:22:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:32,197 INFO L93 Difference]: Finished difference Result 751 states and 961 transitions. [2018-12-02 23:22:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:22:32,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-02 23:22:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:32,198 INFO L225 Difference]: With dead ends: 751 [2018-12-02 23:22:32,198 INFO L226 Difference]: Without dead ends: 726 [2018-12-02 23:22:32,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:22:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-12-02 23:22:32,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-12-02 23:22:32,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 23:22:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 933 transitions. [2018-12-02 23:22:32,227 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 933 transitions. Word has length 62 [2018-12-02 23:22:32,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:32,227 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 933 transitions. [2018-12-02 23:22:32,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 23:22:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 933 transitions. [2018-12-02 23:22:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 23:22:32,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:32,228 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:32,228 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:32,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash 690825617, now seen corresponding path program 1 times [2018-12-02 23:22:32,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:32,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:32,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:32,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:32,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:32,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:32,255 INFO L87 Difference]: Start difference. First operand 726 states and 933 transitions. Second operand 5 states. [2018-12-02 23:22:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:32,496 INFO L93 Difference]: Finished difference Result 1047 states and 1340 transitions. [2018-12-02 23:22:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:32,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-12-02 23:22:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:32,498 INFO L225 Difference]: With dead ends: 1047 [2018-12-02 23:22:32,498 INFO L226 Difference]: Without dead ends: 715 [2018-12-02 23:22:32,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-12-02 23:22:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2018-12-02 23:22:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-12-02 23:22:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 909 transitions. [2018-12-02 23:22:32,530 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 909 transitions. Word has length 79 [2018-12-02 23:22:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:32,530 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 909 transitions. [2018-12-02 23:22:32,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 909 transitions. [2018-12-02 23:22:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 23:22:32,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:32,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:32,532 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:32,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:32,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1762030758, now seen corresponding path program 1 times [2018-12-02 23:22:32,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:32,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:32,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:32,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:32,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-02 23:22:32,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:32,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:32,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:32,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:32,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:32,572 INFO L87 Difference]: Start difference. First operand 715 states and 909 transitions. Second operand 5 states. [2018-12-02 23:22:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:32,858 INFO L93 Difference]: Finished difference Result 900 states and 1134 transitions. [2018-12-02 23:22:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:22:32,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 23:22:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:32,860 INFO L225 Difference]: With dead ends: 900 [2018-12-02 23:22:32,860 INFO L226 Difference]: Without dead ends: 817 [2018-12-02 23:22:32,860 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-02 23:22:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-12-02 23:22:32,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 746. [2018-12-02 23:22:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-12-02 23:22:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 948 transitions. [2018-12-02 23:22:32,893 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 948 transitions. Word has length 67 [2018-12-02 23:22:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:32,893 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 948 transitions. [2018-12-02 23:22:32,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 948 transitions. [2018-12-02 23:22:32,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:22:32,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:32,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:32,894 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:32,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:32,894 INFO L82 PathProgramCache]: Analyzing trace with hash -2087229698, now seen corresponding path program 1 times [2018-12-02 23:22:32,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:32,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:32,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:32,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-02 23:22:32,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:32,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:32,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:32,917 INFO L87 Difference]: Start difference. First operand 746 states and 948 transitions. Second operand 3 states. [2018-12-02 23:22:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:32,957 INFO L93 Difference]: Finished difference Result 866 states and 1104 transitions. [2018-12-02 23:22:32,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:32,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-02 23:22:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:32,959 INFO L225 Difference]: With dead ends: 866 [2018-12-02 23:22:32,959 INFO L226 Difference]: Without dead ends: 746 [2018-12-02 23:22:32,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-02 23:22:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2018-12-02 23:22:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-12-02 23:22:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 945 transitions. [2018-12-02 23:22:32,993 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 945 transitions. Word has length 66 [2018-12-02 23:22:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:32,993 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 945 transitions. [2018-12-02 23:22:32,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 945 transitions. [2018-12-02 23:22:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 23:22:32,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:32,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:32,994 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:32,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash 360839567, now seen corresponding path program 1 times [2018-12-02 23:22:32,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:32,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:32,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:33,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:33,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 23:22:33,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:22:33,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:22:33,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:33,057 INFO L87 Difference]: Start difference. First operand 746 states and 945 transitions. Second operand 12 states. [2018-12-02 23:22:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:33,184 INFO L93 Difference]: Finished difference Result 770 states and 970 transitions. [2018-12-02 23:22:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:22:33,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-02 23:22:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:33,186 INFO L225 Difference]: With dead ends: 770 [2018-12-02 23:22:33,186 INFO L226 Difference]: Without dead ends: 746 [2018-12-02 23:22:33,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:22:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-02 23:22:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-02 23:22:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-02 23:22:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 941 transitions. [2018-12-02 23:22:33,219 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 941 transitions. Word has length 67 [2018-12-02 23:22:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:33,219 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 941 transitions. [2018-12-02 23:22:33,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:22:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 941 transitions. [2018-12-02 23:22:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 23:22:33,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:33,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:33,220 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:33,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash 398574068, now seen corresponding path program 1 times [2018-12-02 23:22:33,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:33,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:33,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 23:22:33,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:22:33,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:22:33,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:33,279 INFO L87 Difference]: Start difference. First operand 744 states and 941 transitions. Second operand 12 states. [2018-12-02 23:22:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:33,398 INFO L93 Difference]: Finished difference Result 766 states and 964 transitions. [2018-12-02 23:22:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:22:33,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-02 23:22:33,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:33,399 INFO L225 Difference]: With dead ends: 766 [2018-12-02 23:22:33,399 INFO L226 Difference]: Without dead ends: 742 [2018-12-02 23:22:33,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-12-02 23:22:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-02 23:22:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 737. [2018-12-02 23:22:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-12-02 23:22:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 929 transitions. [2018-12-02 23:22:33,430 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 929 transitions. Word has length 66 [2018-12-02 23:22:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:33,430 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 929 transitions. [2018-12-02 23:22:33,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:22:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 929 transitions. [2018-12-02 23:22:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 23:22:33,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:33,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:33,431 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:33,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash -322329126, now seen corresponding path program 1 times [2018-12-02 23:22:33,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:33,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:33,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:33,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:33,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:33,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:33,454 INFO L87 Difference]: Start difference. First operand 737 states and 929 transitions. Second operand 5 states. [2018-12-02 23:22:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:33,495 INFO L93 Difference]: Finished difference Result 783 states and 976 transitions. [2018-12-02 23:22:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:33,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-02 23:22:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:33,497 INFO L225 Difference]: With dead ends: 783 [2018-12-02 23:22:33,497 INFO L226 Difference]: Without dead ends: 731 [2018-12-02 23:22:33,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-02 23:22:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-02 23:22:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-02 23:22:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 919 transitions. [2018-12-02 23:22:33,528 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 919 transitions. Word has length 65 [2018-12-02 23:22:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:33,528 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 919 transitions. [2018-12-02 23:22:33,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 919 transitions. [2018-12-02 23:22:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 23:22:33,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:33,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:33,529 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:33,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:33,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1568772173, now seen corresponding path program 1 times [2018-12-02 23:22:33,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:33,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:33,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:33,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:33,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:33,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:33,547 INFO L87 Difference]: Start difference. First operand 731 states and 919 transitions. Second operand 5 states. [2018-12-02 23:22:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:33,595 INFO L93 Difference]: Finished difference Result 765 states and 954 transitions. [2018-12-02 23:22:33,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:33,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 23:22:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:33,597 INFO L225 Difference]: With dead ends: 765 [2018-12-02 23:22:33,597 INFO L226 Difference]: Without dead ends: 726 [2018-12-02 23:22:33,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-12-02 23:22:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2018-12-02 23:22:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 23:22:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 912 transitions. [2018-12-02 23:22:33,629 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 912 transitions. Word has length 67 [2018-12-02 23:22:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:33,630 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 912 transitions. [2018-12-02 23:22:33,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 912 transitions. [2018-12-02 23:22:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 23:22:33,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:33,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:33,631 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:33,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:33,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1402336471, now seen corresponding path program 1 times [2018-12-02 23:22:33,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:33,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:33,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:33,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:33,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:33,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:33,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:33,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:33,652 INFO L87 Difference]: Start difference. First operand 726 states and 912 transitions. Second operand 5 states. [2018-12-02 23:22:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:33,881 INFO L93 Difference]: Finished difference Result 792 states and 996 transitions. [2018-12-02 23:22:33,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:33,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-02 23:22:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:33,883 INFO L225 Difference]: With dead ends: 792 [2018-12-02 23:22:33,883 INFO L226 Difference]: Without dead ends: 783 [2018-12-02 23:22:33,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-02 23:22:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 726. [2018-12-02 23:22:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 23:22:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 910 transitions. [2018-12-02 23:22:33,926 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 910 transitions. Word has length 68 [2018-12-02 23:22:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:33,926 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 910 transitions. [2018-12-02 23:22:33,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 910 transitions. [2018-12-02 23:22:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:22:33,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:33,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:33,927 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:33,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash -253233342, now seen corresponding path program 1 times [2018-12-02 23:22:33,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:34,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:34,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 23:22:34,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 23:22:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:22:34,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:34,024 INFO L87 Difference]: Start difference. First operand 726 states and 910 transitions. Second operand 13 states. [2018-12-02 23:22:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:34,225 INFO L93 Difference]: Finished difference Result 746 states and 931 transitions. [2018-12-02 23:22:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:22:34,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-02 23:22:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:34,227 INFO L225 Difference]: With dead ends: 746 [2018-12-02 23:22:34,227 INFO L226 Difference]: Without dead ends: 724 [2018-12-02 23:22:34,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:22:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-12-02 23:22:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-12-02 23:22:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-02 23:22:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 906 transitions. [2018-12-02 23:22:34,262 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 906 transitions. Word has length 72 [2018-12-02 23:22:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:34,262 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 906 transitions. [2018-12-02 23:22:34,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 23:22:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 906 transitions. [2018-12-02 23:22:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 23:22:34,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:34,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:34,263 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:34,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1496662402, now seen corresponding path program 1 times [2018-12-02 23:22:34,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:34,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:34,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 23:22:34,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 23:22:34,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:22:34,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:34,352 INFO L87 Difference]: Start difference. First operand 724 states and 906 transitions. Second operand 13 states. [2018-12-02 23:22:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:34,515 INFO L93 Difference]: Finished difference Result 741 states and 924 transitions. [2018-12-02 23:22:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 23:22:34,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-02 23:22:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:34,516 INFO L225 Difference]: With dead ends: 741 [2018-12-02 23:22:34,516 INFO L226 Difference]: Without dead ends: 713 [2018-12-02 23:22:34,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:22:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-12-02 23:22:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2018-12-02 23:22:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-12-02 23:22:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 891 transitions. [2018-12-02 23:22:34,548 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 891 transitions. Word has length 69 [2018-12-02 23:22:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:34,549 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 891 transitions. [2018-12-02 23:22:34,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 23:22:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 891 transitions. [2018-12-02 23:22:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 23:22:34,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:34,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:34,549 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:34,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash 127484813, now seen corresponding path program 1 times [2018-12-02 23:22:34,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:34,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:34,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:34,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 23:22:34,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 23:22:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:22:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:22:34,622 INFO L87 Difference]: Start difference. First operand 713 states and 891 transitions. Second operand 12 states. [2018-12-02 23:22:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:34,746 INFO L93 Difference]: Finished difference Result 741 states and 923 transitions. [2018-12-02 23:22:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:22:34,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-02 23:22:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:34,748 INFO L225 Difference]: With dead ends: 741 [2018-12-02 23:22:34,748 INFO L226 Difference]: Without dead ends: 718 [2018-12-02 23:22:34,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:22:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-12-02 23:22:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2018-12-02 23:22:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-12-02 23:22:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 898 transitions. [2018-12-02 23:22:34,781 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 898 transitions. Word has length 70 [2018-12-02 23:22:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:34,781 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 898 transitions. [2018-12-02 23:22:34,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 23:22:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 898 transitions. [2018-12-02 23:22:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 23:22:34,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:34,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:34,782 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:34,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1734361953, now seen corresponding path program 1 times [2018-12-02 23:22:34,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:34,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:34,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:22:34,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:22:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:22:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:22:34,833 INFO L87 Difference]: Start difference. First operand 718 states and 898 transitions. Second operand 7 states. [2018-12-02 23:22:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:34,916 INFO L93 Difference]: Finished difference Result 764 states and 945 transitions. [2018-12-02 23:22:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:22:34,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 23:22:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:34,917 INFO L225 Difference]: With dead ends: 764 [2018-12-02 23:22:34,917 INFO L226 Difference]: Without dead ends: 719 [2018-12-02 23:22:34,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:22:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-12-02 23:22:34,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 717. [2018-12-02 23:22:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-12-02 23:22:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 894 transitions. [2018-12-02 23:22:34,950 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 894 transitions. Word has length 74 [2018-12-02 23:22:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:34,951 INFO L480 AbstractCegarLoop]: Abstraction has 717 states and 894 transitions. [2018-12-02 23:22:34,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:22:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 894 transitions. [2018-12-02 23:22:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 23:22:34,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:34,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:34,952 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:34,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:34,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1859005469, now seen corresponding path program 1 times [2018-12-02 23:22:34,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:34,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:34,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:35,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 23:22:35,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:22:35,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:22:35,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:22:35,022 INFO L87 Difference]: Start difference. First operand 717 states and 894 transitions. Second operand 14 states. [2018-12-02 23:22:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:35,145 INFO L93 Difference]: Finished difference Result 739 states and 917 transitions. [2018-12-02 23:22:35,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:22:35,145 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-02 23:22:35,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:35,146 INFO L225 Difference]: With dead ends: 739 [2018-12-02 23:22:35,146 INFO L226 Difference]: Without dead ends: 707 [2018-12-02 23:22:35,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:22:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-12-02 23:22:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2018-12-02 23:22:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-12-02 23:22:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 879 transitions. [2018-12-02 23:22:35,181 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 879 transitions. Word has length 74 [2018-12-02 23:22:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:35,181 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 879 transitions. [2018-12-02 23:22:35,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:22:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 879 transitions. [2018-12-02 23:22:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 23:22:35,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:35,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:35,183 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:35,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:35,183 INFO L82 PathProgramCache]: Analyzing trace with hash 829084687, now seen corresponding path program 1 times [2018-12-02 23:22:35,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:35,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:35,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:35,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 23:22:35,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:22:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:22:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:22:35,259 INFO L87 Difference]: Start difference. First operand 707 states and 879 transitions. Second operand 14 states. [2018-12-02 23:22:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:35,399 INFO L93 Difference]: Finished difference Result 731 states and 905 transitions. [2018-12-02 23:22:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:22:35,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-02 23:22:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:35,400 INFO L225 Difference]: With dead ends: 731 [2018-12-02 23:22:35,400 INFO L226 Difference]: Without dead ends: 703 [2018-12-02 23:22:35,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:22:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-12-02 23:22:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2018-12-02 23:22:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-12-02 23:22:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 873 transitions. [2018-12-02 23:22:35,432 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 873 transitions. Word has length 70 [2018-12-02 23:22:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:35,432 INFO L480 AbstractCegarLoop]: Abstraction has 703 states and 873 transitions. [2018-12-02 23:22:35,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:22:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 873 transitions. [2018-12-02 23:22:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 23:22:35,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:35,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:35,433 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:35,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash 77291112, now seen corresponding path program 1 times [2018-12-02 23:22:35,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:35,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:35,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:35,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:35,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:35,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:35,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:35,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:35,452 INFO L87 Difference]: Start difference. First operand 703 states and 873 transitions. Second operand 5 states. [2018-12-02 23:22:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:35,493 INFO L93 Difference]: Finished difference Result 737 states and 908 transitions. [2018-12-02 23:22:35,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:35,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 23:22:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:35,494 INFO L225 Difference]: With dead ends: 737 [2018-12-02 23:22:35,494 INFO L226 Difference]: Without dead ends: 698 [2018-12-02 23:22:35,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-02 23:22:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2018-12-02 23:22:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-12-02 23:22:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 866 transitions. [2018-12-02 23:22:35,525 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 866 transitions. Word has length 69 [2018-12-02 23:22:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:35,525 INFO L480 AbstractCegarLoop]: Abstraction has 698 states and 866 transitions. [2018-12-02 23:22:35,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 866 transitions. [2018-12-02 23:22:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 23:22:35,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:35,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:35,526 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:35,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:35,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1952246579, now seen corresponding path program 1 times [2018-12-02 23:22:35,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:35,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:35,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:35,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:22:35,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:22:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:22:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:35,583 INFO L87 Difference]: Start difference. First operand 698 states and 866 transitions. Second operand 11 states. [2018-12-02 23:22:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:35,673 INFO L93 Difference]: Finished difference Result 725 states and 896 transitions. [2018-12-02 23:22:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:22:35,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 23:22:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:35,675 INFO L225 Difference]: With dead ends: 725 [2018-12-02 23:22:35,675 INFO L226 Difference]: Without dead ends: 695 [2018-12-02 23:22:35,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-02 23:22:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2018-12-02 23:22:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-12-02 23:22:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 861 transitions. [2018-12-02 23:22:35,707 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 861 transitions. Word has length 69 [2018-12-02 23:22:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:35,707 INFO L480 AbstractCegarLoop]: Abstraction has 695 states and 861 transitions. [2018-12-02 23:22:35,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:22:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 861 transitions. [2018-12-02 23:22:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 23:22:35,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:35,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:35,708 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:35,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:35,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083894, now seen corresponding path program 1 times [2018-12-02 23:22:35,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:35,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:35,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:35,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:22:35,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:22:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:22:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:35,806 INFO L87 Difference]: Start difference. First operand 695 states and 861 transitions. Second operand 11 states. [2018-12-02 23:22:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:35,937 INFO L93 Difference]: Finished difference Result 705 states and 870 transitions. [2018-12-02 23:22:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:22:35,937 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-02 23:22:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:35,938 INFO L225 Difference]: With dead ends: 705 [2018-12-02 23:22:35,938 INFO L226 Difference]: Without dead ends: 699 [2018-12-02 23:22:35,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-02 23:22:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 692. [2018-12-02 23:22:35,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-12-02 23:22:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 854 transitions. [2018-12-02 23:22:35,969 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 854 transitions. Word has length 69 [2018-12-02 23:22:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:35,969 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 854 transitions. [2018-12-02 23:22:35,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:22:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 854 transitions. [2018-12-02 23:22:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 23:22:35,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:35,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:35,970 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:35,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1163360724, now seen corresponding path program 1 times [2018-12-02 23:22:35,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:35,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:35,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:35,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:35,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:35,992 INFO L87 Difference]: Start difference. First operand 692 states and 854 transitions. Second operand 5 states. [2018-12-02 23:22:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:36,207 INFO L93 Difference]: Finished difference Result 752 states and 932 transitions. [2018-12-02 23:22:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:36,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 23:22:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:36,208 INFO L225 Difference]: With dead ends: 752 [2018-12-02 23:22:36,208 INFO L226 Difference]: Without dead ends: 717 [2018-12-02 23:22:36,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-12-02 23:22:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 663. [2018-12-02 23:22:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-12-02 23:22:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 818 transitions. [2018-12-02 23:22:36,239 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 818 transitions. Word has length 69 [2018-12-02 23:22:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:36,239 INFO L480 AbstractCegarLoop]: Abstraction has 663 states and 818 transitions. [2018-12-02 23:22:36,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 818 transitions. [2018-12-02 23:22:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 23:22:36,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:36,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:36,240 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:36,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:36,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1070160589, now seen corresponding path program 1 times [2018-12-02 23:22:36,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:36,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:36,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:36,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:22:36,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:22:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:22:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:36,253 INFO L87 Difference]: Start difference. First operand 663 states and 818 transitions. Second operand 3 states. [2018-12-02 23:22:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:36,295 INFO L93 Difference]: Finished difference Result 689 states and 848 transitions. [2018-12-02 23:22:36,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:22:36,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 23:22:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:36,296 INFO L225 Difference]: With dead ends: 689 [2018-12-02 23:22:36,296 INFO L226 Difference]: Without dead ends: 649 [2018-12-02 23:22:36,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:22:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-12-02 23:22:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 645. [2018-12-02 23:22:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-12-02 23:22:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 793 transitions. [2018-12-02 23:22:36,325 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 793 transitions. Word has length 69 [2018-12-02 23:22:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:36,326 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 793 transitions. [2018-12-02 23:22:36,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:22:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 793 transitions. [2018-12-02 23:22:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 23:22:36,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:36,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:36,327 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:36,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash -81188571, now seen corresponding path program 1 times [2018-12-02 23:22:36,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:36,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-02 23:22:36,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:36,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 23:22:36,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:22:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:22:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:22:36,413 INFO L87 Difference]: Start difference. First operand 645 states and 793 transitions. Second operand 14 states. [2018-12-02 23:22:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:36,524 INFO L93 Difference]: Finished difference Result 709 states and 861 transitions. [2018-12-02 23:22:36,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:22:36,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-02 23:22:36,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:36,525 INFO L225 Difference]: With dead ends: 709 [2018-12-02 23:22:36,525 INFO L226 Difference]: Without dead ends: 639 [2018-12-02 23:22:36,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:22:36,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-02 23:22:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-12-02 23:22:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-12-02 23:22:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 784 transitions. [2018-12-02 23:22:36,555 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 784 transitions. Word has length 71 [2018-12-02 23:22:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:36,555 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 784 transitions. [2018-12-02 23:22:36,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:22:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 784 transitions. [2018-12-02 23:22:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 23:22:36,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:36,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] [2018-12-02 23:22:36,556 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:36,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash -37760830, now seen corresponding path program 1 times [2018-12-02 23:22:36,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:36,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:36,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:36,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:36,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:36,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:36,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:36,576 INFO L87 Difference]: Start difference. First operand 639 states and 784 transitions. Second operand 5 states. [2018-12-02 23:22:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:36,612 INFO L93 Difference]: Finished difference Result 686 states and 833 transitions. [2018-12-02 23:22:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:36,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-02 23:22:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:36,613 INFO L225 Difference]: With dead ends: 686 [2018-12-02 23:22:36,613 INFO L226 Difference]: Without dead ends: 643 [2018-12-02 23:22:36,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-12-02 23:22:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 639. [2018-12-02 23:22:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-12-02 23:22:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 783 transitions. [2018-12-02 23:22:36,645 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 783 transitions. Word has length 71 [2018-12-02 23:22:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:36,646 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 783 transitions. [2018-12-02 23:22:36,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 783 transitions. [2018-12-02 23:22:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 23:22:36,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:36,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:36,646 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:36,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2013223168, now seen corresponding path program 1 times [2018-12-02 23:22:36,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:36,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:36,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:36,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 23:22:36,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:22:36,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:22:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:22:36,749 INFO L87 Difference]: Start difference. First operand 639 states and 783 transitions. Second operand 14 states. [2018-12-02 23:22:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:36,894 INFO L93 Difference]: Finished difference Result 663 states and 809 transitions. [2018-12-02 23:22:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:22:36,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-02 23:22:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:36,895 INFO L225 Difference]: With dead ends: 663 [2018-12-02 23:22:36,895 INFO L226 Difference]: Without dead ends: 632 [2018-12-02 23:22:36,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:22:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-12-02 23:22:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2018-12-02 23:22:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-12-02 23:22:36,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 773 transitions. [2018-12-02 23:22:36,926 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 773 transitions. Word has length 71 [2018-12-02 23:22:36,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:36,926 INFO L480 AbstractCegarLoop]: Abstraction has 632 states and 773 transitions. [2018-12-02 23:22:36,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:22:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 773 transitions. [2018-12-02 23:22:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 23:22:36,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:36,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:36,928 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:36,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1067828418, now seen corresponding path program 1 times [2018-12-02 23:22:36,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:36,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:36,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:36,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:36,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 23:22:36,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 23:22:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:22:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:22:36,973 INFO L87 Difference]: Start difference. First operand 632 states and 773 transitions. Second operand 7 states. [2018-12-02 23:22:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:37,045 INFO L93 Difference]: Finished difference Result 686 states and 834 transitions. [2018-12-02 23:22:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:22:37,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-02 23:22:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:37,046 INFO L225 Difference]: With dead ends: 686 [2018-12-02 23:22:37,046 INFO L226 Difference]: Without dead ends: 630 [2018-12-02 23:22:37,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:22:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-12-02 23:22:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 626. [2018-12-02 23:22:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-12-02 23:22:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 763 transitions. [2018-12-02 23:22:37,075 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 763 transitions. Word has length 77 [2018-12-02 23:22:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:37,075 INFO L480 AbstractCegarLoop]: Abstraction has 626 states and 763 transitions. [2018-12-02 23:22:37,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 23:22:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 763 transitions. [2018-12-02 23:22:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 23:22:37,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:37,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:37,076 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:37,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:37,076 INFO L82 PathProgramCache]: Analyzing trace with hash -615466654, now seen corresponding path program 1 times [2018-12-02 23:22:37,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:37,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:37,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:37,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 23:22:37,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 23:22:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 23:22:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-02 23:22:37,143 INFO L87 Difference]: Start difference. First operand 626 states and 763 transitions. Second operand 14 states. [2018-12-02 23:22:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:37,260 INFO L93 Difference]: Finished difference Result 685 states and 825 transitions. [2018-12-02 23:22:37,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:22:37,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-02 23:22:37,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:37,261 INFO L225 Difference]: With dead ends: 685 [2018-12-02 23:22:37,261 INFO L226 Difference]: Without dead ends: 614 [2018-12-02 23:22:37,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-12-02 23:22:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-12-02 23:22:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2018-12-02 23:22:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-12-02 23:22:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 744 transitions. [2018-12-02 23:22:37,289 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 744 transitions. Word has length 72 [2018-12-02 23:22:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:37,289 INFO L480 AbstractCegarLoop]: Abstraction has 614 states and 744 transitions. [2018-12-02 23:22:37,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 23:22:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 744 transitions. [2018-12-02 23:22:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 23:22:37,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:37,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:37,290 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:37,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2025859791, now seen corresponding path program 1 times [2018-12-02 23:22:37,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:37,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:37,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 23:22:37,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 23:22:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:22:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:22:37,363 INFO L87 Difference]: Start difference. First operand 614 states and 744 transitions. Second operand 11 states. [2018-12-02 23:22:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:37,445 INFO L93 Difference]: Finished difference Result 795 states and 954 transitions. [2018-12-02 23:22:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:22:37,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-02 23:22:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:37,446 INFO L225 Difference]: With dead ends: 795 [2018-12-02 23:22:37,446 INFO L226 Difference]: Without dead ends: 656 [2018-12-02 23:22:37,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:22:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-12-02 23:22:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 620. [2018-12-02 23:22:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-12-02 23:22:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 746 transitions. [2018-12-02 23:22:37,475 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 746 transitions. Word has length 71 [2018-12-02 23:22:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:37,475 INFO L480 AbstractCegarLoop]: Abstraction has 620 states and 746 transitions. [2018-12-02 23:22:37,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 23:22:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 746 transitions. [2018-12-02 23:22:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 23:22:37,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:37,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:37,476 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:37,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1632556457, now seen corresponding path program 1 times [2018-12-02 23:22:37,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:37,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:37,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:37,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:37,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 23:22:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 23:22:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:22:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:22:37,528 INFO L87 Difference]: Start difference. First operand 620 states and 746 transitions. Second operand 10 states. [2018-12-02 23:22:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:38,422 INFO L93 Difference]: Finished difference Result 1284 states and 1539 transitions. [2018-12-02 23:22:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 23:22:38,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-02 23:22:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:38,424 INFO L225 Difference]: With dead ends: 1284 [2018-12-02 23:22:38,424 INFO L226 Difference]: Without dead ends: 1137 [2018-12-02 23:22:38,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-02 23:22:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2018-12-02 23:22:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 995. [2018-12-02 23:22:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-12-02 23:22:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1214 transitions. [2018-12-02 23:22:38,473 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1214 transitions. Word has length 73 [2018-12-02 23:22:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:38,473 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 1214 transitions. [2018-12-02 23:22:38,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 23:22:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1214 transitions. [2018-12-02 23:22:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 23:22:38,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:38,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:38,474 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1983138585, now seen corresponding path program 1 times [2018-12-02 23:22:38,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:38,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:38,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 23:22:38,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 23:22:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:22:38,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:22:38,502 INFO L87 Difference]: Start difference. First operand 995 states and 1214 transitions. Second operand 6 states. [2018-12-02 23:22:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:38,901 INFO L93 Difference]: Finished difference Result 1283 states and 1532 transitions. [2018-12-02 23:22:38,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:22:38,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-02 23:22:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:38,903 INFO L225 Difference]: With dead ends: 1283 [2018-12-02 23:22:38,903 INFO L226 Difference]: Without dead ends: 1153 [2018-12-02 23:22:38,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:22:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2018-12-02 23:22:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1077. [2018-12-02 23:22:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2018-12-02 23:22:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1309 transitions. [2018-12-02 23:22:38,957 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1309 transitions. Word has length 73 [2018-12-02 23:22:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:38,957 INFO L480 AbstractCegarLoop]: Abstraction has 1077 states and 1309 transitions. [2018-12-02 23:22:38,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 23:22:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1309 transitions. [2018-12-02 23:22:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 23:22:38,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:38,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:38,959 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:38,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:38,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1013991573, now seen corresponding path program 1 times [2018-12-02 23:22:38,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:38,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:38,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:22:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:22:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:22:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 23:22:38,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 23:22:38,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:22:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:38,983 INFO L87 Difference]: Start difference. First operand 1077 states and 1309 transitions. Second operand 5 states. [2018-12-02 23:22:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:22:39,040 INFO L93 Difference]: Finished difference Result 1122 states and 1357 transitions. [2018-12-02 23:22:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:22:39,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 23:22:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:22:39,042 INFO L225 Difference]: With dead ends: 1122 [2018-12-02 23:22:39,042 INFO L226 Difference]: Without dead ends: 1061 [2018-12-02 23:22:39,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:22:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2018-12-02 23:22:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061. [2018-12-02 23:22:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-12-02 23:22:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1285 transitions. [2018-12-02 23:22:39,095 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1285 transitions. Word has length 73 [2018-12-02 23:22:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:22:39,095 INFO L480 AbstractCegarLoop]: Abstraction has 1061 states and 1285 transitions. [2018-12-02 23:22:39,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 23:22:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1285 transitions. [2018-12-02 23:22:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 23:22:39,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:22:39,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:22:39,096 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:22:39,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:22:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1533375131, now seen corresponding path program 1 times [2018-12-02 23:22:39,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:22:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:22:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:39,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:22:39,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:22:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:22:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:22:39,139 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 23:22:39,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:22:39 BoogieIcfgContainer [2018-12-02 23:22:39,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:22:39,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:22:39,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:22:39,219 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:22:39,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:22:21" (3/4) ... [2018-12-02 23:22:39,221 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 23:22:39,288 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9461d79d-783a-42d3-82f0-bcbc61ef1b7c/bin-2019/uautomizer/witness.graphml [2018-12-02 23:22:39,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:22:39,289 INFO L168 Benchmark]: Toolchain (without parser) took 18977.73 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 728.2 MB). Free memory was 950.6 MB in the beginning and 1.3 GB in the end (delta: -350.4 MB). Peak memory consumption was 377.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:22:39,290 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:22:39,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-02 23:22:39,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.04 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-02 23:22:39,290 INFO L168 Benchmark]: Boogie Preprocessor took 41.43 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-02 23:22:39,290 INFO L168 Benchmark]: RCFGBuilder took 678.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 942.8 MB in the end (delta: 141.5 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. [2018-12-02 23:22:39,290 INFO L168 Benchmark]: TraceAbstraction took 17813.93 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 619.7 MB). Free memory was 942.8 MB in the beginning and 1.3 GB in the end (delta: -376.3 MB). Peak memory consumption was 243.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:22:39,290 INFO L168 Benchmark]: Witness Printer took 69.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-02 23:22:39,291 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.04 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 41.43 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 678.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 942.8 MB in the end (delta: 141.5 MB). Peak memory consumption was 141.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17813.93 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 619.7 MB). Free memory was 942.8 MB in the beginning and 1.3 GB in the end (delta: -376.3 MB). Peak memory consumption was 243.4 MB. Max. memory is 11.5 GB. * Witness Printer took 69.14 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 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.7s OverallTime, 67 OverallIterations, 2 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39154 SDtfs, 18589 SDslu, 161349 SDs, 0 SdLazy, 14239 SolverSat, 3201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 156 SyntacticMatches, 7 SemanticMatches, 468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1077occurred 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.3s AutomataMinimizationTime, 66 MinimizatonAttempts, 2275 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3950 NumberOfCodeBlocks, 3950 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3811 ConstructedInterpolants, 0 QuantifiedInterpolants, 497139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 66 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...