./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_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/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_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/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-08 20:48:18,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:48:18,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:48:18,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:48:18,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:48:18,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:48:18,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:48:18,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:48:18,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:48:18,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:48:18,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:48:18,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:48:18,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:48:18,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:48:18,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:48:18,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:48:18,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:48:18,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:48:18,083 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:48:18,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:48:18,084 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:48:18,085 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:48:18,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:48:18,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:48:18,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:48:18,087 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:48:18,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:48:18,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:48:18,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:48:18,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:48:18,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:48:18,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:48:18,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:48:18,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:48:18,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:48:18,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:48:18,090 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 20:48:18,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:48:18,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:48:18,098 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:48:18,098 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:48:18,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:48:18,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:48:18,098 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:48:18,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:48:18,098 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:48:18,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:48:18,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:48:18,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:48:18,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:48:18,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:48:18,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:48:18,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:48:18,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:48:18,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:48:18,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:48:18,100 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_5c28034d-1942-4277-99dd-76a55b1c6ef4/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-08 20:48:18,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:48:18,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:48:18,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:48:18,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:48:18,127 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:48:18,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 20:48:18,161 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/data/cbac2d229/db8ac64114ca44b4a741498eadf2e9d8/FLAGf09db5de1 [2018-12-08 20:48:18,664 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:48:18,665 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 20:48:18,673 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/data/cbac2d229/db8ac64114ca44b4a741498eadf2e9d8/FLAGf09db5de1 [2018-12-08 20:48:19,002 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/data/cbac2d229/db8ac64114ca44b4a741498eadf2e9d8 [2018-12-08 20:48:19,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:48:19,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:48:19,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:48:19,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:48:19,009 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:48:19,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ade0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19, skipping insertion in model container [2018-12-08 20:48:19,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:48:19,059 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:48:19,263 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:48:19,266 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:48:19,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:48:19,383 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:48:19,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19 WrapperNode [2018-12-08 20:48:19,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:48:19,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:48:19,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:48:19,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:48:19,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:48:19,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:48:19,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:48:19,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:48:19,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... [2018-12-08 20:48:19,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:48:19,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:48:19,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:48:19,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:48:19,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/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-08 20:48:19,481 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-12-08 20:48:19,481 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-12-08 20:48:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-08 20:48:19,482 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-08 20:48:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-12-08 20:48:19,482 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-12-08 20:48:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-12-08 20:48:19,482 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-12-08 20:48:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:48:19,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:48:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-08 20:48:19,482 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-08 20:48:19,482 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-12-08 20:48:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-12-08 20:48:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-08 20:48:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-12-08 20:48:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-08 20:48:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-12-08 20:48:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-12-08 20:48:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-12-08 20:48:19,484 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-08 20:48:19,484 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-12-08 20:48:19,485 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-12-08 20:48:19,485 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-12-08 20:48:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-12-08 20:48:19,486 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-12-08 20:48:19,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-12-08 20:48:19,704 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:19,704 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:19,763 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:19,763 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:19,797 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:19,797 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:19,845 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:19,845 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:19,885 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:19,885 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:19,981 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:19,982 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:20,015 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:20,015 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:20,028 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:20,028 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:20,147 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 20:48:20,147 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 20:48:20,163 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:48:20,163 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 20:48:20,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:48:20 BoogieIcfgContainer [2018-12-08 20:48:20,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:48:20,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:48:20,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:48:20,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:48:20,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:48:19" (1/3) ... [2018-12-08 20:48:20,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540c9ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:48:20, skipping insertion in model container [2018-12-08 20:48:20,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:48:19" (2/3) ... [2018-12-08 20:48:20,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540c9ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:48:20, skipping insertion in model container [2018-12-08 20:48:20,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:48:20" (3/3) ... [2018-12-08 20:48:20,170 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 20:48:20,178 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:48:20,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:48:20,193 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:48:20,215 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:48:20,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:48:20,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:48:20,215 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:48:20,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:48:20,216 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:48:20,216 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:48:20,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:48:20,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:48:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2018-12-08 20:48:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 20:48:20,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:20,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:20,240 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:20,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:20,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2018-12-08 20:48:20,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:20,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:20,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:20,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:20,369 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-08 20:48:20,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:20,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:20,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:20,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:20,382 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2018-12-08 20:48:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:20,491 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2018-12-08 20:48:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:20,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 20:48:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:20,502 INFO L225 Difference]: With dead ends: 891 [2018-12-08 20:48:20,502 INFO L226 Difference]: Without dead ends: 509 [2018-12-08 20:48:20,506 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-08 20:48:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-12-08 20:48:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-12-08 20:48:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-12-08 20:48:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2018-12-08 20:48:20,554 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2018-12-08 20:48:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:20,554 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2018-12-08 20:48:20,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2018-12-08 20:48:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 20:48:20,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:20,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] [2018-12-08 20:48:20,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:20,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2018-12-08 20:48:20,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:20,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:20,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:20,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:20,646 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-08 20:48:20,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:20,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:20,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:20,648 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2018-12-08 20:48:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:20,801 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2018-12-08 20:48:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:20,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 20:48:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:20,805 INFO L225 Difference]: With dead ends: 795 [2018-12-08 20:48:20,806 INFO L226 Difference]: Without dead ends: 674 [2018-12-08 20:48:20,807 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-08 20:48:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-12-08 20:48:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2018-12-08 20:48:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-12-08 20:48:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2018-12-08 20:48:20,838 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2018-12-08 20:48:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:20,839 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2018-12-08 20:48:20,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2018-12-08 20:48:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 20:48:20,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:20,840 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-08 20:48:20,841 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:20,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash 880506904, now seen corresponding path program 1 times [2018-12-08 20:48:20,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:20,903 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-08 20:48:20,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:20,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:20,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:20,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:20,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:20,904 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2018-12-08 20:48:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:20,935 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2018-12-08 20:48:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:20,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 20:48:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:20,940 INFO L225 Difference]: With dead ends: 1001 [2018-12-08 20:48:20,940 INFO L226 Difference]: Without dead ends: 823 [2018-12-08 20:48:20,941 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-08 20:48:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-08 20:48:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2018-12-08 20:48:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-08 20:48:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2018-12-08 20:48:20,975 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2018-12-08 20:48:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:20,976 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2018-12-08 20:48:20,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:20,976 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2018-12-08 20:48:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 20:48:20,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:20,977 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-08 20:48:20,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:20,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2133514060, now seen corresponding path program 1 times [2018-12-08 20:48:20,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:20,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:20,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:20,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:21,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:21,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:21,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:21,013 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2018-12-08 20:48:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:21,145 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2018-12-08 20:48:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:21,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-08 20:48:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:21,149 INFO L225 Difference]: With dead ends: 1430 [2018-12-08 20:48:21,150 INFO L226 Difference]: Without dead ends: 1164 [2018-12-08 20:48:21,151 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-08 20:48:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-12-08 20:48:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2018-12-08 20:48:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-08 20:48:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-12-08 20:48:21,199 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2018-12-08 20:48:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:21,199 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-12-08 20:48:21,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-12-08 20:48:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 20:48:21,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:21,201 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-08 20:48:21,201 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:21,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1952820015, now seen corresponding path program 1 times [2018-12-08 20:48:21,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:21,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:21,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:21,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:21,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:21,247 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-08 20:48:21,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:21,248 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-12-08 20:48:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:21,724 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2018-12-08 20:48:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:48:21,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-08 20:48:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:21,729 INFO L225 Difference]: With dead ends: 1570 [2018-12-08 20:48:21,729 INFO L226 Difference]: Without dead ends: 990 [2018-12-08 20:48:21,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:48:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-12-08 20:48:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2018-12-08 20:48:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-08 20:48:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2018-12-08 20:48:21,760 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2018-12-08 20:48:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:21,760 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2018-12-08 20:48:21,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2018-12-08 20:48:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 20:48:21,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:21,762 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-08 20:48:21,762 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:21,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash -950761943, now seen corresponding path program 1 times [2018-12-08 20:48:21,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:21,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:21,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:21,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:21,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:21,810 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-08 20:48:21,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:21,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:21,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:21,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:21,811 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2018-12-08 20:48:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:21,872 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2018-12-08 20:48:21,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:21,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-08 20:48:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:21,875 INFO L225 Difference]: With dead ends: 892 [2018-12-08 20:48:21,875 INFO L226 Difference]: Without dead ends: 888 [2018-12-08 20:48:21,876 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-08 20:48:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-08 20:48:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-08 20:48:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-08 20:48:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2018-12-08 20:48:21,900 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2018-12-08 20:48:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:21,900 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2018-12-08 20:48:21,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2018-12-08 20:48:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 20:48:21,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:21,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:21,902 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:21,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:21,902 INFO L82 PathProgramCache]: Analyzing trace with hash -826026373, now seen corresponding path program 1 times [2018-12-08 20:48:21,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:21,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:21,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:21,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:21,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:21,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:21,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:21,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:21,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:21,932 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2018-12-08 20:48:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:21,969 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2018-12-08 20:48:21,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:21,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-08 20:48:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:21,972 INFO L225 Difference]: With dead ends: 1280 [2018-12-08 20:48:21,972 INFO L226 Difference]: Without dead ends: 1019 [2018-12-08 20:48:21,972 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-08 20:48:21,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-12-08 20:48:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2018-12-08 20:48:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-12-08 20:48:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2018-12-08 20:48:21,998 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2018-12-08 20:48:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:21,998 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2018-12-08 20:48:21,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2018-12-08 20:48:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 20:48:21,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:21,999 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-08 20:48:21,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:21,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2018-12-08 20:48:22,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:22,025 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2018-12-08 20:48:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:22,064 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2018-12-08 20:48:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:22,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-08 20:48:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:22,067 INFO L225 Difference]: With dead ends: 976 [2018-12-08 20:48:22,067 INFO L226 Difference]: Without dead ends: 956 [2018-12-08 20:48:22,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-12-08 20:48:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2018-12-08 20:48:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-08 20:48:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2018-12-08 20:48:22,094 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2018-12-08 20:48:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:22,095 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2018-12-08 20:48:22,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2018-12-08 20:48:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:48:22,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:22,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] [2018-12-08 20:48:22,096 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:22,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 215600759, now seen corresponding path program 1 times [2018-12-08 20:48:22,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:22,124 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-08 20:48:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:22,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:22,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:22,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:22,124 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2018-12-08 20:48:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:22,157 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2018-12-08 20:48:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:22,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-08 20:48:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:22,160 INFO L225 Difference]: With dead ends: 1175 [2018-12-08 20:48:22,160 INFO L226 Difference]: Without dead ends: 933 [2018-12-08 20:48:22,161 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-08 20:48:22,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-12-08 20:48:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-12-08 20:48:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-12-08 20:48:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2018-12-08 20:48:22,191 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2018-12-08 20:48:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:22,191 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2018-12-08 20:48:22,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2018-12-08 20:48:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 20:48:22,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:22,193 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-08 20:48:22,193 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:22,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -564668473, now seen corresponding path program 1 times [2018-12-08 20:48:22,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:22,225 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-08 20:48:22,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:22,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:48:22,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:48:22,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:48:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:48:22,226 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2018-12-08 20:48:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:22,501 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2018-12-08 20:48:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:48:22,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 20:48:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:22,503 INFO L225 Difference]: With dead ends: 1022 [2018-12-08 20:48:22,503 INFO L226 Difference]: Without dead ends: 793 [2018-12-08 20:48:22,504 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-08 20:48:22,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-08 20:48:22,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2018-12-08 20:48:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-12-08 20:48:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2018-12-08 20:48:22,532 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2018-12-08 20:48:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:22,532 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2018-12-08 20:48:22,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:48:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2018-12-08 20:48:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 20:48:22,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:22,534 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-08 20:48:22,534 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:22,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2018-12-08 20:48:22,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:22,574 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-08 20:48:22,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:22,575 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2018-12-08 20:48:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:22,604 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2018-12-08 20:48:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:22,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-12-08 20:48:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:22,606 INFO L225 Difference]: With dead ends: 879 [2018-12-08 20:48:22,607 INFO L226 Difference]: Without dead ends: 783 [2018-12-08 20:48:22,607 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-08 20:48:22,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-08 20:48:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2018-12-08 20:48:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-12-08 20:48:22,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2018-12-08 20:48:22,629 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2018-12-08 20:48:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:22,629 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2018-12-08 20:48:22,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2018-12-08 20:48:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 20:48:22,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:22,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] [2018-12-08 20:48:22,631 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:22,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2018-12-08 20:48:22,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:22,654 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-08 20:48:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:22,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:22,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:22,655 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2018-12-08 20:48:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:22,728 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2018-12-08 20:48:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:22,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-08 20:48:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:22,732 INFO L225 Difference]: With dead ends: 957 [2018-12-08 20:48:22,732 INFO L226 Difference]: Without dead ends: 943 [2018-12-08 20:48:22,733 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-08 20:48:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-12-08 20:48:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2018-12-08 20:48:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-08 20:48:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2018-12-08 20:48:22,765 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2018-12-08 20:48:22,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:22,765 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2018-12-08 20:48:22,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:22,766 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2018-12-08 20:48:22,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:48:22,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:22,767 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-08 20:48:22,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:22,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2018-12-08 20:48:22,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:22,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:22,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:48:22,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:48:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:48:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:48:22,810 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2018-12-08 20:48:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:22,935 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2018-12-08 20:48:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:48:22,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-08 20:48:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:22,938 INFO L225 Difference]: With dead ends: 863 [2018-12-08 20:48:22,938 INFO L226 Difference]: Without dead ends: 859 [2018-12-08 20:48:22,938 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-08 20:48:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-12-08 20:48:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2018-12-08 20:48:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-08 20:48:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2018-12-08 20:48:22,967 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2018-12-08 20:48:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:22,967 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2018-12-08 20:48:22,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:48:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2018-12-08 20:48:22,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:48:22,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:22,969 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-08 20:48:22,969 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:22,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2018-12-08 20:48:22,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:22,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:23,015 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-08 20:48:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:48:23,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:48:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:48:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:48:23,016 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2018-12-08 20:48:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:23,103 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2018-12-08 20:48:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:48:23,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-12-08 20:48:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:23,106 INFO L225 Difference]: With dead ends: 898 [2018-12-08 20:48:23,106 INFO L226 Difference]: Without dead ends: 877 [2018-12-08 20:48:23,107 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-08 20:48:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-12-08 20:48:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2018-12-08 20:48:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-08 20:48:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2018-12-08 20:48:23,143 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2018-12-08 20:48:23,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:23,143 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2018-12-08 20:48:23,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:48:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2018-12-08 20:48:23,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 20:48:23,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:23,144 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-08 20:48:23,145 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:23,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2018-12-08 20:48:23,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:23,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:23,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:23,163 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-08 20:48:23,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:23,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:48:23,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:48:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:48:23,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:48:23,164 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2018-12-08 20:48:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:23,203 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2018-12-08 20:48:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:48:23,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-12-08 20:48:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:23,205 INFO L225 Difference]: With dead ends: 901 [2018-12-08 20:48:23,205 INFO L226 Difference]: Without dead ends: 879 [2018-12-08 20:48:23,206 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-08 20:48:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-08 20:48:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2018-12-08 20:48:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-12-08 20:48:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2018-12-08 20:48:23,236 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2018-12-08 20:48:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:23,236 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2018-12-08 20:48:23,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:48:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2018-12-08 20:48:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 20:48:23,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:23,237 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-08 20:48:23,237 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:23,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:23,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2018-12-08 20:48:23,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:23,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:23,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:23,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:23,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:23,281 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-08 20:48:23,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:23,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:48:23,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:48:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:48:23,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:48:23,282 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2018-12-08 20:48:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:23,966 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2018-12-08 20:48:23,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:48:23,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-08 20:48:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:23,969 INFO L225 Difference]: With dead ends: 1088 [2018-12-08 20:48:23,969 INFO L226 Difference]: Without dead ends: 997 [2018-12-08 20:48:23,969 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-08 20:48:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-12-08 20:48:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2018-12-08 20:48:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-08 20:48:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2018-12-08 20:48:24,004 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2018-12-08 20:48:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:24,004 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2018-12-08 20:48:24,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:48:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2018-12-08 20:48:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 20:48:24,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:24,006 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-08 20:48:24,006 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:24,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2018-12-08 20:48:24,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:24,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:24,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:24,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-08 20:48:24,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:24,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:24,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:24,031 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2018-12-08 20:48:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:24,140 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2018-12-08 20:48:24,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:24,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 20:48:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:24,144 INFO L225 Difference]: With dead ends: 1038 [2018-12-08 20:48:24,144 INFO L226 Difference]: Without dead ends: 998 [2018-12-08 20:48:24,145 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-08 20:48:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-12-08 20:48:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2018-12-08 20:48:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-12-08 20:48:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2018-12-08 20:48:24,188 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2018-12-08 20:48:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:24,188 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2018-12-08 20:48:24,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2018-12-08 20:48:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 20:48:24,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:24,189 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-08 20:48:24,189 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:24,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:24,190 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2018-12-08 20:48:24,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:24,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:24,260 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-08 20:48:24,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:24,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:48:24,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:48:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:48:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:48:24,260 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 9 states. [2018-12-08 20:48:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:25,193 INFO L93 Difference]: Finished difference Result 1211 states and 1672 transitions. [2018-12-08 20:48:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 20:48:25,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-08 20:48:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:25,196 INFO L225 Difference]: With dead ends: 1211 [2018-12-08 20:48:25,196 INFO L226 Difference]: Without dead ends: 1142 [2018-12-08 20:48:25,197 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-08 20:48:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-12-08 20:48:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 902. [2018-12-08 20:48:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-12-08 20:48:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1225 transitions. [2018-12-08 20:48:25,254 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1225 transitions. Word has length 50 [2018-12-08 20:48:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:25,255 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1225 transitions. [2018-12-08 20:48:25,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:48:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1225 transitions. [2018-12-08 20:48:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:48:25,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:25,257 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-08 20:48:25,257 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:25,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2018-12-08 20:48:25,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:25,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:25,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:25,287 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-08 20:48:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:25,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:25,287 INFO L87 Difference]: Start difference. First operand 902 states and 1225 transitions. Second operand 3 states. [2018-12-08 20:48:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:25,361 INFO L93 Difference]: Finished difference Result 930 states and 1257 transitions. [2018-12-08 20:48:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:25,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 20:48:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:25,364 INFO L225 Difference]: With dead ends: 930 [2018-12-08 20:48:25,364 INFO L226 Difference]: Without dead ends: 925 [2018-12-08 20:48:25,365 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-08 20:48:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-12-08 20:48:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 919. [2018-12-08 20:48:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-08 20:48:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1246 transitions. [2018-12-08 20:48:25,413 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1246 transitions. Word has length 52 [2018-12-08 20:48:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:25,414 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1246 transitions. [2018-12-08 20:48:25,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1246 transitions. [2018-12-08 20:48:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 20:48:25,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:25,415 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-08 20:48:25,415 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:25,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2018-12-08 20:48:25,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:25,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:25,438 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-08 20:48:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:25,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:25,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:25,439 INFO L87 Difference]: Start difference. First operand 919 states and 1246 transitions. Second operand 3 states. [2018-12-08 20:48:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:25,503 INFO L93 Difference]: Finished difference Result 1135 states and 1537 transitions. [2018-12-08 20:48:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:25,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-08 20:48:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:25,505 INFO L225 Difference]: With dead ends: 1135 [2018-12-08 20:48:25,505 INFO L226 Difference]: Without dead ends: 888 [2018-12-08 20:48:25,506 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-08 20:48:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-12-08 20:48:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-12-08 20:48:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-08 20:48:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1206 transitions. [2018-12-08 20:48:25,536 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1206 transitions. Word has length 54 [2018-12-08 20:48:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:25,537 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1206 transitions. [2018-12-08 20:48:25,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1206 transitions. [2018-12-08 20:48:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 20:48:25,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:25,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, 1, 1, 1] [2018-12-08 20:48:25,538 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:25,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2018-12-08 20:48:25,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:25,579 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-08 20:48:25,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:25,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:25,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:25,579 INFO L87 Difference]: Start difference. First operand 888 states and 1206 transitions. Second operand 5 states. [2018-12-08 20:48:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:25,887 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-12-08 20:48:25,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:25,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-08 20:48:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:25,889 INFO L225 Difference]: With dead ends: 900 [2018-12-08 20:48:25,889 INFO L226 Difference]: Without dead ends: 894 [2018-12-08 20:48:25,890 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-08 20:48:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-12-08 20:48:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2018-12-08 20:48:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-12-08 20:48:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1205 transitions. [2018-12-08 20:48:25,939 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1205 transitions. Word has length 53 [2018-12-08 20:48:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1205 transitions. [2018-12-08 20:48:25,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1205 transitions. [2018-12-08 20:48:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:48:25,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:25,940 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-08 20:48:25,941 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:25,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:25,941 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2018-12-08 20:48:25,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:25,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:25,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:25,971 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-08 20:48:25,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:25,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:25,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:25,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:25,971 INFO L87 Difference]: Start difference. First operand 888 states and 1205 transitions. Second operand 5 states. [2018-12-08 20:48:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:26,271 INFO L93 Difference]: Finished difference Result 903 states and 1220 transitions. [2018-12-08 20:48:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:26,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-08 20:48:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:26,273 INFO L225 Difference]: With dead ends: 903 [2018-12-08 20:48:26,273 INFO L226 Difference]: Without dead ends: 867 [2018-12-08 20:48:26,273 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-08 20:48:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-08 20:48:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 861. [2018-12-08 20:48:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-08 20:48:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1175 transitions. [2018-12-08 20:48:26,317 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1175 transitions. Word has length 52 [2018-12-08 20:48:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:26,317 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1175 transitions. [2018-12-08 20:48:26,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1175 transitions. [2018-12-08 20:48:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 20:48:26,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:26,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:26,319 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:26,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2018-12-08 20:48:26,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:26,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:26,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:26,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:26,365 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-08 20:48:26,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:26,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:26,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:26,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:26,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:26,366 INFO L87 Difference]: Start difference. First operand 861 states and 1175 transitions. Second operand 5 states. [2018-12-08 20:48:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:26,676 INFO L93 Difference]: Finished difference Result 871 states and 1183 transitions. [2018-12-08 20:48:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:26,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-08 20:48:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:26,679 INFO L225 Difference]: With dead ends: 871 [2018-12-08 20:48:26,679 INFO L226 Difference]: Without dead ends: 865 [2018-12-08 20:48:26,679 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-08 20:48:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-12-08 20:48:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2018-12-08 20:48:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-12-08 20:48:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2018-12-08 20:48:26,718 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 54 [2018-12-08 20:48:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:26,718 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2018-12-08 20:48:26,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2018-12-08 20:48:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 20:48:26,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:26,720 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-08 20:48:26,720 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:26,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2018-12-08 20:48:26,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:26,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:26,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:26,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:48:26,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:48:26,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:48:26,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:48:26,775 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2018-12-08 20:48:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:26,942 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2018-12-08 20:48:26,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:48:26,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-08 20:48:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:26,944 INFO L225 Difference]: With dead ends: 888 [2018-12-08 20:48:26,944 INFO L226 Difference]: Without dead ends: 852 [2018-12-08 20:48:26,945 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-08 20:48:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-12-08 20:48:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2018-12-08 20:48:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-12-08 20:48:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2018-12-08 20:48:27,008 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2018-12-08 20:48:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:27,008 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2018-12-08 20:48:27,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:48:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2018-12-08 20:48:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 20:48:27,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:27,009 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-08 20:48:27,009 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:27,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1728183236, now seen corresponding path program 1 times [2018-12-08 20:48:27,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:27,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:27,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:27,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:27,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:27,083 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-08 20:48:27,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:27,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:48:27,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:27,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:27,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:27,083 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2018-12-08 20:48:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:27,228 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2018-12-08 20:48:27,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:48:27,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-08 20:48:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:27,231 INFO L225 Difference]: With dead ends: 868 [2018-12-08 20:48:27,231 INFO L226 Difference]: Without dead ends: 850 [2018-12-08 20:48:27,231 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-08 20:48:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-08 20:48:27,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-12-08 20:48:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-12-08 20:48:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2018-12-08 20:48:27,261 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 56 [2018-12-08 20:48:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:27,261 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2018-12-08 20:48:27,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2018-12-08 20:48:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 20:48:27,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:27,262 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-08 20:48:27,262 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:27,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1135140490, now seen corresponding path program 1 times [2018-12-08 20:48:27,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:27,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:27,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:27,329 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-08 20:48:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:27,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:48:27,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:27,330 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2018-12-08 20:48:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:27,467 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2018-12-08 20:48:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:48:27,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-12-08 20:48:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:27,470 INFO L225 Difference]: With dead ends: 863 [2018-12-08 20:48:27,470 INFO L226 Difference]: Without dead ends: 845 [2018-12-08 20:48:27,471 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-08 20:48:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-08 20:48:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-12-08 20:48:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 20:48:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2018-12-08 20:48:27,511 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 55 [2018-12-08 20:48:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:27,512 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2018-12-08 20:48:27,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2018-12-08 20:48:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 20:48:27,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:27,513 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-08 20:48:27,513 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:27,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash 247485060, now seen corresponding path program 1 times [2018-12-08 20:48:27,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:27,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:27,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:27,559 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-08 20:48:27,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:27,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:27,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:27,560 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 5 states. [2018-12-08 20:48:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:28,067 INFO L93 Difference]: Finished difference Result 1397 states and 1954 transitions. [2018-12-08 20:48:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:48:28,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-08 20:48:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:28,072 INFO L225 Difference]: With dead ends: 1397 [2018-12-08 20:48:28,072 INFO L226 Difference]: Without dead ends: 1233 [2018-12-08 20:48:28,073 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-08 20:48:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-12-08 20:48:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 883. [2018-12-08 20:48:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-12-08 20:48:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1194 transitions. [2018-12-08 20:48:28,120 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1194 transitions. Word has length 61 [2018-12-08 20:48:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:28,120 INFO L480 AbstractCegarLoop]: Abstraction has 883 states and 1194 transitions. [2018-12-08 20:48:28,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1194 transitions. [2018-12-08 20:48:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 20:48:28,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:28,121 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-08 20:48:28,121 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:28,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2094530933, now seen corresponding path program 1 times [2018-12-08 20:48:28,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:28,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:28,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:28,212 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-08 20:48:28,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:28,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:48:28,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:28,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:28,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:28,213 INFO L87 Difference]: Start difference. First operand 883 states and 1194 transitions. Second operand 12 states. [2018-12-08 20:48:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:28,399 INFO L93 Difference]: Finished difference Result 909 states and 1222 transitions. [2018-12-08 20:48:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:28,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-12-08 20:48:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:28,402 INFO L225 Difference]: With dead ends: 909 [2018-12-08 20:48:28,403 INFO L226 Difference]: Without dead ends: 884 [2018-12-08 20:48:28,403 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-08 20:48:28,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-12-08 20:48:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2018-12-08 20:48:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-12-08 20:48:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1183 transitions. [2018-12-08 20:48:28,445 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1183 transitions. Word has length 59 [2018-12-08 20:48:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:28,445 INFO L480 AbstractCegarLoop]: Abstraction has 882 states and 1183 transitions. [2018-12-08 20:48:28,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1183 transitions. [2018-12-08 20:48:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 20:48:28,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:28,447 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-08 20:48:28,447 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:28,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2018-12-08 20:48:28,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:28,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:28,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:28,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:28,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:28,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:48:28,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:48:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:48:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:48:28,531 INFO L87 Difference]: Start difference. First operand 882 states and 1183 transitions. Second operand 11 states. [2018-12-08 20:48:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:28,733 INFO L93 Difference]: Finished difference Result 899 states and 1201 transitions. [2018-12-08 20:48:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:48:28,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-12-08 20:48:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:28,735 INFO L225 Difference]: With dead ends: 899 [2018-12-08 20:48:28,735 INFO L226 Difference]: Without dead ends: 879 [2018-12-08 20:48:28,735 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-08 20:48:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-08 20:48:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2018-12-08 20:48:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-12-08 20:48:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1178 transitions. [2018-12-08 20:48:28,769 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1178 transitions. Word has length 58 [2018-12-08 20:48:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:28,769 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1178 transitions. [2018-12-08 20:48:28,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:48:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1178 transitions. [2018-12-08 20:48:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 20:48:28,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:28,770 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-08 20:48:28,771 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:28,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2018-12-08 20:48:28,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:28,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:28,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:28,827 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-08 20:48:28,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:28,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:48:28,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:28,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:28,828 INFO L87 Difference]: Start difference. First operand 879 states and 1178 transitions. Second operand 10 states. [2018-12-08 20:48:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:28,992 INFO L93 Difference]: Finished difference Result 946 states and 1253 transitions. [2018-12-08 20:48:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:48:28,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-12-08 20:48:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:28,994 INFO L225 Difference]: With dead ends: 946 [2018-12-08 20:48:28,994 INFO L226 Difference]: Without dead ends: 837 [2018-12-08 20:48:28,995 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-08 20:48:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-12-08 20:48:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 834. [2018-12-08 20:48:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-12-08 20:48:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1097 transitions. [2018-12-08 20:48:29,025 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1097 transitions. Word has length 59 [2018-12-08 20:48:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:29,025 INFO L480 AbstractCegarLoop]: Abstraction has 834 states and 1097 transitions. [2018-12-08 20:48:29,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1097 transitions. [2018-12-08 20:48:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 20:48:29,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:29,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:29,026 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:29,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2018-12-08 20:48:29,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:29,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:29,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:29,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:29,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:29,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:48:29,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:48:29,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:48:29,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:48:29,050 INFO L87 Difference]: Start difference. First operand 834 states and 1097 transitions. Second operand 4 states. [2018-12-08 20:48:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:29,156 INFO L93 Difference]: Finished difference Result 987 states and 1310 transitions. [2018-12-08 20:48:29,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:48:29,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-08 20:48:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:29,158 INFO L225 Difference]: With dead ends: 987 [2018-12-08 20:48:29,159 INFO L226 Difference]: Without dead ends: 879 [2018-12-08 20:48:29,159 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-08 20:48:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-08 20:48:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 841. [2018-12-08 20:48:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2018-12-08 20:48:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1112 transitions. [2018-12-08 20:48:29,193 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1112 transitions. Word has length 60 [2018-12-08 20:48:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:29,193 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 1112 transitions. [2018-12-08 20:48:29,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:48:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1112 transitions. [2018-12-08 20:48:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 20:48:29,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:29,194 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-08 20:48:29,194 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:29,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2018-12-08 20:48:29,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:29,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:29,260 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-08 20:48:29,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:29,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:48:29,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:48:29,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:48:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:48:29,261 INFO L87 Difference]: Start difference. First operand 841 states and 1112 transitions. Second operand 11 states. [2018-12-08 20:48:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:29,360 INFO L93 Difference]: Finished difference Result 910 states and 1203 transitions. [2018-12-08 20:48:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:48:29,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-12-08 20:48:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:29,362 INFO L225 Difference]: With dead ends: 910 [2018-12-08 20:48:29,362 INFO L226 Difference]: Without dead ends: 855 [2018-12-08 20:48:29,362 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-08 20:48:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-08 20:48:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 845. [2018-12-08 20:48:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-08 20:48:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1129 transitions. [2018-12-08 20:48:29,403 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1129 transitions. Word has length 60 [2018-12-08 20:48:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:29,404 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1129 transitions. [2018-12-08 20:48:29,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:48:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1129 transitions. [2018-12-08 20:48:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 20:48:29,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:29,405 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-08 20:48:29,405 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:29,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash -303025806, now seen corresponding path program 1 times [2018-12-08 20:48:29,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:29,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-08 20:48:29,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:29,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:48:29,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:29,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:29,502 INFO L87 Difference]: Start difference. First operand 845 states and 1129 transitions. Second operand 12 states. [2018-12-08 20:48:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:29,681 INFO L93 Difference]: Finished difference Result 869 states and 1154 transitions. [2018-12-08 20:48:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:29,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-12-08 20:48:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:29,683 INFO L225 Difference]: With dead ends: 869 [2018-12-08 20:48:29,683 INFO L226 Difference]: Without dead ends: 845 [2018-12-08 20:48:29,684 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-08 20:48:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-12-08 20:48:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 843. [2018-12-08 20:48:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-12-08 20:48:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1125 transitions. [2018-12-08 20:48:29,716 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1125 transitions. Word has length 66 [2018-12-08 20:48:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:29,716 INFO L480 AbstractCegarLoop]: Abstraction has 843 states and 1125 transitions. [2018-12-08 20:48:29,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1125 transitions. [2018-12-08 20:48:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 20:48:29,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:29,718 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-08 20:48:29,718 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:29,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash -340760307, now seen corresponding path program 1 times [2018-12-08 20:48:29,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:29,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:29,757 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-08 20:48:29,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:29,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:29,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:29,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:29,757 INFO L87 Difference]: Start difference. First operand 843 states and 1125 transitions. Second operand 5 states. [2018-12-08 20:48:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:29,881 INFO L93 Difference]: Finished difference Result 877 states and 1165 transitions. [2018-12-08 20:48:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:29,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 20:48:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:29,884 INFO L225 Difference]: With dead ends: 877 [2018-12-08 20:48:29,884 INFO L226 Difference]: Without dead ends: 850 [2018-12-08 20:48:29,884 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-08 20:48:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-12-08 20:48:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2018-12-08 20:48:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2018-12-08 20:48:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1134 transitions. [2018-12-08 20:48:29,934 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1134 transitions. Word has length 67 [2018-12-08 20:48:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:29,934 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 1134 transitions. [2018-12-08 20:48:29,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1134 transitions. [2018-12-08 20:48:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:48:29,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:29,936 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-08 20:48:29,936 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:29,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1988119945, now seen corresponding path program 1 times [2018-12-08 20:48:29,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:30,006 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-08 20:48:30,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:48:30,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:30,007 INFO L87 Difference]: Start difference. First operand 848 states and 1134 transitions. Second operand 12 states. [2018-12-08 20:48:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:30,205 INFO L93 Difference]: Finished difference Result 870 states and 1157 transitions. [2018-12-08 20:48:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:30,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-12-08 20:48:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:30,208 INFO L225 Difference]: With dead ends: 870 [2018-12-08 20:48:30,208 INFO L226 Difference]: Without dead ends: 846 [2018-12-08 20:48:30,208 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-08 20:48:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-12-08 20:48:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2018-12-08 20:48:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2018-12-08 20:48:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1129 transitions. [2018-12-08 20:48:30,260 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1129 transitions. Word has length 63 [2018-12-08 20:48:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:30,260 INFO L480 AbstractCegarLoop]: Abstraction has 846 states and 1129 transitions. [2018-12-08 20:48:30,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1129 transitions. [2018-12-08 20:48:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 20:48:30,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:30,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:48:30,261 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:30,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash 360839567, now seen corresponding path program 1 times [2018-12-08 20:48:30,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:30,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:30,350 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-08 20:48:30,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:30,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:48:30,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:30,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:30,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:30,351 INFO L87 Difference]: Start difference. First operand 846 states and 1129 transitions. Second operand 12 states. [2018-12-08 20:48:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:30,521 INFO L93 Difference]: Finished difference Result 870 states and 1154 transitions. [2018-12-08 20:48:30,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:30,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-12-08 20:48:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:30,523 INFO L225 Difference]: With dead ends: 870 [2018-12-08 20:48:30,523 INFO L226 Difference]: Without dead ends: 846 [2018-12-08 20:48:30,523 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-08 20:48:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2018-12-08 20:48:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2018-12-08 20:48:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-08 20:48:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1125 transitions. [2018-12-08 20:48:30,555 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1125 transitions. Word has length 67 [2018-12-08 20:48:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:30,555 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1125 transitions. [2018-12-08 20:48:30,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1125 transitions. [2018-12-08 20:48:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 20:48:30,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:30,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] [2018-12-08 20:48:30,556 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:30,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1861861007, now seen corresponding path program 1 times [2018-12-08 20:48:30,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:30,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:30,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:48:30,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:30,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:30,610 INFO L87 Difference]: Start difference. First operand 844 states and 1125 transitions. Second operand 12 states. [2018-12-08 20:48:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:30,750 INFO L93 Difference]: Finished difference Result 866 states and 1148 transitions. [2018-12-08 20:48:30,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:30,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-12-08 20:48:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:30,753 INFO L225 Difference]: With dead ends: 866 [2018-12-08 20:48:30,753 INFO L226 Difference]: Without dead ends: 842 [2018-12-08 20:48:30,753 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-08 20:48:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-12-08 20:48:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 837. [2018-12-08 20:48:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-12-08 20:48:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1113 transitions. [2018-12-08 20:48:30,785 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1113 transitions. Word has length 62 [2018-12-08 20:48:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:30,785 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1113 transitions. [2018-12-08 20:48:30,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1113 transitions. [2018-12-08 20:48:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 20:48:30,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:30,787 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-08 20:48:30,787 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:30,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2111220271, now seen corresponding path program 1 times [2018-12-08 20:48:30,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:30,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:30,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:30,802 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-08 20:48:30,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:30,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:30,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:30,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:30,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:30,803 INFO L87 Difference]: Start difference. First operand 837 states and 1113 transitions. Second operand 3 states. [2018-12-08 20:48:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:30,830 INFO L93 Difference]: Finished difference Result 1091 states and 1446 transitions. [2018-12-08 20:48:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:30,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-08 20:48:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:30,832 INFO L225 Difference]: With dead ends: 1091 [2018-12-08 20:48:30,832 INFO L226 Difference]: Without dead ends: 779 [2018-12-08 20:48:30,833 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-08 20:48:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-12-08 20:48:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 730. [2018-12-08 20:48:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-12-08 20:48:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 934 transitions. [2018-12-08 20:48:30,861 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 934 transitions. Word has length 62 [2018-12-08 20:48:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:30,862 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 934 transitions. [2018-12-08 20:48:30,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 934 transitions. [2018-12-08 20:48:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:48:30,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:30,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:30,863 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:30,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1496662402, now seen corresponding path program 1 times [2018-12-08 20:48:30,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:30,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:30,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:30,961 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-08 20:48:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:30,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 20:48:30,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:48:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:48:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:48:30,961 INFO L87 Difference]: Start difference. First operand 730 states and 934 transitions. Second operand 13 states. [2018-12-08 20:48:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:31,154 INFO L93 Difference]: Finished difference Result 747 states and 952 transitions. [2018-12-08 20:48:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:48:31,154 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-12-08 20:48:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:31,155 INFO L225 Difference]: With dead ends: 747 [2018-12-08 20:48:31,155 INFO L226 Difference]: Without dead ends: 719 [2018-12-08 20:48:31,156 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-08 20:48:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-12-08 20:48:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2018-12-08 20:48:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-12-08 20:48:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 919 transitions. [2018-12-08 20:48:31,182 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 919 transitions. Word has length 69 [2018-12-08 20:48:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:31,182 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 919 transitions. [2018-12-08 20:48:31,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:48:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 919 transitions. [2018-12-08 20:48:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 20:48:31,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:31,183 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-08 20:48:31,183 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:31,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1839036840, now seen corresponding path program 1 times [2018-12-08 20:48:31,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:31,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:31,269 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-08 20:48:31,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:31,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 20:48:31,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:48:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:48:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:48:31,270 INFO L87 Difference]: Start difference. First operand 719 states and 919 transitions. Second operand 13 states. [2018-12-08 20:48:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:31,420 INFO L93 Difference]: Finished difference Result 736 states and 937 transitions. [2018-12-08 20:48:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:48:31,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-12-08 20:48:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:31,421 INFO L225 Difference]: With dead ends: 736 [2018-12-08 20:48:31,422 INFO L226 Difference]: Without dead ends: 714 [2018-12-08 20:48:31,422 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-08 20:48:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-08 20:48:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-12-08 20:48:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-12-08 20:48:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 912 transitions. [2018-12-08 20:48:31,449 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 912 transitions. Word has length 63 [2018-12-08 20:48:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:31,449 INFO L480 AbstractCegarLoop]: Abstraction has 714 states and 912 transitions. [2018-12-08 20:48:31,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:48:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 912 transitions. [2018-12-08 20:48:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 20:48:31,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:31,450 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-08 20:48:31,450 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:31,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 81838798, now seen corresponding path program 1 times [2018-12-08 20:48:31,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:31,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:31,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:31,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:31,547 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-08 20:48:31,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:31,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 20:48:31,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:48:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:48:31,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:48:31,548 INFO L87 Difference]: Start difference. First operand 714 states and 912 transitions. Second operand 13 states. [2018-12-08 20:48:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:31,711 INFO L93 Difference]: Finished difference Result 731 states and 930 transitions. [2018-12-08 20:48:31,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:48:31,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-12-08 20:48:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:31,713 INFO L225 Difference]: With dead ends: 731 [2018-12-08 20:48:31,713 INFO L226 Difference]: Without dead ends: 706 [2018-12-08 20:48:31,713 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-08 20:48:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-12-08 20:48:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2018-12-08 20:48:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2018-12-08 20:48:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 902 transitions. [2018-12-08 20:48:31,739 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 902 transitions. Word has length 62 [2018-12-08 20:48:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:31,739 INFO L480 AbstractCegarLoop]: Abstraction has 706 states and 902 transitions. [2018-12-08 20:48:31,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:48:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 902 transitions. [2018-12-08 20:48:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 20:48:31,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:31,740 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-08 20:48:31,740 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:31,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1762030758, now seen corresponding path program 1 times [2018-12-08 20:48:31,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:31,788 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-08 20:48:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:31,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:31,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:31,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:31,789 INFO L87 Difference]: Start difference. First operand 706 states and 902 transitions. Second operand 5 states. [2018-12-08 20:48:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:32,035 INFO L93 Difference]: Finished difference Result 963 states and 1229 transitions. [2018-12-08 20:48:32,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:48:32,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 20:48:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:32,037 INFO L225 Difference]: With dead ends: 963 [2018-12-08 20:48:32,037 INFO L226 Difference]: Without dead ends: 826 [2018-12-08 20:48:32,038 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-08 20:48:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-12-08 20:48:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 747. [2018-12-08 20:48:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-08 20:48:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 953 transitions. [2018-12-08 20:48:32,072 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 953 transitions. Word has length 67 [2018-12-08 20:48:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:32,072 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 953 transitions. [2018-12-08 20:48:32,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 953 transitions. [2018-12-08 20:48:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 20:48:32,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:32,074 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-08 20:48:32,074 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:32,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2087229698, now seen corresponding path program 1 times [2018-12-08 20:48:32,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:32,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:32,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:32,090 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-08 20:48:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:32,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:32,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:32,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:32,091 INFO L87 Difference]: Start difference. First operand 747 states and 953 transitions. Second operand 3 states. [2018-12-08 20:48:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:32,148 INFO L93 Difference]: Finished difference Result 877 states and 1126 transitions. [2018-12-08 20:48:32,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:32,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-08 20:48:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:32,149 INFO L225 Difference]: With dead ends: 877 [2018-12-08 20:48:32,150 INFO L226 Difference]: Without dead ends: 747 [2018-12-08 20:48:32,150 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-08 20:48:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-08 20:48:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2018-12-08 20:48:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-12-08 20:48:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 950 transitions. [2018-12-08 20:48:32,193 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 950 transitions. Word has length 66 [2018-12-08 20:48:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:32,193 INFO L480 AbstractCegarLoop]: Abstraction has 747 states and 950 transitions. [2018-12-08 20:48:32,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 950 transitions. [2018-12-08 20:48:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 20:48:32,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:32,194 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-08 20:48:32,194 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:32,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:32,194 INFO L82 PathProgramCache]: Analyzing trace with hash -322329126, now seen corresponding path program 1 times [2018-12-08 20:48:32,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:32,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:32,224 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-08 20:48:32,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:32,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:32,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:32,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:32,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:32,224 INFO L87 Difference]: Start difference. First operand 747 states and 950 transitions. Second operand 5 states. [2018-12-08 20:48:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:32,267 INFO L93 Difference]: Finished difference Result 793 states and 997 transitions. [2018-12-08 20:48:32,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:32,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-08 20:48:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:32,268 INFO L225 Difference]: With dead ends: 793 [2018-12-08 20:48:32,268 INFO L226 Difference]: Without dead ends: 741 [2018-12-08 20:48:32,269 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-08 20:48:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-12-08 20:48:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2018-12-08 20:48:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-08 20:48:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 940 transitions. [2018-12-08 20:48:32,299 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 940 transitions. Word has length 65 [2018-12-08 20:48:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:32,299 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 940 transitions. [2018-12-08 20:48:32,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 940 transitions. [2018-12-08 20:48:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 20:48:32,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:32,300 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-08 20:48:32,300 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:32,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1568772173, now seen corresponding path program 1 times [2018-12-08 20:48:32,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:32,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:32,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:32,327 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-08 20:48:32,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:32,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:32,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:32,328 INFO L87 Difference]: Start difference. First operand 741 states and 940 transitions. Second operand 5 states. [2018-12-08 20:48:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:32,367 INFO L93 Difference]: Finished difference Result 775 states and 975 transitions. [2018-12-08 20:48:32,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:32,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-08 20:48:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:32,369 INFO L225 Difference]: With dead ends: 775 [2018-12-08 20:48:32,369 INFO L226 Difference]: Without dead ends: 736 [2018-12-08 20:48:32,369 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-08 20:48:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-12-08 20:48:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2018-12-08 20:48:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-08 20:48:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 933 transitions. [2018-12-08 20:48:32,399 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 933 transitions. Word has length 67 [2018-12-08 20:48:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:32,399 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 933 transitions. [2018-12-08 20:48:32,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:32,400 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 933 transitions. [2018-12-08 20:48:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 20:48:32,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:32,400 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-08 20:48:32,400 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:32,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1402336471, now seen corresponding path program 1 times [2018-12-08 20:48:32,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:32,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:32,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:32,431 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-08 20:48:32,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:32,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:32,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:32,432 INFO L87 Difference]: Start difference. First operand 736 states and 933 transitions. Second operand 5 states. [2018-12-08 20:48:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:32,637 INFO L93 Difference]: Finished difference Result 802 states and 1018 transitions. [2018-12-08 20:48:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:32,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-08 20:48:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:32,638 INFO L225 Difference]: With dead ends: 802 [2018-12-08 20:48:32,638 INFO L226 Difference]: Without dead ends: 793 [2018-12-08 20:48:32,639 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-08 20:48:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-12-08 20:48:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 736. [2018-12-08 20:48:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-08 20:48:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 931 transitions. [2018-12-08 20:48:32,671 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 931 transitions. Word has length 68 [2018-12-08 20:48:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:32,671 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 931 transitions. [2018-12-08 20:48:32,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 931 transitions. [2018-12-08 20:48:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 20:48:32,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:32,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:32,672 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:32,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:32,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1734361953, now seen corresponding path program 1 times [2018-12-08 20:48:32,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:32,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:32,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:32,729 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-08 20:48:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:48:32,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:48:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:48:32,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:48:32,729 INFO L87 Difference]: Start difference. First operand 736 states and 931 transitions. Second operand 7 states. [2018-12-08 20:48:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:32,810 INFO L93 Difference]: Finished difference Result 782 states and 981 transitions. [2018-12-08 20:48:32,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:48:32,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-08 20:48:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:32,812 INFO L225 Difference]: With dead ends: 782 [2018-12-08 20:48:32,812 INFO L226 Difference]: Without dead ends: 742 [2018-12-08 20:48:32,813 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-08 20:48:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-08 20:48:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-12-08 20:48:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-12-08 20:48:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 935 transitions. [2018-12-08 20:48:32,852 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 935 transitions. Word has length 74 [2018-12-08 20:48:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:32,852 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 935 transitions. [2018-12-08 20:48:32,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:48:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 935 transitions. [2018-12-08 20:48:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 20:48:32,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:32,853 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-08 20:48:32,853 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:32,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash 127484813, now seen corresponding path program 1 times [2018-12-08 20:48:32,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:32,925 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-08 20:48:32,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:32,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:48:32,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:48:32,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:48:32,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:48:32,926 INFO L87 Difference]: Start difference. First operand 740 states and 935 transitions. Second operand 12 states. [2018-12-08 20:48:33,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:33,037 INFO L93 Difference]: Finished difference Result 763 states and 959 transitions. [2018-12-08 20:48:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:48:33,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-08 20:48:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:33,039 INFO L225 Difference]: With dead ends: 763 [2018-12-08 20:48:33,039 INFO L226 Difference]: Without dead ends: 740 [2018-12-08 20:48:33,040 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-08 20:48:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-12-08 20:48:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 740. [2018-12-08 20:48:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-12-08 20:48:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 934 transitions. [2018-12-08 20:48:33,073 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 934 transitions. Word has length 70 [2018-12-08 20:48:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:33,073 INFO L480 AbstractCegarLoop]: Abstraction has 740 states and 934 transitions. [2018-12-08 20:48:33,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:48:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 934 transitions. [2018-12-08 20:48:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 20:48:33,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:33,074 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-08 20:48:33,074 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:33,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:33,075 INFO L82 PathProgramCache]: Analyzing trace with hash 829084687, now seen corresponding path program 1 times [2018-12-08 20:48:33,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:33,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:33,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:33,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:33,150 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-08 20:48:33,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:33,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:48:33,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:48:33,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:48:33,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:33,151 INFO L87 Difference]: Start difference. First operand 740 states and 934 transitions. Second operand 14 states. [2018-12-08 20:48:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:33,309 INFO L93 Difference]: Finished difference Result 764 states and 960 transitions. [2018-12-08 20:48:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:33,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-08 20:48:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:33,310 INFO L225 Difference]: With dead ends: 764 [2018-12-08 20:48:33,310 INFO L226 Difference]: Without dead ends: 736 [2018-12-08 20:48:33,311 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-08 20:48:33,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-12-08 20:48:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2018-12-08 20:48:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-08 20:48:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 928 transitions. [2018-12-08 20:48:33,349 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 928 transitions. Word has length 70 [2018-12-08 20:48:33,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:33,349 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 928 transitions. [2018-12-08 20:48:33,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:48:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 928 transitions. [2018-12-08 20:48:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:48:33,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:33,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:33,350 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:33,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash 77291112, now seen corresponding path program 1 times [2018-12-08 20:48:33,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:33,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:33,371 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-08 20:48:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:33,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:33,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:33,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:33,372 INFO L87 Difference]: Start difference. First operand 736 states and 928 transitions. Second operand 5 states. [2018-12-08 20:48:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:33,414 INFO L93 Difference]: Finished difference Result 770 states and 963 transitions. [2018-12-08 20:48:33,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:33,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 20:48:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:33,415 INFO L225 Difference]: With dead ends: 770 [2018-12-08 20:48:33,415 INFO L226 Difference]: Without dead ends: 731 [2018-12-08 20:48:33,415 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-08 20:48:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-08 20:48:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-08 20:48:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-08 20:48:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 921 transitions. [2018-12-08 20:48:33,446 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 921 transitions. Word has length 69 [2018-12-08 20:48:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:33,446 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 921 transitions. [2018-12-08 20:48:33,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 921 transitions. [2018-12-08 20:48:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:48:33,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:33,447 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-08 20:48:33,447 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:33,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1952246579, now seen corresponding path program 1 times [2018-12-08 20:48:33,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:33,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:33,503 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-08 20:48:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:48:33,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:48:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:48:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:48:33,504 INFO L87 Difference]: Start difference. First operand 731 states and 921 transitions. Second operand 11 states. [2018-12-08 20:48:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:33,599 INFO L93 Difference]: Finished difference Result 758 states and 951 transitions. [2018-12-08 20:48:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:48:33,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-08 20:48:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:33,601 INFO L225 Difference]: With dead ends: 758 [2018-12-08 20:48:33,601 INFO L226 Difference]: Without dead ends: 728 [2018-12-08 20:48:33,601 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-08 20:48:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-08 20:48:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2018-12-08 20:48:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-12-08 20:48:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 916 transitions. [2018-12-08 20:48:33,642 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 916 transitions. Word has length 69 [2018-12-08 20:48:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:33,642 INFO L480 AbstractCegarLoop]: Abstraction has 728 states and 916 transitions. [2018-12-08 20:48:33,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:48:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 916 transitions. [2018-12-08 20:48:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:48:33,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:33,643 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-08 20:48:33,643 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:33,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083894, now seen corresponding path program 1 times [2018-12-08 20:48:33,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:33,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:33,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-08 20:48:33,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:33,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:48:33,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:48:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:48:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:48:33,725 INFO L87 Difference]: Start difference. First operand 728 states and 916 transitions. Second operand 11 states. [2018-12-08 20:48:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:33,866 INFO L93 Difference]: Finished difference Result 738 states and 925 transitions. [2018-12-08 20:48:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:48:33,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-12-08 20:48:33,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:33,867 INFO L225 Difference]: With dead ends: 738 [2018-12-08 20:48:33,867 INFO L226 Difference]: Without dead ends: 732 [2018-12-08 20:48:33,868 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-08 20:48:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-12-08 20:48:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 725. [2018-12-08 20:48:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-08 20:48:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 909 transitions. [2018-12-08 20:48:33,898 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 909 transitions. Word has length 69 [2018-12-08 20:48:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:33,898 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 909 transitions. [2018-12-08 20:48:33,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:48:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 909 transitions. [2018-12-08 20:48:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:48:33,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:33,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:33,899 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:33,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1163360724, now seen corresponding path program 1 times [2018-12-08 20:48:33,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:33,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:33,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:33,921 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-08 20:48:33,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:33,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:33,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:33,921 INFO L87 Difference]: Start difference. First operand 725 states and 909 transitions. Second operand 5 states. [2018-12-08 20:48:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,156 INFO L93 Difference]: Finished difference Result 785 states and 988 transitions. [2018-12-08 20:48:34,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:34,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-08 20:48:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,157 INFO L225 Difference]: With dead ends: 785 [2018-12-08 20:48:34,157 INFO L226 Difference]: Without dead ends: 750 [2018-12-08 20:48:34,158 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-08 20:48:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-12-08 20:48:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 696. [2018-12-08 20:48:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-08 20:48:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 873 transitions. [2018-12-08 20:48:34,189 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 873 transitions. Word has length 69 [2018-12-08 20:48:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,189 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 873 transitions. [2018-12-08 20:48:34,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 873 transitions. [2018-12-08 20:48:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:48:34,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,191 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-08 20:48:34,191 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1070160589, now seen corresponding path program 1 times [2018-12-08 20:48:34,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:34,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,211 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-08 20:48:34,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:48:34,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:48:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:48:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:48:34,212 INFO L87 Difference]: Start difference. First operand 696 states and 873 transitions. Second operand 3 states. [2018-12-08 20:48:34,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,254 INFO L93 Difference]: Finished difference Result 722 states and 903 transitions. [2018-12-08 20:48:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:48:34,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 20:48:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,255 INFO L225 Difference]: With dead ends: 722 [2018-12-08 20:48:34,255 INFO L226 Difference]: Without dead ends: 682 [2018-12-08 20:48:34,256 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-08 20:48:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-08 20:48:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 678. [2018-12-08 20:48:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2018-12-08 20:48:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 848 transitions. [2018-12-08 20:48:34,287 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 848 transitions. Word has length 69 [2018-12-08 20:48:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,287 INFO L480 AbstractCegarLoop]: Abstraction has 678 states and 848 transitions. [2018-12-08 20:48:34,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:48:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 848 transitions. [2018-12-08 20:48:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 20:48:34,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,288 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-08 20:48:34,288 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1859005469, now seen corresponding path program 1 times [2018-12-08 20:48:34,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:34,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,374 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-08 20:48:34,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:48:34,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:48:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:48:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:34,375 INFO L87 Difference]: Start difference. First operand 678 states and 848 transitions. Second operand 14 states. [2018-12-08 20:48:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,504 INFO L93 Difference]: Finished difference Result 700 states and 871 transitions. [2018-12-08 20:48:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:34,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-12-08 20:48:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,505 INFO L225 Difference]: With dead ends: 700 [2018-12-08 20:48:34,505 INFO L226 Difference]: Without dead ends: 668 [2018-12-08 20:48:34,506 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-08 20:48:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-12-08 20:48:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2018-12-08 20:48:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-12-08 20:48:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 833 transitions. [2018-12-08 20:48:34,534 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 833 transitions. Word has length 74 [2018-12-08 20:48:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,534 INFO L480 AbstractCegarLoop]: Abstraction has 668 states and 833 transitions. [2018-12-08 20:48:34,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:48:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 833 transitions. [2018-12-08 20:48:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 20:48:34,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,535 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-08 20:48:34,535 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash -81188571, now seen corresponding path program 1 times [2018-12-08 20:48:34,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:34,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:34,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:48:34,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:48:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:48:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:34,606 INFO L87 Difference]: Start difference. First operand 668 states and 833 transitions. Second operand 14 states. [2018-12-08 20:48:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,736 INFO L93 Difference]: Finished difference Result 732 states and 901 transitions. [2018-12-08 20:48:34,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:34,736 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-08 20:48:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,737 INFO L225 Difference]: With dead ends: 732 [2018-12-08 20:48:34,737 INFO L226 Difference]: Without dead ends: 662 [2018-12-08 20:48:34,737 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-08 20:48:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-12-08 20:48:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2018-12-08 20:48:34,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-12-08 20:48:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 824 transitions. [2018-12-08 20:48:34,765 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 824 transitions. Word has length 71 [2018-12-08 20:48:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,765 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 824 transitions. [2018-12-08 20:48:34,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:48:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 824 transitions. [2018-12-08 20:48:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 20:48:34,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,766 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-08 20:48:34,766 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,767 INFO L82 PathProgramCache]: Analyzing trace with hash -37760830, now seen corresponding path program 1 times [2018-12-08 20:48:34,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,790 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-08 20:48:34,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:34,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:34,791 INFO L87 Difference]: Start difference. First operand 662 states and 824 transitions. Second operand 5 states. [2018-12-08 20:48:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:34,830 INFO L93 Difference]: Finished difference Result 709 states and 873 transitions. [2018-12-08 20:48:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:34,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-08 20:48:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:34,832 INFO L225 Difference]: With dead ends: 709 [2018-12-08 20:48:34,832 INFO L226 Difference]: Without dead ends: 666 [2018-12-08 20:48:34,832 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-08 20:48:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-08 20:48:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 662. [2018-12-08 20:48:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-12-08 20:48:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 823 transitions. [2018-12-08 20:48:34,860 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 823 transitions. Word has length 71 [2018-12-08 20:48:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:34,860 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 823 transitions. [2018-12-08 20:48:34,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 823 transitions. [2018-12-08 20:48:34,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 20:48:34,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:34,861 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-08 20:48:34,861 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:34,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:34,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2013223168, now seen corresponding path program 1 times [2018-12-08 20:48:34,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:34,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:34,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:34,943 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-08 20:48:34,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:34,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:48:34,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:48:34,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:48:34,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:34,943 INFO L87 Difference]: Start difference. First operand 662 states and 823 transitions. Second operand 14 states. [2018-12-08 20:48:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,067 INFO L93 Difference]: Finished difference Result 686 states and 849 transitions. [2018-12-08 20:48:35,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:35,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-12-08 20:48:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,068 INFO L225 Difference]: With dead ends: 686 [2018-12-08 20:48:35,068 INFO L226 Difference]: Without dead ends: 655 [2018-12-08 20:48:35,068 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-08 20:48:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-08 20:48:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-12-08 20:48:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-12-08 20:48:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 813 transitions. [2018-12-08 20:48:35,096 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 813 transitions. Word has length 71 [2018-12-08 20:48:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,096 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 813 transitions. [2018-12-08 20:48:35,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:48:35,097 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 813 transitions. [2018-12-08 20:48:35,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:48:35,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,097 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-08 20:48:35,097 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1067828418, now seen corresponding path program 1 times [2018-12-08 20:48:35,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:35,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:35,147 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-08 20:48:35,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:35,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:48:35,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:48:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:48:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:48:35,147 INFO L87 Difference]: Start difference. First operand 655 states and 813 transitions. Second operand 7 states. [2018-12-08 20:48:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,216 INFO L93 Difference]: Finished difference Result 709 states and 874 transitions. [2018-12-08 20:48:35,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:48:35,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-08 20:48:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,217 INFO L225 Difference]: With dead ends: 709 [2018-12-08 20:48:35,217 INFO L226 Difference]: Without dead ends: 653 [2018-12-08 20:48:35,217 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-08 20:48:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-12-08 20:48:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2018-12-08 20:48:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-12-08 20:48:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 803 transitions. [2018-12-08 20:48:35,245 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 803 transitions. Word has length 77 [2018-12-08 20:48:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,245 INFO L480 AbstractCegarLoop]: Abstraction has 649 states and 803 transitions. [2018-12-08 20:48:35,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:48:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 803 transitions. [2018-12-08 20:48:35,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:48:35,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:48:35,246 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash -366228544, now seen corresponding path program 1 times [2018-12-08 20:48:35,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:35,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:35,324 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-08 20:48:35,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:35,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:48:35,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:48:35,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:48:35,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:35,324 INFO L87 Difference]: Start difference. First operand 649 states and 803 transitions. Second operand 14 states. [2018-12-08 20:48:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,457 INFO L93 Difference]: Finished difference Result 675 states and 831 transitions. [2018-12-08 20:48:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:35,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2018-12-08 20:48:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,458 INFO L225 Difference]: With dead ends: 675 [2018-12-08 20:48:35,458 INFO L226 Difference]: Without dead ends: 651 [2018-12-08 20:48:35,458 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-08 20:48:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-08 20:48:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 647. [2018-12-08 20:48:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-12-08 20:48:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 799 transitions. [2018-12-08 20:48:35,486 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 799 transitions. Word has length 77 [2018-12-08 20:48:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,486 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 799 transitions. [2018-12-08 20:48:35,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:48:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 799 transitions. [2018-12-08 20:48:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 20:48:35,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,487 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-08 20:48:35,487 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash -615466654, now seen corresponding path program 1 times [2018-12-08 20:48:35,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:35,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:35,564 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-08 20:48:35,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:35,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:48:35,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:48:35,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:48:35,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:48:35,565 INFO L87 Difference]: Start difference. First operand 647 states and 799 transitions. Second operand 14 states. [2018-12-08 20:48:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,746 INFO L93 Difference]: Finished difference Result 706 states and 861 transitions. [2018-12-08 20:48:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:48:35,747 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-12-08 20:48:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,749 INFO L225 Difference]: With dead ends: 706 [2018-12-08 20:48:35,749 INFO L226 Difference]: Without dead ends: 635 [2018-12-08 20:48:35,750 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-08 20:48:35,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-12-08 20:48:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2018-12-08 20:48:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-12-08 20:48:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 780 transitions. [2018-12-08 20:48:35,790 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 780 transitions. Word has length 72 [2018-12-08 20:48:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,790 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 780 transitions. [2018-12-08 20:48:35,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:48:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 780 transitions. [2018-12-08 20:48:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 20:48:35,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,791 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-08 20:48:35,791 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2025859791, now seen corresponding path program 1 times [2018-12-08 20:48:35,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:35,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:35,841 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-08 20:48:35,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:35,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:48:35,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:48:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:48:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:48:35,841 INFO L87 Difference]: Start difference. First operand 635 states and 780 transitions. Second operand 11 states. [2018-12-08 20:48:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:35,932 INFO L93 Difference]: Finished difference Result 826 states and 1007 transitions. [2018-12-08 20:48:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 20:48:35,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-12-08 20:48:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:35,933 INFO L225 Difference]: With dead ends: 826 [2018-12-08 20:48:35,933 INFO L226 Difference]: Without dead ends: 677 [2018-12-08 20:48:35,934 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-08 20:48:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-12-08 20:48:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 641. [2018-12-08 20:48:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-12-08 20:48:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 782 transitions. [2018-12-08 20:48:35,962 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 782 transitions. Word has length 71 [2018-12-08 20:48:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:35,962 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 782 transitions. [2018-12-08 20:48:35,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:48:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 782 transitions. [2018-12-08 20:48:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 20:48:35,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:35,962 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-08 20:48:35,963 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:35,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:35,963 INFO L82 PathProgramCache]: Analyzing trace with hash -253233342, now seen corresponding path program 1 times [2018-12-08 20:48:35,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:35,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:36,056 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-08 20:48:36,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:36,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 20:48:36,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:48:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:48:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:48:36,057 INFO L87 Difference]: Start difference. First operand 641 states and 782 transitions. Second operand 13 states. [2018-12-08 20:48:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:36,228 INFO L93 Difference]: Finished difference Result 661 states and 803 transitions. [2018-12-08 20:48:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:48:36,229 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-12-08 20:48:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:36,231 INFO L225 Difference]: With dead ends: 661 [2018-12-08 20:48:36,231 INFO L226 Difference]: Without dead ends: 639 [2018-12-08 20:48:36,232 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-08 20:48:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-08 20:48:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-12-08 20:48:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-12-08 20:48:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 778 transitions. [2018-12-08 20:48:36,271 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 778 transitions. Word has length 72 [2018-12-08 20:48:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:36,271 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 778 transitions. [2018-12-08 20:48:36,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:48:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 778 transitions. [2018-12-08 20:48:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 20:48:36,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:36,273 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-08 20:48:36,273 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:36,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1632556457, now seen corresponding path program 1 times [2018-12-08 20:48:36,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:36,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:36,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:36,329 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-08 20:48:36,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:36,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:48:36,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:48:36,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:48:36,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:48:36,329 INFO L87 Difference]: Start difference. First operand 639 states and 778 transitions. Second operand 10 states. [2018-12-08 20:48:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:37,245 INFO L93 Difference]: Finished difference Result 1323 states and 1604 transitions. [2018-12-08 20:48:37,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 20:48:37,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-12-08 20:48:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:37,247 INFO L225 Difference]: With dead ends: 1323 [2018-12-08 20:48:37,247 INFO L226 Difference]: Without dead ends: 1176 [2018-12-08 20:48:37,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:48:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2018-12-08 20:48:37,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1035. [2018-12-08 20:48:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-12-08 20:48:37,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1282 transitions. [2018-12-08 20:48:37,296 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1282 transitions. Word has length 73 [2018-12-08 20:48:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:37,296 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1282 transitions. [2018-12-08 20:48:37,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:48:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1282 transitions. [2018-12-08 20:48:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 20:48:37,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:37,297 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-08 20:48:37,297 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:37,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:37,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1983138585, now seen corresponding path program 1 times [2018-12-08 20:48:37,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:37,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:37,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:37,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:37,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:48:37,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:37,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:48:37,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:48:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:48:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:48:37,332 INFO L87 Difference]: Start difference. First operand 1035 states and 1282 transitions. Second operand 6 states. [2018-12-08 20:48:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:37,765 INFO L93 Difference]: Finished difference Result 1321 states and 1596 transitions. [2018-12-08 20:48:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:48:37,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-12-08 20:48:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:37,767 INFO L225 Difference]: With dead ends: 1321 [2018-12-08 20:48:37,767 INFO L226 Difference]: Without dead ends: 1191 [2018-12-08 20:48:37,767 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-08 20:48:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-12-08 20:48:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1115. [2018-12-08 20:48:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-08 20:48:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1373 transitions. [2018-12-08 20:48:37,847 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1373 transitions. Word has length 73 [2018-12-08 20:48:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:37,847 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1373 transitions. [2018-12-08 20:48:37,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:48:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1373 transitions. [2018-12-08 20:48:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 20:48:37,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:37,848 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-08 20:48:37,848 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:37,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1013991573, now seen corresponding path program 1 times [2018-12-08 20:48:37,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:37,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:37,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:48:37,867 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-08 20:48:37,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:48:37,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:48:37,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:48:37,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:48:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:48:37,868 INFO L87 Difference]: Start difference. First operand 1115 states and 1373 transitions. Second operand 5 states. [2018-12-08 20:48:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:48:37,924 INFO L93 Difference]: Finished difference Result 1160 states and 1421 transitions. [2018-12-08 20:48:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:48:37,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-08 20:48:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:48:37,925 INFO L225 Difference]: With dead ends: 1160 [2018-12-08 20:48:37,926 INFO L226 Difference]: Without dead ends: 1099 [2018-12-08 20:48:37,926 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-08 20:48:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-12-08 20:48:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2018-12-08 20:48:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2018-12-08 20:48:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1349 transitions. [2018-12-08 20:48:37,987 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1349 transitions. Word has length 73 [2018-12-08 20:48:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:48:37,987 INFO L480 AbstractCegarLoop]: Abstraction has 1099 states and 1349 transitions. [2018-12-08 20:48:37,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:48:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1349 transitions. [2018-12-08 20:48:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 20:48:37,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:48:37,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 20:48:37,988 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:48:37,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:48:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1533375131, now seen corresponding path program 1 times [2018-12-08 20:48:37,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:48:37,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:48:37,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:37,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:48:37,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:48:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:48:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:48:38,043 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 20:48:38,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:48:38 BoogieIcfgContainer [2018-12-08 20:48:38,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:48:38,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:48:38,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:48:38,120 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:48:38,120 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:48:20" (3/4) ... [2018-12-08 20:48:38,122 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 20:48:38,192 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5c28034d-1942-4277-99dd-76a55b1c6ef4/bin-2019/uautomizer/witness.graphml [2018-12-08 20:48:38,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:48:38,193 INFO L168 Benchmark]: Toolchain (without parser) took 19187.83 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 758.1 MB). Free memory was 953.9 MB in the beginning and 1.6 GB in the end (delta: -606.0 MB). Peak memory consumption was 152.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:48:38,194 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:48:38,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -99.3 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2018-12-08 20:48:38,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.87 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-08 20:48:38,194 INFO L168 Benchmark]: Boogie Preprocessor took 40.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:48:38,194 INFO L168 Benchmark]: RCFGBuilder took 718.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 899.1 MB in the end (delta: 146.7 MB). Peak memory consumption was 146.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:48:38,195 INFO L168 Benchmark]: TraceAbstraction took 17954.90 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 685.8 MB). Free memory was 899.1 MB in the beginning and 1.6 GB in the end (delta: -681.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2018-12-08 20:48:38,195 INFO L168 Benchmark]: Witness Printer took 72.17 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:48:38,196 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.4 MB). Free memory was 953.9 MB in the beginning and 1.1 GB in the end (delta: -99.3 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 718.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 899.1 MB in the end (delta: 146.7 MB). Peak memory consumption was 146.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17954.90 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 685.8 MB). Free memory was 899.1 MB in the beginning and 1.6 GB in the end (delta: -681.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Witness Printer took 72.17 ms. Allocated memory is still 1.8 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 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.9s OverallTime, 67 OverallIterations, 1 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39232 SDtfs, 17811 SDslu, 166302 SDs, 0 SdLazy, 14165 SolverSat, 2942 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 154 SyntacticMatches, 7 SemanticMatches, 480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1115occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 66 MinimizatonAttempts, 2286 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 3948 NumberOfCodeBlocks, 3948 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3809 ConstructedInterpolants, 0 QuantifiedInterpolants, 502683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 66 InterpolantComputations, 66 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...