./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/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_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/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-0cd3be1 [2018-11-28 11:44:11,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:44:11,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:44:11,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:44:11,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:44:11,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:44:11,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:44:11,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:44:11,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:44:11,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:44:11,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:44:11,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:44:11,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:44:11,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:44:11,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:44:11,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:44:11,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:44:11,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:44:11,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:44:11,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:44:11,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:44:11,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:44:11,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:44:11,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:44:11,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:44:11,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:44:11,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:44:11,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:44:11,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:44:11,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:44:11,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:44:11,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:44:11,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:44:11,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:44:11,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:44:11,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:44:11,668 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:44:11,678 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:44:11,678 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:44:11,679 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:44:11,679 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:44:11,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:44:11,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:44:11,680 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:44:11,680 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:44:11,680 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:44:11,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:44:11,680 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:44:11,681 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:44:11,682 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:44:11,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:44:11,682 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:44:11,682 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:44:11,682 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:44:11,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:44:11,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:44:11,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:44:11,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:44:11,683 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:44:11,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:44:11,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:44:11,683 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_b3d0ff04-b11d-46f5-adc2-7817e08258ab/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-11-28 11:44:11,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:44:11,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:44:11,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:44:11,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:44:11,721 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:44:11,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 11:44:11,763 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/data/e6d790e07/275b92dcb40649eeb1a3a1d647fb949a/FLAGef67799ba [2018-11-28 11:44:12,215 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:44:12,215 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 11:44:12,226 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/data/e6d790e07/275b92dcb40649eeb1a3a1d647fb949a/FLAGef67799ba [2018-11-28 11:44:12,237 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/data/e6d790e07/275b92dcb40649eeb1a3a1d647fb949a [2018-11-28 11:44:12,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:44:12,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:44:12,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:44:12,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:44:12,244 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:44:12,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40193277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12, skipping insertion in model container [2018-11-28 11:44:12,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:44:12,296 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:44:12,541 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:44:12,545 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:44:12,668 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:44:12,684 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:44:12,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12 WrapperNode [2018-11-28 11:44:12,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:44:12,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:44:12,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:44:12,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:44:12,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:44:12,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:44:12,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:44:12,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:44:12,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... [2018-11-28 11:44:12,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:44:12,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:44:12,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:44:12,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:44:12,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/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-11-28 11:44:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-28 11:44:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-28 11:44:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-28 11:44:12,833 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-28 11:44:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2018-11-28 11:44:12,833 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2018-11-28 11:44:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-28 11:44:12,833 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-28 11:44:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:44:12,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:44:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-28 11:44:12,833 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-28 11:44:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-28 11:44:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-28 11:44:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-28 11:44:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-28 11:44:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-28 11:44:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-28 11:44:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-28 11:44:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-28 11:44:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-28 11:44:12,834 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-28 11:44:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-28 11:44:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-28 11:44:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-28 11:44:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-28 11:44:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-28 11:44:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-28 11:44:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-28 11:44:12,835 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-28 11:44:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-28 11:44:12,836 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-28 11:44:12,836 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-28 11:44:12,836 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-28 11:44:12,836 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-28 11:44:12,836 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-28 11:44:12,836 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-28 11:44:12,836 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-28 11:44:12,836 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-28 11:44:12,836 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-28 11:44:12,836 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-28 11:44:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-28 11:44:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-28 11:44:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-28 11:44:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:44:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:44:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-28 11:44:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-28 11:44:12,837 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-28 11:44:12,837 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-28 11:44:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:44:12,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:44:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-28 11:44:12,838 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-28 11:44:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2018-11-28 11:44:12,838 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2018-11-28 11:44:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-28 11:44:12,838 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-28 11:44:12,838 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-28 11:44:12,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-28 11:44:13,122 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,122 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,186 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,186 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,261 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,262 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,322 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,323 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,369 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,370 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,567 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,567 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,602 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,602 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,621 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,621 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,753 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 11:44:13,753 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 11:44:13,767 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:44:13,767 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 11:44:13,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:13 BoogieIcfgContainer [2018-11-28 11:44:13,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:44:13,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:44:13,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:44:13,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:44:13,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:44:12" (1/3) ... [2018-11-28 11:44:13,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62388fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:44:13, skipping insertion in model container [2018-11-28 11:44:13,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:12" (2/3) ... [2018-11-28 11:44:13,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62388fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:44:13, skipping insertion in model container [2018-11-28 11:44:13,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:13" (3/3) ... [2018-11-28 11:44:13,773 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1_false-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-11-28 11:44:13,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:44:13,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:44:13,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:44:13,820 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:44:13,820 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:44:13,820 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:44:13,821 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:44:13,821 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:44:13,821 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:44:13,821 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:44:13,821 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:44:13,821 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:44:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2018-11-28 11:44:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 11:44:13,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:13,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:13,851 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:13,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:13,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1098408584, now seen corresponding path program 1 times [2018-11-28 11:44:13,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:13,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:13,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:13,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:14,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:14,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:14,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:14,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:14,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:14,032 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 3 states. [2018-11-28 11:44:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:14,169 INFO L93 Difference]: Finished difference Result 891 states and 1381 transitions. [2018-11-28 11:44:14,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:14,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-28 11:44:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:14,180 INFO L225 Difference]: With dead ends: 891 [2018-11-28 11:44:14,180 INFO L226 Difference]: Without dead ends: 509 [2018-11-28 11:44:14,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-11-28 11:44:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2018-11-28 11:44:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-11-28 11:44:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 740 transitions. [2018-11-28 11:44:14,243 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 740 transitions. Word has length 20 [2018-11-28 11:44:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:14,244 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 740 transitions. [2018-11-28 11:44:14,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 740 transitions. [2018-11-28 11:44:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:44:14,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:14,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:14,245 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:14,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1051395834, now seen corresponding path program 1 times [2018-11-28 11:44:14,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:14,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:14,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:14,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:14,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:14,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:14,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:14,361 INFO L87 Difference]: Start difference. First operand 509 states and 740 transitions. Second operand 3 states. [2018-11-28 11:44:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:14,619 INFO L93 Difference]: Finished difference Result 795 states and 1126 transitions. [2018-11-28 11:44:14,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:14,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 11:44:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:14,623 INFO L225 Difference]: With dead ends: 795 [2018-11-28 11:44:14,624 INFO L226 Difference]: Without dead ends: 674 [2018-11-28 11:44:14,625 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-11-28 11:44:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-11-28 11:44:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 654. [2018-11-28 11:44:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-28 11:44:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 934 transitions. [2018-11-28 11:44:14,653 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 934 transitions. Word has length 25 [2018-11-28 11:44:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:14,654 INFO L480 AbstractCegarLoop]: Abstraction has 654 states and 934 transitions. [2018-11-28 11:44:14,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 934 transitions. [2018-11-28 11:44:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:44:14,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:14,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:14,656 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:14,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash 880506904, now seen corresponding path program 1 times [2018-11-28 11:44:14,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:14,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:14,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:14,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:14,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-11-28 11:44:14,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:14,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:14,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:14,730 INFO L87 Difference]: Start difference. First operand 654 states and 934 transitions. Second operand 3 states. [2018-11-28 11:44:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:14,779 INFO L93 Difference]: Finished difference Result 1001 states and 1387 transitions. [2018-11-28 11:44:14,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:14,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 11:44:14,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:14,785 INFO L225 Difference]: With dead ends: 1001 [2018-11-28 11:44:14,785 INFO L226 Difference]: Without dead ends: 823 [2018-11-28 11:44:14,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-11-28 11:44:14,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 769. [2018-11-28 11:44:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-11-28 11:44:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1094 transitions. [2018-11-28 11:44:14,828 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1094 transitions. Word has length 30 [2018-11-28 11:44:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:14,828 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1094 transitions. [2018-11-28 11:44:14,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1094 transitions. [2018-11-28 11:44:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 11:44:14,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:14,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:14,831 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:14,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2133514060, now seen corresponding path program 1 times [2018-11-28 11:44:14,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:14,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:14,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:14,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:14,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:14,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:14,872 INFO L87 Difference]: Start difference. First operand 769 states and 1094 transitions. Second operand 3 states. [2018-11-28 11:44:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:15,099 INFO L93 Difference]: Finished difference Result 1430 states and 2101 transitions. [2018-11-28 11:44:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:15,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 11:44:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:15,109 INFO L225 Difference]: With dead ends: 1430 [2018-11-28 11:44:15,109 INFO L226 Difference]: Without dead ends: 1164 [2018-11-28 11:44:15,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-11-28 11:44:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 901. [2018-11-28 11:44:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-11-28 11:44:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-11-28 11:44:15,155 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 31 [2018-11-28 11:44:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:15,155 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-11-28 11:44:15,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-11-28 11:44:15,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 11:44:15,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:15,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:15,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:15,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1952820015, now seen corresponding path program 1 times [2018-11-28 11:44:15,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:15,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:15,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:15,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:15,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:15,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:15,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:15,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:15,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:15,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:15,222 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-11-28 11:44:15,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:15,819 INFO L93 Difference]: Finished difference Result 1570 states and 2317 transitions. [2018-11-28 11:44:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:44:15,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-28 11:44:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:15,827 INFO L225 Difference]: With dead ends: 1570 [2018-11-28 11:44:15,827 INFO L226 Difference]: Without dead ends: 990 [2018-11-28 11:44:15,829 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-11-28 11:44:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-11-28 11:44:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 889. [2018-11-28 11:44:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-11-28 11:44:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1302 transitions. [2018-11-28 11:44:15,858 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1302 transitions. Word has length 32 [2018-11-28 11:44:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:15,858 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1302 transitions. [2018-11-28 11:44:15,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1302 transitions. [2018-11-28 11:44:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:44:15,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:15,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:15,860 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:15,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash -950761943, now seen corresponding path program 1 times [2018-11-28 11:44:15,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:15,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:15,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:15,911 INFO L87 Difference]: Start difference. First operand 889 states and 1302 transitions. Second operand 3 states. [2018-11-28 11:44:15,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:15,968 INFO L93 Difference]: Finished difference Result 892 states and 1304 transitions. [2018-11-28 11:44:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:15,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 11:44:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:15,971 INFO L225 Difference]: With dead ends: 892 [2018-11-28 11:44:15,971 INFO L226 Difference]: Without dead ends: 888 [2018-11-28 11:44:15,972 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-11-28 11:44:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-28 11:44:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-11-28 11:44:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-28 11:44:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1299 transitions. [2018-11-28 11:44:15,997 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1299 transitions. Word has length 36 [2018-11-28 11:44:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:15,997 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1299 transitions. [2018-11-28 11:44:15,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1299 transitions. [2018-11-28 11:44:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:44:15,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:15,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] [2018-11-28 11:44:15,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:15,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash -826026373, now seen corresponding path program 1 times [2018-11-28 11:44:15,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:15,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:16,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-11-28 11:44:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:16,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,031 INFO L87 Difference]: Start difference. First operand 888 states and 1299 transitions. Second operand 3 states. [2018-11-28 11:44:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:16,081 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2018-11-28 11:44:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:16,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-28 11:44:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:16,084 INFO L225 Difference]: With dead ends: 1280 [2018-11-28 11:44:16,084 INFO L226 Difference]: Without dead ends: 1019 [2018-11-28 11:44:16,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2018-11-28 11:44:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 874. [2018-11-28 11:44:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-28 11:44:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1241 transitions. [2018-11-28 11:44:16,111 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1241 transitions. Word has length 39 [2018-11-28 11:44:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:16,111 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1241 transitions. [2018-11-28 11:44:16,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1241 transitions. [2018-11-28 11:44:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 11:44:16,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:16,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:16,113 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:16,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1085841368, now seen corresponding path program 1 times [2018-11-28 11:44:16,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:16,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:16,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:16,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:16,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,149 INFO L87 Difference]: Start difference. First operand 874 states and 1241 transitions. Second operand 3 states. [2018-11-28 11:44:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:16,193 INFO L93 Difference]: Finished difference Result 976 states and 1369 transitions. [2018-11-28 11:44:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:16,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-28 11:44:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:16,196 INFO L225 Difference]: With dead ends: 976 [2018-11-28 11:44:16,196 INFO L226 Difference]: Without dead ends: 956 [2018-11-28 11:44:16,196 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-11-28 11:44:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-11-28 11:44:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 900. [2018-11-28 11:44:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-28 11:44:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1276 transitions. [2018-11-28 11:44:16,233 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1276 transitions. Word has length 40 [2018-11-28 11:44:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:16,233 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1276 transitions. [2018-11-28 11:44:16,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1276 transitions. [2018-11-28 11:44:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 11:44:16,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:16,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:16,236 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:16,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 215600759, now seen corresponding path program 1 times [2018-11-28 11:44:16,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:16,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:16,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:16,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:16,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:16,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,280 INFO L87 Difference]: Start difference. First operand 900 states and 1276 transitions. Second operand 3 states. [2018-11-28 11:44:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:16,337 INFO L93 Difference]: Finished difference Result 1175 states and 1651 transitions. [2018-11-28 11:44:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:16,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-28 11:44:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:16,341 INFO L225 Difference]: With dead ends: 1175 [2018-11-28 11:44:16,341 INFO L226 Difference]: Without dead ends: 933 [2018-11-28 11:44:16,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-28 11:44:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 900. [2018-11-28 11:44:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-28 11:44:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1275 transitions. [2018-11-28 11:44:16,382 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1275 transitions. Word has length 46 [2018-11-28 11:44:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:16,382 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1275 transitions. [2018-11-28 11:44:16,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1275 transitions. [2018-11-28 11:44:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:44:16,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:16,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:16,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:16,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash -564668473, now seen corresponding path program 1 times [2018-11-28 11:44:16,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:16,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:16,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:16,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:44:16,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:44:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:44:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:16,445 INFO L87 Difference]: Start difference. First operand 900 states and 1275 transitions. Second operand 4 states. [2018-11-28 11:44:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:16,689 INFO L93 Difference]: Finished difference Result 1022 states and 1421 transitions. [2018-11-28 11:44:16,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:44:16,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-28 11:44:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:16,692 INFO L225 Difference]: With dead ends: 1022 [2018-11-28 11:44:16,692 INFO L226 Difference]: Without dead ends: 793 [2018-11-28 11:44:16,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-28 11:44:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 759. [2018-11-28 11:44:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-28 11:44:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1068 transitions. [2018-11-28 11:44:16,717 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1068 transitions. Word has length 47 [2018-11-28 11:44:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:16,718 INFO L480 AbstractCegarLoop]: Abstraction has 759 states and 1068 transitions. [2018-11-28 11:44:16,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:44:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1068 transitions. [2018-11-28 11:44:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:44:16,719 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:16,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:16,719 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:16,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -915524998, now seen corresponding path program 1 times [2018-11-28 11:44:16,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:16,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:16,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:16,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:16,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,751 INFO L87 Difference]: Start difference. First operand 759 states and 1068 transitions. Second operand 3 states. [2018-11-28 11:44:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:16,778 INFO L93 Difference]: Finished difference Result 879 states and 1216 transitions. [2018-11-28 11:44:16,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:16,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-28 11:44:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:16,781 INFO L225 Difference]: With dead ends: 879 [2018-11-28 11:44:16,781 INFO L226 Difference]: Without dead ends: 783 [2018-11-28 11:44:16,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-11-28 11:44:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 758. [2018-11-28 11:44:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-11-28 11:44:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1063 transitions. [2018-11-28 11:44:16,807 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1063 transitions. Word has length 47 [2018-11-28 11:44:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:16,807 INFO L480 AbstractCegarLoop]: Abstraction has 758 states and 1063 transitions. [2018-11-28 11:44:16,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1063 transitions. [2018-11-28 11:44:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:44:16,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:16,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:16,809 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:16,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash 655679991, now seen corresponding path program 1 times [2018-11-28 11:44:16,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:16,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:16,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:16,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:16,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,840 INFO L87 Difference]: Start difference. First operand 758 states and 1063 transitions. Second operand 3 states. [2018-11-28 11:44:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:16,920 INFO L93 Difference]: Finished difference Result 957 states and 1326 transitions. [2018-11-28 11:44:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:16,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 11:44:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:16,924 INFO L225 Difference]: With dead ends: 957 [2018-11-28 11:44:16,924 INFO L226 Difference]: Without dead ends: 943 [2018-11-28 11:44:16,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-11-28 11:44:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 837. [2018-11-28 11:44:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-11-28 11:44:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1155 transitions. [2018-11-28 11:44:16,954 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1155 transitions. Word has length 48 [2018-11-28 11:44:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:16,955 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1155 transitions. [2018-11-28 11:44:16,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1155 transitions. [2018-11-28 11:44:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:44:16,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:16,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:16,956 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:16,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -704891783, now seen corresponding path program 1 times [2018-11-28 11:44:16,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:16,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:17,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-11-28 11:44:17,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:17,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:17,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:17,007 INFO L87 Difference]: Start difference. First operand 837 states and 1155 transitions. Second operand 8 states. [2018-11-28 11:44:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:17,104 INFO L93 Difference]: Finished difference Result 863 states and 1189 transitions. [2018-11-28 11:44:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:17,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-28 11:44:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:17,107 INFO L225 Difference]: With dead ends: 863 [2018-11-28 11:44:17,107 INFO L226 Difference]: Without dead ends: 859 [2018-11-28 11:44:17,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-11-28 11:44:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2018-11-28 11:44:17,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2018-11-28 11:44:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-28 11:44:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1182 transitions. [2018-11-28 11:44:17,139 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1182 transitions. Word has length 49 [2018-11-28 11:44:17,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:17,139 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1182 transitions. [2018-11-28 11:44:17,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1182 transitions. [2018-11-28 11:44:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:44:17,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:17,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:17,142 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:17,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -705168613, now seen corresponding path program 1 times [2018-11-28 11:44:17,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:17,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:17,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:44:17,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 11:44:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:44:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:44:17,202 INFO L87 Difference]: Start difference. First operand 856 states and 1182 transitions. Second operand 8 states. [2018-11-28 11:44:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:17,269 INFO L93 Difference]: Finished difference Result 898 states and 1234 transitions. [2018-11-28 11:44:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:44:17,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-28 11:44:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:17,272 INFO L225 Difference]: With dead ends: 898 [2018-11-28 11:44:17,272 INFO L226 Difference]: Without dead ends: 877 [2018-11-28 11:44:17,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-11-28 11:44:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2018-11-28 11:44:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-11-28 11:44:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1206 transitions. [2018-11-28 11:44:17,304 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1206 transitions. Word has length 49 [2018-11-28 11:44:17,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:17,304 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1206 transitions. [2018-11-28 11:44:17,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 11:44:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1206 transitions. [2018-11-28 11:44:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:44:17,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:17,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:17,306 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:17,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash -421895854, now seen corresponding path program 1 times [2018-11-28 11:44:17,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:17,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:17,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:17,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:17,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:17,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:44:17,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:44:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:44:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:17,336 INFO L87 Difference]: Start difference. First operand 876 states and 1206 transitions. Second operand 4 states. [2018-11-28 11:44:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:17,377 INFO L93 Difference]: Finished difference Result 901 states and 1231 transitions. [2018-11-28 11:44:17,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:44:17,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-28 11:44:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:17,380 INFO L225 Difference]: With dead ends: 901 [2018-11-28 11:44:17,380 INFO L226 Difference]: Without dead ends: 879 [2018-11-28 11:44:17,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-11-28 11:44:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2018-11-28 11:44:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2018-11-28 11:44:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1205 transitions. [2018-11-28 11:44:17,412 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1205 transitions. Word has length 50 [2018-11-28 11:44:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:17,412 INFO L480 AbstractCegarLoop]: Abstraction has 876 states and 1205 transitions. [2018-11-28 11:44:17,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:44:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1205 transitions. [2018-11-28 11:44:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:44:17,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:17,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:17,414 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:17,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1878926736, now seen corresponding path program 1 times [2018-11-28 11:44:17,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:17,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:17,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:17,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:17,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:17,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:17,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:44:17,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:44:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:44:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:17,468 INFO L87 Difference]: Start difference. First operand 876 states and 1205 transitions. Second operand 7 states. [2018-11-28 11:44:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:18,305 INFO L93 Difference]: Finished difference Result 1088 states and 1539 transitions. [2018-11-28 11:44:18,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:44:18,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-11-28 11:44:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:18,308 INFO L225 Difference]: With dead ends: 1088 [2018-11-28 11:44:18,308 INFO L226 Difference]: Without dead ends: 997 [2018-11-28 11:44:18,309 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-11-28 11:44:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-28 11:44:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 856. [2018-11-28 11:44:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-28 11:44:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2018-11-28 11:44:18,342 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 50 [2018-11-28 11:44:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:18,342 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2018-11-28 11:44:18,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:44:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2018-11-28 11:44:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:44:18,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:18,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:18,344 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:18,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2025619538, now seen corresponding path program 1 times [2018-11-28 11:44:18,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:18,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:18,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:18,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:18,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:18,369 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand 3 states. [2018-11-28 11:44:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:18,447 INFO L93 Difference]: Finished difference Result 1038 states and 1408 transitions. [2018-11-28 11:44:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:18,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 11:44:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:18,451 INFO L225 Difference]: With dead ends: 1038 [2018-11-28 11:44:18,451 INFO L226 Difference]: Without dead ends: 998 [2018-11-28 11:44:18,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-28 11:44:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2018-11-28 11:44:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-11-28 11:44:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1201 transitions. [2018-11-28 11:44:18,490 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1201 transitions. Word has length 50 [2018-11-28 11:44:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:18,490 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 1201 transitions. [2018-11-28 11:44:18,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1201 transitions. [2018-11-28 11:44:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:44:18,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:18,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:18,492 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:18,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:18,492 INFO L82 PathProgramCache]: Analyzing trace with hash 274322421, now seen corresponding path program 1 times [2018-11-28 11:44:18,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:18,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:18,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:18,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:18,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:44:18,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:44:18,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:44:18,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:18,568 INFO L87 Difference]: Start difference. First operand 890 states and 1201 transitions. Second operand 9 states. [2018-11-28 11:44:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:19,579 INFO L93 Difference]: Finished difference Result 1211 states and 1672 transitions. [2018-11-28 11:44:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 11:44:19,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-28 11:44:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:19,583 INFO L225 Difference]: With dead ends: 1211 [2018-11-28 11:44:19,583 INFO L226 Difference]: Without dead ends: 1142 [2018-11-28 11:44:19,583 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-11-28 11:44:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2018-11-28 11:44:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 902. [2018-11-28 11:44:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2018-11-28 11:44:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1225 transitions. [2018-11-28 11:44:19,632 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1225 transitions. Word has length 50 [2018-11-28 11:44:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:19,632 INFO L480 AbstractCegarLoop]: Abstraction has 902 states and 1225 transitions. [2018-11-28 11:44:19,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:44:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1225 transitions. [2018-11-28 11:44:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:44:19,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:19,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:19,634 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:19,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:19,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1098118333, now seen corresponding path program 1 times [2018-11-28 11:44:19,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:19,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:19,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:19,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:19,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:19,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:19,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:19,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:19,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:19,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:19,680 INFO L87 Difference]: Start difference. First operand 902 states and 1225 transitions. Second operand 3 states. [2018-11-28 11:44:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:19,788 INFO L93 Difference]: Finished difference Result 930 states and 1257 transitions. [2018-11-28 11:44:19,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:19,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-28 11:44:19,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:19,793 INFO L225 Difference]: With dead ends: 930 [2018-11-28 11:44:19,793 INFO L226 Difference]: Without dead ends: 925 [2018-11-28 11:44:19,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-11-28 11:44:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 919. [2018-11-28 11:44:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-11-28 11:44:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1246 transitions. [2018-11-28 11:44:19,850 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1246 transitions. Word has length 52 [2018-11-28 11:44:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:19,850 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1246 transitions. [2018-11-28 11:44:19,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1246 transitions. [2018-11-28 11:44:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:44:19,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:19,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:19,852 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:19,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1807495809, now seen corresponding path program 1 times [2018-11-28 11:44:19,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:19,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:19,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:19,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:19,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:19,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:19,908 INFO L87 Difference]: Start difference. First operand 919 states and 1246 transitions. Second operand 3 states. [2018-11-28 11:44:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:20,014 INFO L93 Difference]: Finished difference Result 1135 states and 1537 transitions. [2018-11-28 11:44:20,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:20,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-28 11:44:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:20,018 INFO L225 Difference]: With dead ends: 1135 [2018-11-28 11:44:20,019 INFO L226 Difference]: Without dead ends: 888 [2018-11-28 11:44:20,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-28 11:44:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2018-11-28 11:44:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-28 11:44:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1206 transitions. [2018-11-28 11:44:20,073 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1206 transitions. Word has length 54 [2018-11-28 11:44:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:20,073 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1206 transitions. [2018-11-28 11:44:20,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1206 transitions. [2018-11-28 11:44:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:44:20,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:20,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:20,075 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:20,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash 761658191, now seen corresponding path program 1 times [2018-11-28 11:44:20,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:20,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:20,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:20,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:20,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:20,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:20,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:20,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:20,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:20,130 INFO L87 Difference]: Start difference. First operand 888 states and 1206 transitions. Second operand 5 states. [2018-11-28 11:44:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:20,712 INFO L93 Difference]: Finished difference Result 900 states and 1216 transitions. [2018-11-28 11:44:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:20,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 11:44:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:20,716 INFO L225 Difference]: With dead ends: 900 [2018-11-28 11:44:20,716 INFO L226 Difference]: Without dead ends: 894 [2018-11-28 11:44:20,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2018-11-28 11:44:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2018-11-28 11:44:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-28 11:44:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1205 transitions. [2018-11-28 11:44:20,774 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1205 transitions. Word has length 53 [2018-11-28 11:44:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:20,774 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1205 transitions. [2018-11-28 11:44:20,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1205 transitions. [2018-11-28 11:44:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:44:20,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:20,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:20,776 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:20,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash -493669766, now seen corresponding path program 1 times [2018-11-28 11:44:20,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:20,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:20,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:20,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:20,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:20,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:20,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:20,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:20,831 INFO L87 Difference]: Start difference. First operand 888 states and 1205 transitions. Second operand 5 states. [2018-11-28 11:44:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:21,278 INFO L93 Difference]: Finished difference Result 903 states and 1220 transitions. [2018-11-28 11:44:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:21,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-28 11:44:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:21,280 INFO L225 Difference]: With dead ends: 903 [2018-11-28 11:44:21,281 INFO L226 Difference]: Without dead ends: 867 [2018-11-28 11:44:21,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-28 11:44:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 861. [2018-11-28 11:44:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-11-28 11:44:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1175 transitions. [2018-11-28 11:44:21,313 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1175 transitions. Word has length 52 [2018-11-28 11:44:21,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:21,313 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1175 transitions. [2018-11-28 11:44:21,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1175 transitions. [2018-11-28 11:44:21,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:44:21,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:21,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:21,315 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:21,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:21,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546088, now seen corresponding path program 1 times [2018-11-28 11:44:21,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:21,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:21,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:21,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:21,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:21,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:21,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:21,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:21,353 INFO L87 Difference]: Start difference. First operand 861 states and 1175 transitions. Second operand 5 states. [2018-11-28 11:44:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:21,698 INFO L93 Difference]: Finished difference Result 871 states and 1183 transitions. [2018-11-28 11:44:21,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:21,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 11:44:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:21,700 INFO L225 Difference]: With dead ends: 871 [2018-11-28 11:44:21,700 INFO L226 Difference]: Without dead ends: 865 [2018-11-28 11:44:21,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-11-28 11:44:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 861. [2018-11-28 11:44:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2018-11-28 11:44:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1174 transitions. [2018-11-28 11:44:21,734 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1174 transitions. Word has length 54 [2018-11-28 11:44:21,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:21,734 INFO L480 AbstractCegarLoop]: Abstraction has 861 states and 1174 transitions. [2018-11-28 11:44:21,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1174 transitions. [2018-11-28 11:44:21,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:44:21,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:21,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:21,736 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:21,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash -291565544, now seen corresponding path program 1 times [2018-11-28 11:44:21,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:21,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:21,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:21,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:21,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:21,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:44:21,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:44:21,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:44:21,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:44:21,799 INFO L87 Difference]: Start difference. First operand 861 states and 1174 transitions. Second operand 9 states. [2018-11-28 11:44:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:21,916 INFO L93 Difference]: Finished difference Result 888 states and 1204 transitions. [2018-11-28 11:44:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:44:21,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-28 11:44:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:21,919 INFO L225 Difference]: With dead ends: 888 [2018-11-28 11:44:21,919 INFO L226 Difference]: Without dead ends: 852 [2018-11-28 11:44:21,919 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-11-28 11:44:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2018-11-28 11:44:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2018-11-28 11:44:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-11-28 11:44:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1150 transitions. [2018-11-28 11:44:21,953 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1150 transitions. Word has length 55 [2018-11-28 11:44:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:21,954 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1150 transitions. [2018-11-28 11:44:21,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:44:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1150 transitions. [2018-11-28 11:44:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-28 11:44:21,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:21,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:21,956 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:21,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1728183236, now seen corresponding path program 1 times [2018-11-28 11:44:21,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:44:22,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:44:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:44:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:44:22,052 INFO L87 Difference]: Start difference. First operand 852 states and 1150 transitions. Second operand 10 states. [2018-11-28 11:44:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,194 INFO L93 Difference]: Finished difference Result 868 states and 1167 transitions. [2018-11-28 11:44:22,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:44:22,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-28 11:44:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,196 INFO L225 Difference]: With dead ends: 868 [2018-11-28 11:44:22,196 INFO L226 Difference]: Without dead ends: 850 [2018-11-28 11:44:22,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-11-28 11:44:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2018-11-28 11:44:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-28 11:44:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1146 transitions. [2018-11-28 11:44:22,229 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1146 transitions. Word has length 56 [2018-11-28 11:44:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,229 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1146 transitions. [2018-11-28 11:44:22,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:44:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1146 transitions. [2018-11-28 11:44:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:44:22,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:22,231 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1135140490, now seen corresponding path program 1 times [2018-11-28 11:44:22,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:44:22,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:44:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:44:22,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:44:22,311 INFO L87 Difference]: Start difference. First operand 850 states and 1146 transitions. Second operand 10 states. [2018-11-28 11:44:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,450 INFO L93 Difference]: Finished difference Result 863 states and 1160 transitions. [2018-11-28 11:44:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:44:22,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-11-28 11:44:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,452 INFO L225 Difference]: With dead ends: 863 [2018-11-28 11:44:22,452 INFO L226 Difference]: Without dead ends: 845 [2018-11-28 11:44:22,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:22,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-11-28 11:44:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2018-11-28 11:44:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-28 11:44:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1139 transitions. [2018-11-28 11:44:22,485 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1139 transitions. Word has length 55 [2018-11-28 11:44:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,485 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1139 transitions. [2018-11-28 11:44:22,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:44:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1139 transitions. [2018-11-28 11:44:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 11:44:22,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,487 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:22,487 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 49569733, now seen corresponding path program 1 times [2018-11-28 11:44:22,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:22,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:22,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:22,549 INFO L87 Difference]: Start difference. First operand 845 states and 1139 transitions. Second operand 3 states. [2018-11-28 11:44:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,587 INFO L93 Difference]: Finished difference Result 1098 states and 1473 transitions. [2018-11-28 11:44:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:22,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-28 11:44:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,589 INFO L225 Difference]: With dead ends: 1098 [2018-11-28 11:44:22,590 INFO L226 Difference]: Without dead ends: 935 [2018-11-28 11:44:22,590 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-11-28 11:44:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-11-28 11:44:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 904. [2018-11-28 11:44:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-28 11:44:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1215 transitions. [2018-11-28 11:44:22,624 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1215 transitions. Word has length 74 [2018-11-28 11:44:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,624 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1215 transitions. [2018-11-28 11:44:22,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1215 transitions. [2018-11-28 11:44:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:44:22,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:22,626 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2094530933, now seen corresponding path program 1 times [2018-11-28 11:44:22,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:22,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:22,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:44:22,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:44:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:44:22,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:44:22,715 INFO L87 Difference]: Start difference. First operand 904 states and 1215 transitions. Second operand 12 states. [2018-11-28 11:44:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:22,875 INFO L93 Difference]: Finished difference Result 930 states and 1243 transitions. [2018-11-28 11:44:22,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:44:22,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-11-28 11:44:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:22,878 INFO L225 Difference]: With dead ends: 930 [2018-11-28 11:44:22,878 INFO L226 Difference]: Without dead ends: 905 [2018-11-28 11:44:22,878 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-11-28 11:44:22,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-11-28 11:44:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903. [2018-11-28 11:44:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-11-28 11:44:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1204 transitions. [2018-11-28 11:44:22,913 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1204 transitions. Word has length 59 [2018-11-28 11:44:22,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:22,914 INFO L480 AbstractCegarLoop]: Abstraction has 903 states and 1204 transitions. [2018-11-28 11:44:22,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:44:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1204 transitions. [2018-11-28 11:44:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 11:44:22,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:22,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:22,916 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:22,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:22,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1190823714, now seen corresponding path program 1 times [2018-11-28 11:44:22,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:22,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:22,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:22,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:44:23,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:44:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:44:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:23,014 INFO L87 Difference]: Start difference. First operand 903 states and 1204 transitions. Second operand 11 states. [2018-11-28 11:44:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,230 INFO L93 Difference]: Finished difference Result 920 states and 1222 transitions. [2018-11-28 11:44:23,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:23,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-28 11:44:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,235 INFO L225 Difference]: With dead ends: 920 [2018-11-28 11:44:23,240 INFO L226 Difference]: Without dead ends: 900 [2018-11-28 11:44:23,241 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-11-28 11:44:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2018-11-28 11:44:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2018-11-28 11:44:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2018-11-28 11:44:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1199 transitions. [2018-11-28 11:44:23,296 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1199 transitions. Word has length 58 [2018-11-28 11:44:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,296 INFO L480 AbstractCegarLoop]: Abstraction has 900 states and 1199 transitions. [2018-11-28 11:44:23,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:44:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1199 transitions. [2018-11-28 11:44:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 11:44:23,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:23,298 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -109492812, now seen corresponding path program 1 times [2018-11-28 11:44:23,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:44:23,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:44:23,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:44:23,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:44:23,395 INFO L87 Difference]: Start difference. First operand 900 states and 1199 transitions. Second operand 10 states. [2018-11-28 11:44:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,689 INFO L93 Difference]: Finished difference Result 967 states and 1274 transitions. [2018-11-28 11:44:23,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:23,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-28 11:44:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,692 INFO L225 Difference]: With dead ends: 967 [2018-11-28 11:44:23,693 INFO L226 Difference]: Without dead ends: 858 [2018-11-28 11:44:23,693 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-11-28 11:44:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-28 11:44:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 855. [2018-11-28 11:44:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2018-11-28 11:44:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1118 transitions. [2018-11-28 11:44:23,749 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1118 transitions. Word has length 59 [2018-11-28 11:44:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,749 INFO L480 AbstractCegarLoop]: Abstraction has 855 states and 1118 transitions. [2018-11-28 11:44:23,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:44:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1118 transitions. [2018-11-28 11:44:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:44:23,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:23,752 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2110252174, now seen corresponding path program 1 times [2018-11-28 11:44:23,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:23,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:23,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:44:23,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 11:44:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:44:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:44:23,788 INFO L87 Difference]: Start difference. First operand 855 states and 1118 transitions. Second operand 4 states. [2018-11-28 11:44:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:23,927 INFO L93 Difference]: Finished difference Result 1012 states and 1336 transitions. [2018-11-28 11:44:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:44:23,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-28 11:44:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:23,930 INFO L225 Difference]: With dead ends: 1012 [2018-11-28 11:44:23,930 INFO L226 Difference]: Without dead ends: 904 [2018-11-28 11:44:23,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-28 11:44:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 862. [2018-11-28 11:44:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-11-28 11:44:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1133 transitions. [2018-11-28 11:44:23,987 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1133 transitions. Word has length 60 [2018-11-28 11:44:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:23,987 INFO L480 AbstractCegarLoop]: Abstraction has 862 states and 1133 transitions. [2018-11-28 11:44:23,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 11:44:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1133 transitions. [2018-11-28 11:44:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 11:44:23,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:23,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:23,989 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:23,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1909955508, now seen corresponding path program 1 times [2018-11-28 11:44:23,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:23,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:23,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:24,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:24,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:44:24,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:44:24,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:44:24,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:24,079 INFO L87 Difference]: Start difference. First operand 862 states and 1133 transitions. Second operand 11 states. [2018-11-28 11:44:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:24,194 INFO L93 Difference]: Finished difference Result 931 states and 1224 transitions. [2018-11-28 11:44:24,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:24,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-28 11:44:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:24,197 INFO L225 Difference]: With dead ends: 931 [2018-11-28 11:44:24,197 INFO L226 Difference]: Without dead ends: 876 [2018-11-28 11:44:24,198 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-11-28 11:44:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-11-28 11:44:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 866. [2018-11-28 11:44:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2018-11-28 11:44:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1150 transitions. [2018-11-28 11:44:24,251 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1150 transitions. Word has length 60 [2018-11-28 11:44:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:24,251 INFO L480 AbstractCegarLoop]: Abstraction has 866 states and 1150 transitions. [2018-11-28 11:44:24,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:44:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1150 transitions. [2018-11-28 11:44:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:44:24,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:24,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:24,254 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:24,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1731506415, now seen corresponding path program 1 times [2018-11-28 11:44:24,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:24,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:24,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:24,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:24,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:24,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:24,312 INFO L87 Difference]: Start difference. First operand 866 states and 1150 transitions. Second operand 5 states. [2018-11-28 11:44:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:24,496 INFO L93 Difference]: Finished difference Result 901 states and 1192 transitions. [2018-11-28 11:44:24,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:24,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-11-28 11:44:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:24,499 INFO L225 Difference]: With dead ends: 901 [2018-11-28 11:44:24,499 INFO L226 Difference]: Without dead ends: 873 [2018-11-28 11:44:24,500 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-11-28 11:44:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-11-28 11:44:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 871. [2018-11-28 11:44:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-11-28 11:44:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1159 transitions. [2018-11-28 11:44:24,566 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1159 transitions. Word has length 62 [2018-11-28 11:44:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:24,567 INFO L480 AbstractCegarLoop]: Abstraction has 871 states and 1159 transitions. [2018-11-28 11:44:24,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1159 transitions. [2018-11-28 11:44:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 11:44:24,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:24,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:24,570 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:24,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1988119945, now seen corresponding path program 1 times [2018-11-28 11:44:24,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:24,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:24,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:44:24,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:44:24,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:44:24,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:44:24,703 INFO L87 Difference]: Start difference. First operand 871 states and 1159 transitions. Second operand 12 states. [2018-11-28 11:44:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:24,857 INFO L93 Difference]: Finished difference Result 893 states and 1182 transitions. [2018-11-28 11:44:24,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:44:24,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-11-28 11:44:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:24,859 INFO L225 Difference]: With dead ends: 893 [2018-11-28 11:44:24,860 INFO L226 Difference]: Without dead ends: 869 [2018-11-28 11:44:24,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:44:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-28 11:44:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2018-11-28 11:44:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-11-28 11:44:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1154 transitions. [2018-11-28 11:44:24,916 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1154 transitions. Word has length 63 [2018-11-28 11:44:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:24,917 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1154 transitions. [2018-11-28 11:44:24,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:44:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1154 transitions. [2018-11-28 11:44:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:44:24,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:24,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:24,919 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:24,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash 398574068, now seen corresponding path program 1 times [2018-11-28 11:44:24,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:24,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:24,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:24,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:44:25,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:44:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:44:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:44:25,083 INFO L87 Difference]: Start difference. First operand 869 states and 1154 transitions. Second operand 12 states. [2018-11-28 11:44:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,297 INFO L93 Difference]: Finished difference Result 893 states and 1179 transitions. [2018-11-28 11:44:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:44:25,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-28 11:44:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,300 INFO L225 Difference]: With dead ends: 893 [2018-11-28 11:44:25,300 INFO L226 Difference]: Without dead ends: 869 [2018-11-28 11:44:25,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:44:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-11-28 11:44:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 867. [2018-11-28 11:44:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2018-11-28 11:44:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1150 transitions. [2018-11-28 11:44:25,342 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1150 transitions. Word has length 66 [2018-11-28 11:44:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,342 INFO L480 AbstractCegarLoop]: Abstraction has 867 states and 1150 transitions. [2018-11-28 11:44:25,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:44:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1150 transitions. [2018-11-28 11:44:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:44:25,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:25,344 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1861861007, now seen corresponding path program 1 times [2018-11-28 11:44:25,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:44:25,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:44:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:44:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:44:25,422 INFO L87 Difference]: Start difference. First operand 867 states and 1150 transitions. Second operand 12 states. [2018-11-28 11:44:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,595 INFO L93 Difference]: Finished difference Result 891 states and 1175 transitions. [2018-11-28 11:44:25,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:44:25,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2018-11-28 11:44:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,598 INFO L225 Difference]: With dead ends: 891 [2018-11-28 11:44:25,598 INFO L226 Difference]: Without dead ends: 867 [2018-11-28 11:44:25,599 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-11-28 11:44:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-11-28 11:44:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2018-11-28 11:44:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2018-11-28 11:44:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1146 transitions. [2018-11-28 11:44:25,630 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1146 transitions. Word has length 62 [2018-11-28 11:44:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,630 INFO L480 AbstractCegarLoop]: Abstraction has 865 states and 1146 transitions. [2018-11-28 11:44:25,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:44:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1146 transitions. [2018-11-28 11:44:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:44:25,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:25,632 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2111220271, now seen corresponding path program 1 times [2018-11-28 11:44:25,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:25,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:25,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:25,656 INFO L87 Difference]: Start difference. First operand 865 states and 1146 transitions. Second operand 3 states. [2018-11-28 11:44:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,683 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2018-11-28 11:44:25,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:25,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-11-28 11:44:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,686 INFO L225 Difference]: With dead ends: 1137 [2018-11-28 11:44:25,686 INFO L226 Difference]: Without dead ends: 793 [2018-11-28 11:44:25,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:25,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-11-28 11:44:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 762. [2018-11-28 11:44:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2018-11-28 11:44:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 977 transitions. [2018-11-28 11:44:25,717 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 977 transitions. Word has length 62 [2018-11-28 11:44:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:25,717 INFO L480 AbstractCegarLoop]: Abstraction has 762 states and 977 transitions. [2018-11-28 11:44:25,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 977 transitions. [2018-11-28 11:44:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 11:44:25,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:25,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:25,721 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:25,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1839036840, now seen corresponding path program 1 times [2018-11-28 11:44:25,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:25,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:25,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:25,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:25,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:25,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 11:44:25,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:44:25,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:44:25,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:44:25,815 INFO L87 Difference]: Start difference. First operand 762 states and 977 transitions. Second operand 13 states. [2018-11-28 11:44:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:25,981 INFO L93 Difference]: Finished difference Result 779 states and 995 transitions. [2018-11-28 11:44:25,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:44:25,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-28 11:44:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:25,983 INFO L225 Difference]: With dead ends: 779 [2018-11-28 11:44:25,983 INFO L226 Difference]: Without dead ends: 757 [2018-11-28 11:44:25,984 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-11-28 11:44:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-11-28 11:44:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2018-11-28 11:44:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-28 11:44:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 970 transitions. [2018-11-28 11:44:26,013 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 970 transitions. Word has length 63 [2018-11-28 11:44:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,013 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 970 transitions. [2018-11-28 11:44:26,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:44:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 970 transitions. [2018-11-28 11:44:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:26,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,015 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1496662402, now seen corresponding path program 1 times [2018-11-28 11:44:26,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 11:44:26,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:44:26,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:44:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:44:26,131 INFO L87 Difference]: Start difference. First operand 757 states and 970 transitions. Second operand 13 states. [2018-11-28 11:44:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,297 INFO L93 Difference]: Finished difference Result 774 states and 988 transitions. [2018-11-28 11:44:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:44:26,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-28 11:44:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,299 INFO L225 Difference]: With dead ends: 774 [2018-11-28 11:44:26,299 INFO L226 Difference]: Without dead ends: 746 [2018-11-28 11:44:26,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-11-28 11:44:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2018-11-28 11:44:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-28 11:44:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 955 transitions. [2018-11-28 11:44:26,327 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 955 transitions. Word has length 69 [2018-11-28 11:44:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,327 INFO L480 AbstractCegarLoop]: Abstraction has 746 states and 955 transitions. [2018-11-28 11:44:26,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:44:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 955 transitions. [2018-11-28 11:44:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 11:44:26,329 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,329 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,329 INFO L82 PathProgramCache]: Analyzing trace with hash 81838798, now seen corresponding path program 1 times [2018-11-28 11:44:26,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 11:44:26,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:44:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:44:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:44:26,441 INFO L87 Difference]: Start difference. First operand 746 states and 955 transitions. Second operand 13 states. [2018-11-28 11:44:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,645 INFO L93 Difference]: Finished difference Result 763 states and 973 transitions. [2018-11-28 11:44:26,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:44:26,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-11-28 11:44:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,648 INFO L225 Difference]: With dead ends: 763 [2018-11-28 11:44:26,648 INFO L226 Difference]: Without dead ends: 738 [2018-11-28 11:44:26,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-28 11:44:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-11-28 11:44:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-28 11:44:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 945 transitions. [2018-11-28 11:44:26,677 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 945 transitions. Word has length 62 [2018-11-28 11:44:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,677 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 945 transitions. [2018-11-28 11:44:26,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:44:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 945 transitions. [2018-11-28 11:44:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 11:44:26,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,679 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2087229698, now seen corresponding path program 1 times [2018-11-28 11:44:26,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:26,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:26,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:26,712 INFO L87 Difference]: Start difference. First operand 738 states and 945 transitions. Second operand 3 states. [2018-11-28 11:44:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,745 INFO L93 Difference]: Finished difference Result 868 states and 1118 transitions. [2018-11-28 11:44:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:26,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 11:44:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,747 INFO L225 Difference]: With dead ends: 868 [2018-11-28 11:44:26,747 INFO L226 Difference]: Without dead ends: 738 [2018-11-28 11:44:26,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-28 11:44:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2018-11-28 11:44:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-11-28 11:44:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 943 transitions. [2018-11-28 11:44:26,775 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 943 transitions. Word has length 66 [2018-11-28 11:44:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,775 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 943 transitions. [2018-11-28 11:44:26,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 943 transitions. [2018-11-28 11:44:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 11:44:26,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,777 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash -322329126, now seen corresponding path program 1 times [2018-11-28 11:44:26,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:26,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:26,815 INFO L87 Difference]: Start difference. First operand 738 states and 943 transitions. Second operand 5 states. [2018-11-28 11:44:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:26,864 INFO L93 Difference]: Finished difference Result 784 states and 990 transitions. [2018-11-28 11:44:26,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:26,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 11:44:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:26,867 INFO L225 Difference]: With dead ends: 784 [2018-11-28 11:44:26,867 INFO L226 Difference]: Without dead ends: 732 [2018-11-28 11:44:26,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-28 11:44:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2018-11-28 11:44:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-11-28 11:44:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 933 transitions. [2018-11-28 11:44:26,896 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 933 transitions. Word has length 65 [2018-11-28 11:44:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:26,896 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 933 transitions. [2018-11-28 11:44:26,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 933 transitions. [2018-11-28 11:44:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:44:26,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:26,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:26,897 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:26,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash 127484813, now seen corresponding path program 1 times [2018-11-28 11:44:26,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:26,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:26,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:26,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:44:26,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:44:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:44:26,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:44:26,990 INFO L87 Difference]: Start difference. First operand 732 states and 933 transitions. Second operand 12 states. [2018-11-28 11:44:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,110 INFO L93 Difference]: Finished difference Result 755 states and 957 transitions. [2018-11-28 11:44:27,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:44:27,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-28 11:44:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,113 INFO L225 Difference]: With dead ends: 755 [2018-11-28 11:44:27,113 INFO L226 Difference]: Without dead ends: 732 [2018-11-28 11:44:27,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-28 11:44:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2018-11-28 11:44:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2018-11-28 11:44:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 932 transitions. [2018-11-28 11:44:27,157 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 932 transitions. Word has length 70 [2018-11-28 11:44:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,157 INFO L480 AbstractCegarLoop]: Abstraction has 732 states and 932 transitions. [2018-11-28 11:44:27,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:44:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 932 transitions. [2018-11-28 11:44:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:44:27,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,159 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash 360839567, now seen corresponding path program 1 times [2018-11-28 11:44:27,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 11:44:27,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:44:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:44:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:44:27,240 INFO L87 Difference]: Start difference. First operand 732 states and 932 transitions. Second operand 12 states. [2018-11-28 11:44:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,354 INFO L93 Difference]: Finished difference Result 754 states and 955 transitions. [2018-11-28 11:44:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:44:27,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2018-11-28 11:44:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,357 INFO L225 Difference]: With dead ends: 754 [2018-11-28 11:44:27,357 INFO L226 Difference]: Without dead ends: 730 [2018-11-28 11:44:27,358 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-11-28 11:44:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-11-28 11:44:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2018-11-28 11:44:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-28 11:44:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 928 transitions. [2018-11-28 11:44:27,385 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 928 transitions. Word has length 67 [2018-11-28 11:44:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,385 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 928 transitions. [2018-11-28 11:44:27,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:44:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 928 transitions. [2018-11-28 11:44:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-28 11:44:27,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,387 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1568772173, now seen corresponding path program 1 times [2018-11-28 11:44:27,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:27,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:27,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:27,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:27,416 INFO L87 Difference]: Start difference. First operand 730 states and 928 transitions. Second operand 5 states. [2018-11-28 11:44:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,459 INFO L93 Difference]: Finished difference Result 764 states and 963 transitions. [2018-11-28 11:44:27,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:27,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-28 11:44:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,462 INFO L225 Difference]: With dead ends: 764 [2018-11-28 11:44:27,462 INFO L226 Difference]: Without dead ends: 725 [2018-11-28 11:44:27,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-11-28 11:44:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-11-28 11:44:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-28 11:44:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 921 transitions. [2018-11-28 11:44:27,489 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 921 transitions. Word has length 67 [2018-11-28 11:44:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,489 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 921 transitions. [2018-11-28 11:44:27,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 921 transitions. [2018-11-28 11:44:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 11:44:27,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,491 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1402336471, now seen corresponding path program 1 times [2018-11-28 11:44:27,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:27,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:27,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:27,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:27,527 INFO L87 Difference]: Start difference. First operand 725 states and 921 transitions. Second operand 5 states. [2018-11-28 11:44:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,759 INFO L93 Difference]: Finished difference Result 808 states and 1028 transitions. [2018-11-28 11:44:27,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:27,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-28 11:44:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,762 INFO L225 Difference]: With dead ends: 808 [2018-11-28 11:44:27,762 INFO L226 Difference]: Without dead ends: 799 [2018-11-28 11:44:27,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2018-11-28 11:44:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 725. [2018-11-28 11:44:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-28 11:44:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 919 transitions. [2018-11-28 11:44:27,791 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 919 transitions. Word has length 68 [2018-11-28 11:44:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,792 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 919 transitions. [2018-11-28 11:44:27,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 919 transitions. [2018-11-28 11:44:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 11:44:27,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,793 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1734361953, now seen corresponding path program 1 times [2018-11-28 11:44:27,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:27,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:27,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:44:27,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:44:27,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:44:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:27,858 INFO L87 Difference]: Start difference. First operand 725 states and 919 transitions. Second operand 7 states. [2018-11-28 11:44:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:27,930 INFO L93 Difference]: Finished difference Result 771 states and 966 transitions. [2018-11-28 11:44:27,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:44:27,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-28 11:44:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:27,932 INFO L225 Difference]: With dead ends: 771 [2018-11-28 11:44:27,932 INFO L226 Difference]: Without dead ends: 726 [2018-11-28 11:44:27,933 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-11-28 11:44:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2018-11-28 11:44:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 724. [2018-11-28 11:44:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-28 11:44:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 915 transitions. [2018-11-28 11:44:27,963 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 915 transitions. Word has length 74 [2018-11-28 11:44:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:27,964 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 915 transitions. [2018-11-28 11:44:27,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:44:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 915 transitions. [2018-11-28 11:44:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 11:44:27,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:27,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:27,966 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:27,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1859005469, now seen corresponding path program 1 times [2018-11-28 11:44:27,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:27,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:28,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:28,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:28,056 INFO L87 Difference]: Start difference. First operand 724 states and 915 transitions. Second operand 14 states. [2018-11-28 11:44:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:28,196 INFO L93 Difference]: Finished difference Result 746 states and 938 transitions. [2018-11-28 11:44:28,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:44:28,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-11-28 11:44:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:28,198 INFO L225 Difference]: With dead ends: 746 [2018-11-28 11:44:28,198 INFO L226 Difference]: Without dead ends: 714 [2018-11-28 11:44:28,199 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-11-28 11:44:28,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-28 11:44:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2018-11-28 11:44:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-11-28 11:44:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 900 transitions. [2018-11-28 11:44:28,228 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 900 transitions. Word has length 74 [2018-11-28 11:44:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:28,228 INFO L480 AbstractCegarLoop]: Abstraction has 714 states and 900 transitions. [2018-11-28 11:44:28,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 900 transitions. [2018-11-28 11:44:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 11:44:28,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:28,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:28,230 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:28,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash 829084687, now seen corresponding path program 1 times [2018-11-28 11:44:28,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:28,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,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-11-28 11:44:28,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:28,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:28,330 INFO L87 Difference]: Start difference. First operand 714 states and 900 transitions. Second operand 14 states. [2018-11-28 11:44:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:28,458 INFO L93 Difference]: Finished difference Result 738 states and 926 transitions. [2018-11-28 11:44:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:44:28,459 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-28 11:44:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:28,461 INFO L225 Difference]: With dead ends: 738 [2018-11-28 11:44:28,461 INFO L226 Difference]: Without dead ends: 710 [2018-11-28 11:44:28,461 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-11-28 11:44:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-11-28 11:44:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2018-11-28 11:44:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-11-28 11:44:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 894 transitions. [2018-11-28 11:44:28,489 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 894 transitions. Word has length 70 [2018-11-28 11:44:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:28,490 INFO L480 AbstractCegarLoop]: Abstraction has 710 states and 894 transitions. [2018-11-28 11:44:28,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 894 transitions. [2018-11-28 11:44:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:28,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:28,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:28,492 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:28,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash 77291112, now seen corresponding path program 1 times [2018-11-28 11:44:28,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:28,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:28,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:28,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:28,520 INFO L87 Difference]: Start difference. First operand 710 states and 894 transitions. Second operand 5 states. [2018-11-28 11:44:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:28,562 INFO L93 Difference]: Finished difference Result 744 states and 929 transitions. [2018-11-28 11:44:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:28,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 11:44:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:28,565 INFO L225 Difference]: With dead ends: 744 [2018-11-28 11:44:28,565 INFO L226 Difference]: Without dead ends: 705 [2018-11-28 11:44:28,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-11-28 11:44:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2018-11-28 11:44:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-28 11:44:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 887 transitions. [2018-11-28 11:44:28,598 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 887 transitions. Word has length 69 [2018-11-28 11:44:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:28,598 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 887 transitions. [2018-11-28 11:44:28,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 887 transitions. [2018-11-28 11:44:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:28,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:28,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:28,600 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:28,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1952246579, now seen corresponding path program 1 times [2018-11-28 11:44:28,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:28,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:44:28,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:44:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:44:28,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:28,670 INFO L87 Difference]: Start difference. First operand 705 states and 887 transitions. Second operand 11 states. [2018-11-28 11:44:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:28,753 INFO L93 Difference]: Finished difference Result 732 states and 917 transitions. [2018-11-28 11:44:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:28,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-28 11:44:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:28,756 INFO L225 Difference]: With dead ends: 732 [2018-11-28 11:44:28,756 INFO L226 Difference]: Without dead ends: 702 [2018-11-28 11:44:28,756 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-11-28 11:44:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-11-28 11:44:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2018-11-28 11:44:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-11-28 11:44:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 882 transitions. [2018-11-28 11:44:28,790 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 882 transitions. Word has length 69 [2018-11-28 11:44:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:28,790 INFO L480 AbstractCegarLoop]: Abstraction has 702 states and 882 transitions. [2018-11-28 11:44:28,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:44:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 882 transitions. [2018-11-28 11:44:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:28,792 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:28,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:28,792 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:28,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083894, now seen corresponding path program 1 times [2018-11-28 11:44:28,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:28,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:28,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:28,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:28,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:44:28,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:44:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:44:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:28,880 INFO L87 Difference]: Start difference. First operand 702 states and 882 transitions. Second operand 11 states. [2018-11-28 11:44:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,038 INFO L93 Difference]: Finished difference Result 712 states and 891 transitions. [2018-11-28 11:44:29,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:29,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-11-28 11:44:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,041 INFO L225 Difference]: With dead ends: 712 [2018-11-28 11:44:29,041 INFO L226 Difference]: Without dead ends: 706 [2018-11-28 11:44:29,042 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-11-28 11:44:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2018-11-28 11:44:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 699. [2018-11-28 11:44:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-11-28 11:44:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 875 transitions. [2018-11-28 11:44:29,072 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 875 transitions. Word has length 69 [2018-11-28 11:44:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,072 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 875 transitions. [2018-11-28 11:44:29,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:44:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 875 transitions. [2018-11-28 11:44:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:29,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,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] [2018-11-28 11:44:29,074 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1163360724, now seen corresponding path program 1 times [2018-11-28 11:44:29,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:29,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:29,108 INFO L87 Difference]: Start difference. First operand 699 states and 875 transitions. Second operand 5 states. [2018-11-28 11:44:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,331 INFO L93 Difference]: Finished difference Result 776 states and 976 transitions. [2018-11-28 11:44:29,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:29,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-11-28 11:44:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,334 INFO L225 Difference]: With dead ends: 776 [2018-11-28 11:44:29,334 INFO L226 Difference]: Without dead ends: 741 [2018-11-28 11:44:29,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-28 11:44:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 670. [2018-11-28 11:44:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-11-28 11:44:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 839 transitions. [2018-11-28 11:44:29,363 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 839 transitions. Word has length 69 [2018-11-28 11:44:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,363 INFO L480 AbstractCegarLoop]: Abstraction has 670 states and 839 transitions. [2018-11-28 11:44:29,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 839 transitions. [2018-11-28 11:44:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 11:44:29,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:29,365 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1070160589, now seen corresponding path program 1 times [2018-11-28 11:44:29,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:44:29,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 11:44:29,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:44:29,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:29,400 INFO L87 Difference]: Start difference. First operand 670 states and 839 transitions. Second operand 3 states. [2018-11-28 11:44:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,434 INFO L93 Difference]: Finished difference Result 696 states and 869 transitions. [2018-11-28 11:44:29,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:44:29,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 11:44:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,437 INFO L225 Difference]: With dead ends: 696 [2018-11-28 11:44:29,437 INFO L226 Difference]: Without dead ends: 656 [2018-11-28 11:44:29,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:44:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-11-28 11:44:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2018-11-28 11:44:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-28 11:44:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 814 transitions. [2018-11-28 11:44:29,464 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 814 transitions. Word has length 69 [2018-11-28 11:44:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,464 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 814 transitions. [2018-11-28 11:44:29,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 11:44:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 814 transitions. [2018-11-28 11:44:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:44:29,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:29,466 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash -81188571, now seen corresponding path program 1 times [2018-11-28 11:44:29,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,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-11-28 11:44:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:29,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:29,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:29,560 INFO L87 Difference]: Start difference. First operand 652 states and 814 transitions. Second operand 14 states. [2018-11-28 11:44:29,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,691 INFO L93 Difference]: Finished difference Result 716 states and 882 transitions. [2018-11-28 11:44:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:44:29,692 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-28 11:44:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,693 INFO L225 Difference]: With dead ends: 716 [2018-11-28 11:44:29,693 INFO L226 Difference]: Without dead ends: 646 [2018-11-28 11:44:29,694 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-11-28 11:44:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-11-28 11:44:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2018-11-28 11:44:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-28 11:44:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 805 transitions. [2018-11-28 11:44:29,735 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 805 transitions. Word has length 71 [2018-11-28 11:44:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,735 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 805 transitions. [2018-11-28 11:44:29,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 805 transitions. [2018-11-28 11:44:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:44:29,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:29,737 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,737 INFO L82 PathProgramCache]: Analyzing trace with hash -37760830, now seen corresponding path program 1 times [2018-11-28 11:44:29,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:29,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:29,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:29,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:29,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:29,798 INFO L87 Difference]: Start difference. First operand 646 states and 805 transitions. Second operand 5 states. [2018-11-28 11:44:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:29,867 INFO L93 Difference]: Finished difference Result 693 states and 854 transitions. [2018-11-28 11:44:29,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:29,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-11-28 11:44:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:29,869 INFO L225 Difference]: With dead ends: 693 [2018-11-28 11:44:29,869 INFO L226 Difference]: Without dead ends: 650 [2018-11-28 11:44:29,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-28 11:44:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 646. [2018-11-28 11:44:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-28 11:44:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 804 transitions. [2018-11-28 11:44:29,914 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 804 transitions. Word has length 71 [2018-11-28 11:44:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:29,914 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 804 transitions. [2018-11-28 11:44:29,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 804 transitions. [2018-11-28 11:44:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:44:29,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:29,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:29,916 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:29,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2013223168, now seen corresponding path program 1 times [2018-11-28 11:44:29,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:29,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:30,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:30,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:30,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:30,044 INFO L87 Difference]: Start difference. First operand 646 states and 804 transitions. Second operand 14 states. [2018-11-28 11:44:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:30,218 INFO L93 Difference]: Finished difference Result 670 states and 830 transitions. [2018-11-28 11:44:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:44:30,220 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-11-28 11:44:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:30,221 INFO L225 Difference]: With dead ends: 670 [2018-11-28 11:44:30,221 INFO L226 Difference]: Without dead ends: 639 [2018-11-28 11:44:30,222 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-11-28 11:44:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-28 11:44:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-11-28 11:44:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-11-28 11:44:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 794 transitions. [2018-11-28 11:44:30,265 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 794 transitions. Word has length 71 [2018-11-28 11:44:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:30,265 INFO L480 AbstractCegarLoop]: Abstraction has 639 states and 794 transitions. [2018-11-28 11:44:30,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 794 transitions. [2018-11-28 11:44:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-28 11:44:30,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:30,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:30,267 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:30,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:30,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1067828418, now seen corresponding path program 1 times [2018-11-28 11:44:30,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:30,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:30,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:30,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:30,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:44:30,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:44:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:44:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:44:30,339 INFO L87 Difference]: Start difference. First operand 639 states and 794 transitions. Second operand 7 states. [2018-11-28 11:44:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:30,441 INFO L93 Difference]: Finished difference Result 693 states and 855 transitions. [2018-11-28 11:44:30,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:44:30,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-11-28 11:44:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:30,447 INFO L225 Difference]: With dead ends: 693 [2018-11-28 11:44:30,448 INFO L226 Difference]: Without dead ends: 637 [2018-11-28 11:44:30,448 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-11-28 11:44:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-11-28 11:44:30,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 633. [2018-11-28 11:44:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-28 11:44:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 784 transitions. [2018-11-28 11:44:30,489 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 784 transitions. Word has length 77 [2018-11-28 11:44:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:30,489 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 784 transitions. [2018-11-28 11:44:30,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:44:30,489 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 784 transitions. [2018-11-28 11:44:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 11:44:30,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:30,490 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:30,491 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:30,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -615466654, now seen corresponding path program 1 times [2018-11-28 11:44:30,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:30,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:30,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:30,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:30,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:30,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 11:44:30,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 11:44:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:44:30,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:44:30,603 INFO L87 Difference]: Start difference. First operand 633 states and 784 transitions. Second operand 14 states. [2018-11-28 11:44:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:30,805 INFO L93 Difference]: Finished difference Result 692 states and 846 transitions. [2018-11-28 11:44:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:44:30,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-28 11:44:30,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:30,808 INFO L225 Difference]: With dead ends: 692 [2018-11-28 11:44:30,808 INFO L226 Difference]: Without dead ends: 621 [2018-11-28 11:44:30,809 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-11-28 11:44:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-11-28 11:44:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2018-11-28 11:44:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-28 11:44:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 765 transitions. [2018-11-28 11:44:30,855 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 765 transitions. Word has length 72 [2018-11-28 11:44:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:30,856 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 765 transitions. [2018-11-28 11:44:30,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 11:44:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 765 transitions. [2018-11-28 11:44:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 11:44:30,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:30,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:30,857 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:30,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2025859791, now seen corresponding path program 1 times [2018-11-28 11:44:30,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:30,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:30,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 11:44:30,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 11:44:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 11:44:30,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 11:44:30,952 INFO L87 Difference]: Start difference. First operand 621 states and 765 transitions. Second operand 11 states. [2018-11-28 11:44:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:31,076 INFO L93 Difference]: Finished difference Result 812 states and 992 transitions. [2018-11-28 11:44:31,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:31,076 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-28 11:44:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:31,078 INFO L225 Difference]: With dead ends: 812 [2018-11-28 11:44:31,078 INFO L226 Difference]: Without dead ends: 663 [2018-11-28 11:44:31,079 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-11-28 11:44:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-28 11:44:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 627. [2018-11-28 11:44:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2018-11-28 11:44:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 767 transitions. [2018-11-28 11:44:31,105 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 767 transitions. Word has length 71 [2018-11-28 11:44:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:31,105 INFO L480 AbstractCegarLoop]: Abstraction has 627 states and 767 transitions. [2018-11-28 11:44:31,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 11:44:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 767 transitions. [2018-11-28 11:44:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 11:44:31,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:31,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:31,106 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:31,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1771854681, now seen corresponding path program 1 times [2018-11-28 11:44:31,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:31,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:31,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:31,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 11:44:31,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:44:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:44:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:44:31,249 INFO L87 Difference]: Start difference. First operand 627 states and 767 transitions. Second operand 13 states. [2018-11-28 11:44:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:31,405 INFO L93 Difference]: Finished difference Result 647 states and 788 transitions. [2018-11-28 11:44:31,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:44:31,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-11-28 11:44:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:31,407 INFO L225 Difference]: With dead ends: 647 [2018-11-28 11:44:31,407 INFO L226 Difference]: Without dead ends: 622 [2018-11-28 11:44:31,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-11-28 11:44:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2018-11-28 11:44:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-28 11:44:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 759 transitions. [2018-11-28 11:44:31,433 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 759 transitions. Word has length 79 [2018-11-28 11:44:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:31,433 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 759 transitions. [2018-11-28 11:44:31,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:44:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 759 transitions. [2018-11-28 11:44:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 11:44:31,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:31,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:31,435 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:31,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash -253233342, now seen corresponding path program 1 times [2018-11-28 11:44:31,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:31,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-28 11:44:31,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 11:44:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 11:44:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:44:31,535 INFO L87 Difference]: Start difference. First operand 622 states and 759 transitions. Second operand 13 states. [2018-11-28 11:44:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:31,679 INFO L93 Difference]: Finished difference Result 624 states and 760 transitions. [2018-11-28 11:44:31,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 11:44:31,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-28 11:44:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:31,680 INFO L225 Difference]: With dead ends: 624 [2018-11-28 11:44:31,681 INFO L226 Difference]: Without dead ends: 573 [2018-11-28 11:44:31,681 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-11-28 11:44:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-11-28 11:44:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2018-11-28 11:44:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-11-28 11:44:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 705 transitions. [2018-11-28 11:44:31,707 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 705 transitions. Word has length 72 [2018-11-28 11:44:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:31,707 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 705 transitions. [2018-11-28 11:44:31,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 11:44:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 705 transitions. [2018-11-28 11:44:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 11:44:31,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:31,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:31,709 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:31,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1632556457, now seen corresponding path program 1 times [2018-11-28 11:44:31,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:31,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:31,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:31,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-11-28 11:44:31,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:31,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-28 11:44:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 11:44:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:44:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:44:31,775 INFO L87 Difference]: Start difference. First operand 573 states and 705 transitions. Second operand 10 states. [2018-11-28 11:44:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:32,579 INFO L93 Difference]: Finished difference Result 1190 states and 1457 transitions. [2018-11-28 11:44:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 11:44:32,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-11-28 11:44:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:32,581 INFO L225 Difference]: With dead ends: 1190 [2018-11-28 11:44:32,581 INFO L226 Difference]: Without dead ends: 1043 [2018-11-28 11:44:32,581 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-11-28 11:44:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2018-11-28 11:44:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 907. [2018-11-28 11:44:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-28 11:44:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1135 transitions. [2018-11-28 11:44:32,621 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1135 transitions. Word has length 73 [2018-11-28 11:44:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:32,621 INFO L480 AbstractCegarLoop]: Abstraction has 907 states and 1135 transitions. [2018-11-28 11:44:32,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 11:44:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1135 transitions. [2018-11-28 11:44:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 11:44:32,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:32,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:32,623 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:32,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1983138585, now seen corresponding path program 1 times [2018-11-28 11:44:32,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:32,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:32,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:32,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:44:32,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:44:32,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:44:32,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:44:32,683 INFO L87 Difference]: Start difference. First operand 907 states and 1135 transitions. Second operand 6 states. [2018-11-28 11:44:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:33,067 INFO L93 Difference]: Finished difference Result 1189 states and 1450 transitions. [2018-11-28 11:44:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:44:33,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-11-28 11:44:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:33,069 INFO L225 Difference]: With dead ends: 1189 [2018-11-28 11:44:33,069 INFO L226 Difference]: Without dead ends: 1059 [2018-11-28 11:44:33,069 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-11-28 11:44:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-11-28 11:44:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 998. [2018-11-28 11:44:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-11-28 11:44:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1243 transitions. [2018-11-28 11:44:33,117 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1243 transitions. Word has length 73 [2018-11-28 11:44:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:33,117 INFO L480 AbstractCegarLoop]: Abstraction has 998 states and 1243 transitions. [2018-11-28 11:44:33,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:44:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1243 transitions. [2018-11-28 11:44:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 11:44:33,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:33,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:33,119 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:33,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1013991573, now seen corresponding path program 1 times [2018-11-28 11:44:33,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:33,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:44:33,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:44:33,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:44:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:44:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:33,145 INFO L87 Difference]: Start difference. First operand 998 states and 1243 transitions. Second operand 5 states. [2018-11-28 11:44:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:33,198 INFO L93 Difference]: Finished difference Result 1043 states and 1291 transitions. [2018-11-28 11:44:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:44:33,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-28 11:44:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:33,200 INFO L225 Difference]: With dead ends: 1043 [2018-11-28 11:44:33,200 INFO L226 Difference]: Without dead ends: 978 [2018-11-28 11:44:33,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:44:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-11-28 11:44:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2018-11-28 11:44:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-11-28 11:44:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1215 transitions. [2018-11-28 11:44:33,250 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1215 transitions. Word has length 73 [2018-11-28 11:44:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:33,250 INFO L480 AbstractCegarLoop]: Abstraction has 978 states and 1215 transitions. [2018-11-28 11:44:33,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:44:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1215 transitions. [2018-11-28 11:44:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 11:44:33,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:33,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:33,252 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:33,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1533375131, now seen corresponding path program 1 times [2018-11-28 11:44:33,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:33,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:44:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:44:33,316 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:44:33,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:44:33 BoogieIcfgContainer [2018-11-28 11:44:33,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:44:33,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:44:33,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:44:33,394 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:44:33,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:13" (3/4) ... [2018-11-28 11:44:33,397 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:44:33,485 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b3d0ff04-b11d-46f5-adc2-7817e08258ab/bin-2019/uautomizer/witness.graphml [2018-11-28 11:44:33,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:44:33,486 INFO L168 Benchmark]: Toolchain (without parser) took 21246.13 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 779.1 MB). Free memory was 956.0 MB in the beginning and 1.8 GB in the end (delta: -798.6 MB). Peak memory consumption was 925.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,487 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:44:33,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,488 INFO L168 Benchmark]: Boogie Preprocessor took 59.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,488 INFO L168 Benchmark]: RCFGBuilder took 990.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.3 MB in the end (delta: 145.2 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,488 INFO L168 Benchmark]: TraceAbstraction took 19625.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 622.3 MB). Free memory was 975.3 MB in the beginning and 813.6 MB in the end (delta: 161.7 MB). Peak memory consumption was 784.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,488 INFO L168 Benchmark]: Witness Printer took 91.31 ms. Allocated memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 5.2 MB). Free memory was 813.6 MB in the beginning and 1.8 GB in the end (delta: -940.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-28 11:44:33,490 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 443.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -171.3 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 990.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.3 MB in the end (delta: 145.2 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19625.74 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 622.3 MB). Free memory was 975.3 MB in the beginning and 813.6 MB in the end (delta: 161.7 MB). Peak memory consumption was 784.0 MB. Max. memory is 11.5 GB. * Witness Printer took 91.31 ms. Allocated memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 5.2 MB). Free memory was 813.6 MB in the beginning and 1.8 GB in the end (delta: -940.9 MB). Peak memory consumption was 9.6 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, 19.5s OverallTime, 66 OverallIterations, 2 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38223 SDtfs, 15926 SDslu, 162841 SDs, 0 SdLazy, 13303 SolverSat, 2550 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 145 SyntacticMatches, 6 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=998occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 65 MinimizatonAttempts, 1879 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3891 NumberOfCodeBlocks, 3891 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3753 ConstructedInterpolants, 0 QuantifiedInterpolants, 488107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...