java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:48:43,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:48:43,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:48:43,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:48:43,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:48:43,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:48:43,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:48:43,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:48:43,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:48:43,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:48:43,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:48:43,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:48:43,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:48:43,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:48:43,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:48:43,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:48:43,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:48:43,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:48:43,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:48:43,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:48:43,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:48:43,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:48:43,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:48:43,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:48:43,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:48:43,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:48:43,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:48:43,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:48:43,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:48:43,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:48:43,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:48:43,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:48:43,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:48:43,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:48:43,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:48:43,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:48:43,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:48:43,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:48:43,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:48:43,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:48:43,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:48:43,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:48:43,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:48:43,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:48:43,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:48:43,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:48:43,686 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:48:43,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:48:43,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:48:43,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:48:43,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:48:43,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:48:43,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:48:43,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:48:43,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:48:43,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:48:43,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:48:43,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:48:43,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:48:43,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:48:43,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:48:43,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:48:43,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:48:43,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:48:43,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:48:43,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:48:43,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:48:43,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:48:43,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:48:43,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:48:43,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:48:43,971 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:48:43,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:48:43,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:48:43,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:48:43,988 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:48:43,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-07 13:48:44,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9634fd762/8a2105559e9f4026bb58b283c9dafdb7/FLAGcec094dde [2019-10-07 13:48:44,689 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:48:44,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2019-10-07 13:48:44,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9634fd762/8a2105559e9f4026bb58b283c9dafdb7/FLAGcec094dde [2019-10-07 13:48:44,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9634fd762/8a2105559e9f4026bb58b283c9dafdb7 [2019-10-07 13:48:44,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:48:44,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:48:44,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:48:44,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:48:44,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:48:44,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:48:44" (1/1) ... [2019-10-07 13:48:44,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671e4bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:44, skipping insertion in model container [2019-10-07 13:48:44,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:48:44" (1/1) ... [2019-10-07 13:48:44,902 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:48:44,969 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:48:45,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:48:45,563 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:48:45,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:48:45,759 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:48:45,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45 WrapperNode [2019-10-07 13:48:45,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:48:45,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:48:45,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:48:45,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:48:45,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... [2019-10-07 13:48:45,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:48:45,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:48:45,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:48:45,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:48:45,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-07 13:48:45,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:48:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:48:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:48:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:48:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2019-10-07 13:48:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2019-10-07 13:48:45,968 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2019-10-07 13:48:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2019-10-07 13:48:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2019-10-07 13:48:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2019-10-07 13:48:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2019-10-07 13:48:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2019-10-07 13:48:45,969 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2019-10-07 13:48:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2019-10-07 13:48:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2019-10-07 13:48:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2019-10-07 13:48:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2019-10-07 13:48:45,970 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2019-10-07 13:48:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2019-10-07 13:48:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2019-10-07 13:48:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2019-10-07 13:48:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:48:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:48:45,971 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:48:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:48:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:48:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:48:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:48:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-07 13:48:45,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2019-10-07 13:48:45,973 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2019-10-07 13:48:45,974 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2019-10-07 13:48:45,975 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:48:45,976 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:48:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2019-10-07 13:48:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2019-10-07 13:48:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:48:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:48:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:48:45,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:48:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:48:46,637 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:46,782 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-07 13:48:46,782 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-07 13:48:46,789 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:46,851 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-07 13:48:46,852 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-07 13:48:46,883 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:46,906 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:48:46,906 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:48:47,001 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:47,057 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint L304: #res := 0; [2019-10-07 13:48:47,057 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-07 13:48:47,057 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-07 13:48:47,063 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:47,248 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2019-10-07 13:48:47,249 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2019-10-07 13:48:47,250 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:47,283 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-07 13:48:47,284 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-07 13:48:47,314 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:47,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-07 13:48:47,338 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-07 13:48:47,345 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:47,560 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2019-10-07 13:48:47,561 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2019-10-07 13:48:47,574 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:48:47,583 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:48:47,584 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:48:48,145 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:48:48,146 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:48:48,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:48:48 BoogieIcfgContainer [2019-10-07 13:48:48,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:48:48,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:48:48,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:48:48,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:48:48,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:48:44" (1/3) ... [2019-10-07 13:48:48,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6887a835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:48:48, skipping insertion in model container [2019-10-07 13:48:48,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:48:45" (2/3) ... [2019-10-07 13:48:48,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6887a835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:48:48, skipping insertion in model container [2019-10-07 13:48:48,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:48:48" (3/3) ... [2019-10-07 13:48:48,155 INFO L109 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2019-10-07 13:48:48,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:48:48,173 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:48:48,184 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:48:48,213 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:48:48,213 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:48:48,213 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:48:48,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:48:48,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:48:48,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:48:48,214 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:48:48,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:48:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2019-10-07 13:48:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:48:48,262 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:48,264 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:48,266 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1896705104, now seen corresponding path program 1 times [2019-10-07 13:48:48,281 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:48,282 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:48,282 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:48,283 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:48,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:48,563 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:48,563 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:48,564 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:48,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:48,585 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2019-10-07 13:48:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:48,771 INFO L93 Difference]: Finished difference Result 706 states and 1095 transitions. [2019-10-07 13:48:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:48,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:48:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:48,791 INFO L225 Difference]: With dead ends: 706 [2019-10-07 13:48:48,791 INFO L226 Difference]: Without dead ends: 404 [2019-10-07 13:48:48,800 INFO L606 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 [2019-10-07 13:48:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-07 13:48:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-10-07 13:48:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-07 13:48:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 582 transitions. [2019-10-07 13:48:48,946 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 582 transitions. Word has length 18 [2019-10-07 13:48:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:48,946 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 582 transitions. [2019-10-07 13:48:48,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 582 transitions. [2019-10-07 13:48:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:48:48,948 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:48,948 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:48,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash -120255175, now seen corresponding path program 1 times [2019-10-07 13:48:48,949 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:48,949 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:48,950 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:48,950 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:49,111 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,111 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:49,112 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:49,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:49,118 INFO L87 Difference]: Start difference. First operand 404 states and 582 transitions. Second operand 3 states. [2019-10-07 13:48:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:49,335 INFO L93 Difference]: Finished difference Result 576 states and 812 transitions. [2019-10-07 13:48:49,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:49,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 13:48:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:49,342 INFO L225 Difference]: With dead ends: 576 [2019-10-07 13:48:49,342 INFO L226 Difference]: Without dead ends: 477 [2019-10-07 13:48:49,344 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-07 13:48:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 473. [2019-10-07 13:48:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-10-07 13:48:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 675 transitions. [2019-10-07 13:48:49,378 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 675 transitions. Word has length 21 [2019-10-07 13:48:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:49,404 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 675 transitions. [2019-10-07 13:48:49,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 675 transitions. [2019-10-07 13:48:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:48:49,407 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:49,408 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:49,408 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:49,408 INFO L82 PathProgramCache]: Analyzing trace with hash -845502214, now seen corresponding path program 1 times [2019-10-07 13:48:49,409 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:49,409 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,409 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,409 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:49,510 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,511 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:49,511 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:49,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:49,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:49,512 INFO L87 Difference]: Start difference. First operand 473 states and 675 transitions. Second operand 3 states. [2019-10-07 13:48:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:49,553 INFO L93 Difference]: Finished difference Result 691 states and 959 transitions. [2019-10-07 13:48:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:49,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-07 13:48:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:49,558 INFO L225 Difference]: With dead ends: 691 [2019-10-07 13:48:49,558 INFO L226 Difference]: Without dead ends: 582 [2019-10-07 13:48:49,559 INFO L606 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 [2019-10-07 13:48:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-07 13:48:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 543. [2019-10-07 13:48:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-07 13:48:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 767 transitions. [2019-10-07 13:48:49,591 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 767 transitions. Word has length 26 [2019-10-07 13:48:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:49,592 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 767 transitions. [2019-10-07 13:48:49,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 767 transitions. [2019-10-07 13:48:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:48:49,595 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:49,595 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:49,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash 502235177, now seen corresponding path program 1 times [2019-10-07 13:48:49,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:49,597 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:49,658 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,658 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:49,658 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:49,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:49,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:49,659 INFO L87 Difference]: Start difference. First operand 543 states and 767 transitions. Second operand 3 states. [2019-10-07 13:48:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:49,857 INFO L93 Difference]: Finished difference Result 1030 states and 1499 transitions. [2019-10-07 13:48:49,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:49,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 13:48:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:49,871 INFO L225 Difference]: With dead ends: 1030 [2019-10-07 13:48:49,872 INFO L226 Difference]: Without dead ends: 822 [2019-10-07 13:48:49,874 INFO L606 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 [2019-10-07 13:48:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-10-07 13:48:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 670. [2019-10-07 13:48:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-07 13:48:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 993 transitions. [2019-10-07 13:48:49,942 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 993 transitions. Word has length 27 [2019-10-07 13:48:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:49,946 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 993 transitions. [2019-10-07 13:48:49,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 993 transitions. [2019-10-07 13:48:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:48:49,951 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:49,952 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:49,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1848972292, now seen corresponding path program 1 times [2019-10-07 13:48:49,957 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:49,958 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:49,958 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,959 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:50,089 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:50,090 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:50,090 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:48:50,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:48:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:48:50,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:48:50,091 INFO L87 Difference]: Start difference. First operand 670 states and 993 transitions. Second operand 5 states. [2019-10-07 13:48:50,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:50,853 INFO L93 Difference]: Finished difference Result 1138 states and 1680 transitions. [2019-10-07 13:48:50,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:48:50,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-07 13:48:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:50,859 INFO L225 Difference]: With dead ends: 1138 [2019-10-07 13:48:50,859 INFO L226 Difference]: Without dead ends: 721 [2019-10-07 13:48:50,861 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:48:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-07 13:48:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 658. [2019-10-07 13:48:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-07 13:48:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 969 transitions. [2019-10-07 13:48:50,900 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 969 transitions. Word has length 28 [2019-10-07 13:48:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:50,900 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 969 transitions. [2019-10-07 13:48:50,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:48:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 969 transitions. [2019-10-07 13:48:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-07 13:48:50,902 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:50,902 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:50,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 599155873, now seen corresponding path program 1 times [2019-10-07 13:48:50,903 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:50,903 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:50,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:50,904 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:50,977 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:50,977 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:50,977 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:50,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:50,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:50,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:50,979 INFO L87 Difference]: Start difference. First operand 658 states and 969 transitions. Second operand 3 states. [2019-10-07 13:48:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:51,054 INFO L93 Difference]: Finished difference Result 661 states and 971 transitions. [2019-10-07 13:48:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:51,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-07 13:48:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:51,059 INFO L225 Difference]: With dead ends: 661 [2019-10-07 13:48:51,060 INFO L226 Difference]: Without dead ends: 657 [2019-10-07 13:48:51,060 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-07 13:48:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-07 13:48:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-07 13:48:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 966 transitions. [2019-10-07 13:48:51,108 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 966 transitions. Word has length 29 [2019-10-07 13:48:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,110 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 966 transitions. [2019-10-07 13:48:51,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 966 transitions. [2019-10-07 13:48:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 13:48:51,116 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,116 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:51,117 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1989182425, now seen corresponding path program 1 times [2019-10-07 13:48:51,117 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,117 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,118 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,118 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,184 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,184 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,184 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:51,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:51,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:51,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,185 INFO L87 Difference]: Start difference. First operand 657 states and 966 transitions. Second operand 3 states. [2019-10-07 13:48:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:51,261 INFO L93 Difference]: Finished difference Result 931 states and 1326 transitions. [2019-10-07 13:48:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:51,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-07 13:48:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:51,266 INFO L225 Difference]: With dead ends: 931 [2019-10-07 13:48:51,266 INFO L226 Difference]: Without dead ends: 741 [2019-10-07 13:48:51,267 INFO L606 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 [2019-10-07 13:48:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-10-07 13:48:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 639. [2019-10-07 13:48:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-07 13:48:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 905 transitions. [2019-10-07 13:48:51,302 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 905 transitions. Word has length 35 [2019-10-07 13:48:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,303 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 905 transitions. [2019-10-07 13:48:51,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 905 transitions. [2019-10-07 13:48:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:48:51,305 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,306 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:51,306 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1855799109, now seen corresponding path program 1 times [2019-10-07 13:48:51,307 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,307 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,355 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,356 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,356 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:51,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,357 INFO L87 Difference]: Start difference. First operand 639 states and 905 transitions. Second operand 3 states. [2019-10-07 13:48:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:51,406 INFO L93 Difference]: Finished difference Result 707 states and 990 transitions. [2019-10-07 13:48:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:51,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-07 13:48:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:51,411 INFO L225 Difference]: With dead ends: 707 [2019-10-07 13:48:51,411 INFO L226 Difference]: Without dead ends: 687 [2019-10-07 13:48:51,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-10-07 13:48:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 678. [2019-10-07 13:48:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-07 13:48:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 952 transitions. [2019-10-07 13:48:51,447 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 952 transitions. Word has length 36 [2019-10-07 13:48:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,448 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 952 transitions. [2019-10-07 13:48:51,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 952 transitions. [2019-10-07 13:48:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:51,451 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,451 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:51,451 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 935929741, now seen corresponding path program 1 times [2019-10-07 13:48:51,452 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,452 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,452 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,452 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,500 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,500 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,500 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:51,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:51,501 INFO L87 Difference]: Start difference. First operand 678 states and 952 transitions. Second operand 3 states. [2019-10-07 13:48:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:51,542 INFO L93 Difference]: Finished difference Result 883 states and 1226 transitions. [2019-10-07 13:48:51,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:51,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:48:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:51,546 INFO L225 Difference]: With dead ends: 883 [2019-10-07 13:48:51,546 INFO L226 Difference]: Without dead ends: 709 [2019-10-07 13:48:51,547 INFO L606 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 [2019-10-07 13:48:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-10-07 13:48:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 678. [2019-10-07 13:48:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-10-07 13:48:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 950 transitions. [2019-10-07 13:48:51,584 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 950 transitions. Word has length 42 [2019-10-07 13:48:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:51,584 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 950 transitions. [2019-10-07 13:48:51,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 950 transitions. [2019-10-07 13:48:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:51,587 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:51,587 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:51,587 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:51,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1568310813, now seen corresponding path program 1 times [2019-10-07 13:48:51,588 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:51,588 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,588 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,588 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:51,637 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:51,637 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:51,637 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:48:51,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:48:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:48:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:48:51,638 INFO L87 Difference]: Start difference. First operand 678 states and 950 transitions. Second operand 4 states. [2019-10-07 13:48:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:52,022 INFO L93 Difference]: Finished difference Result 779 states and 1066 transitions. [2019-10-07 13:48:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:48:52,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-07 13:48:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:52,027 INFO L225 Difference]: With dead ends: 779 [2019-10-07 13:48:52,027 INFO L226 Difference]: Without dead ends: 605 [2019-10-07 13:48:52,028 INFO L606 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 [2019-10-07 13:48:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-07 13:48:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 576. [2019-10-07 13:48:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-07 13:48:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 795 transitions. [2019-10-07 13:48:52,084 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 795 transitions. Word has length 42 [2019-10-07 13:48:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:52,085 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 795 transitions. [2019-10-07 13:48:52,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:48:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 795 transitions. [2019-10-07 13:48:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:48:52,087 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:52,087 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:52,087 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 78626218, now seen corresponding path program 1 times [2019-10-07 13:48:52,088 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:52,088 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,088 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,088 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:52,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,151 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:52,151 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:52,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:52,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:52,152 INFO L87 Difference]: Start difference. First operand 576 states and 795 transitions. Second operand 3 states. [2019-10-07 13:48:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:52,295 INFO L93 Difference]: Finished difference Result 745 states and 1022 transitions. [2019-10-07 13:48:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:52,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 13:48:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:52,301 INFO L225 Difference]: With dead ends: 745 [2019-10-07 13:48:52,302 INFO L226 Difference]: Without dead ends: 731 [2019-10-07 13:48:52,303 INFO L606 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 [2019-10-07 13:48:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-07 13:48:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 647. [2019-10-07 13:48:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-07 13:48:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 881 transitions. [2019-10-07 13:48:52,342 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 881 transitions. Word has length 40 [2019-10-07 13:48:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:52,343 INFO L462 AbstractCegarLoop]: Abstraction has 647 states and 881 transitions. [2019-10-07 13:48:52,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 881 transitions. [2019-10-07 13:48:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:48:52,346 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:52,346 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:52,346 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:52,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1459422559, now seen corresponding path program 1 times [2019-10-07 13:48:52,347 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:52,347 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,347 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,347 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:52,383 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,384 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:52,384 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:52,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:52,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:52,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:52,385 INFO L87 Difference]: Start difference. First operand 647 states and 881 transitions. Second operand 3 states. [2019-10-07 13:48:52,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:52,424 INFO L93 Difference]: Finished difference Result 756 states and 1006 transitions. [2019-10-07 13:48:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:52,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-07 13:48:52,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:52,428 INFO L225 Difference]: With dead ends: 756 [2019-10-07 13:48:52,428 INFO L226 Difference]: Without dead ends: 670 [2019-10-07 13:48:52,429 INFO L606 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 [2019-10-07 13:48:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-07 13:48:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 644. [2019-10-07 13:48:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-07 13:48:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 873 transitions. [2019-10-07 13:48:52,464 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 873 transitions. Word has length 43 [2019-10-07 13:48:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:52,464 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 873 transitions. [2019-10-07 13:48:52,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 873 transitions. [2019-10-07 13:48:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:48:52,466 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:52,467 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:52,467 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1413689562, now seen corresponding path program 1 times [2019-10-07 13:48:52,467 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:52,468 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,468 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,468 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:52,582 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:52,582 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:52,582 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:48:52,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:48:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:48:52,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:48:52,583 INFO L87 Difference]: Start difference. First operand 644 states and 873 transitions. Second operand 10 states. [2019-10-07 13:48:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:54,689 INFO L93 Difference]: Finished difference Result 820 states and 1147 transitions. [2019-10-07 13:48:54,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:48:54,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-07 13:48:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:54,695 INFO L225 Difference]: With dead ends: 820 [2019-10-07 13:48:54,695 INFO L226 Difference]: Without dead ends: 812 [2019-10-07 13:48:54,696 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:48:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-10-07 13:48:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 651. [2019-10-07 13:48:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-07 13:48:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 875 transitions. [2019-10-07 13:48:54,735 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 875 transitions. Word has length 41 [2019-10-07 13:48:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:54,736 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 875 transitions. [2019-10-07 13:48:54,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:48:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 875 transitions. [2019-10-07 13:48:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:48:54,738 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:54,739 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:54,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:54,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1528304234, now seen corresponding path program 1 times [2019-10-07 13:48:54,739 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:54,740 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:54,740 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:54,740 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:54,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:54,799 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:54,799 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:54,799 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:48:54,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:48:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:48:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:48:54,801 INFO L87 Difference]: Start difference. First operand 651 states and 875 transitions. Second operand 7 states. [2019-10-07 13:48:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:55,785 INFO L93 Difference]: Finished difference Result 780 states and 1084 transitions. [2019-10-07 13:48:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:48:55,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-07 13:48:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:55,790 INFO L225 Difference]: With dead ends: 780 [2019-10-07 13:48:55,790 INFO L226 Difference]: Without dead ends: 725 [2019-10-07 13:48:55,791 INFO L606 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 [2019-10-07 13:48:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-07 13:48:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 651. [2019-10-07 13:48:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-07 13:48:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 873 transitions. [2019-10-07 13:48:55,830 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 873 transitions. Word has length 41 [2019-10-07 13:48:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:55,830 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 873 transitions. [2019-10-07 13:48:55,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:48:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 873 transitions. [2019-10-07 13:48:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:55,833 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:55,833 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:55,833 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1515029715, now seen corresponding path program 1 times [2019-10-07 13:48:55,834 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:55,834 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:55,834 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:55,834 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:55,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:55,912 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:55,912 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:55,912 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:48:55,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:48:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:48:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:48:55,913 INFO L87 Difference]: Start difference. First operand 651 states and 873 transitions. Second operand 9 states. [2019-10-07 13:48:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:57,760 INFO L93 Difference]: Finished difference Result 774 states and 1066 transitions. [2019-10-07 13:48:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:48:57,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-07 13:48:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:57,765 INFO L225 Difference]: With dead ends: 774 [2019-10-07 13:48:57,766 INFO L226 Difference]: Without dead ends: 721 [2019-10-07 13:48:57,766 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:48:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-10-07 13:48:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 586. [2019-10-07 13:48:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-07 13:48:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 789 transitions. [2019-10-07 13:48:57,805 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 789 transitions. Word has length 42 [2019-10-07 13:48:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:57,806 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 789 transitions. [2019-10-07 13:48:57,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:48:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 789 transitions. [2019-10-07 13:48:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 13:48:57,808 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:57,808 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:57,808 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 23868549, now seen corresponding path program 1 times [2019-10-07 13:48:57,809 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:57,809 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:57,809 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:57,809 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:57,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:57,844 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:57,844 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:57,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:57,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:57,845 INFO L87 Difference]: Start difference. First operand 586 states and 789 transitions. Second operand 3 states. [2019-10-07 13:48:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:57,944 INFO L93 Difference]: Finished difference Result 738 states and 988 transitions. [2019-10-07 13:48:57,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:57,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 13:48:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:57,949 INFO L225 Difference]: With dead ends: 738 [2019-10-07 13:48:57,949 INFO L226 Difference]: Without dead ends: 722 [2019-10-07 13:48:57,949 INFO L606 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 [2019-10-07 13:48:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-10-07 13:48:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 636. [2019-10-07 13:48:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-07 13:48:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 843 transitions. [2019-10-07 13:48:57,989 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 843 transitions. Word has length 42 [2019-10-07 13:48:57,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:57,990 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 843 transitions. [2019-10-07 13:48:57,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 843 transitions. [2019-10-07 13:48:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:48:57,992 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:57,992 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:57,992 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1183789995, now seen corresponding path program 1 times [2019-10-07 13:48:57,993 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:57,993 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:57,993 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:57,993 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:58,087 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:58,087 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:58,087 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:48:58,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:48:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:48:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:48:58,088 INFO L87 Difference]: Start difference. First operand 636 states and 843 transitions. Second operand 8 states. [2019-10-07 13:48:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:58,225 INFO L93 Difference]: Finished difference Result 651 states and 860 transitions. [2019-10-07 13:48:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:48:58,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-07 13:48:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:58,231 INFO L225 Difference]: With dead ends: 651 [2019-10-07 13:48:58,231 INFO L226 Difference]: Without dead ends: 647 [2019-10-07 13:48:58,233 INFO L606 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 [2019-10-07 13:48:58,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-07 13:48:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2019-10-07 13:48:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-07 13:48:58,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 854 transitions. [2019-10-07 13:48:58,278 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 854 transitions. Word has length 43 [2019-10-07 13:48:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:58,279 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 854 transitions. [2019-10-07 13:48:58,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:48:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 854 transitions. [2019-10-07 13:48:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:48:58,281 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:58,281 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:58,282 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:58,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1183513165, now seen corresponding path program 1 times [2019-10-07 13:48:58,282 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:58,282 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:58,282 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:58,283 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:58,338 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:58,338 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:58,338 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:48:58,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:48:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:48:58,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:48:58,339 INFO L87 Difference]: Start difference. First operand 645 states and 854 transitions. Second operand 5 states. [2019-10-07 13:48:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:58,970 INFO L93 Difference]: Finished difference Result 733 states and 977 transitions. [2019-10-07 13:48:58,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:48:58,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-07 13:48:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:58,976 INFO L225 Difference]: With dead ends: 733 [2019-10-07 13:48:58,976 INFO L226 Difference]: Without dead ends: 703 [2019-10-07 13:48:58,976 INFO L606 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 [2019-10-07 13:48:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-07 13:48:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 622. [2019-10-07 13:48:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-07 13:48:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 829 transitions. [2019-10-07 13:48:59,021 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 829 transitions. Word has length 43 [2019-10-07 13:48:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:59,021 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 829 transitions. [2019-10-07 13:48:59,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:48:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 829 transitions. [2019-10-07 13:48:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:48:59,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:59,023 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:59,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 442275922, now seen corresponding path program 1 times [2019-10-07 13:48:59,024 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:59,024 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,024 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:59,060 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,060 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:59,060 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:59,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:59,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:59,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:59,061 INFO L87 Difference]: Start difference. First operand 622 states and 829 transitions. Second operand 3 states. [2019-10-07 13:48:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:59,133 INFO L93 Difference]: Finished difference Result 650 states and 861 transitions. [2019-10-07 13:48:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:59,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 13:48:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:59,137 INFO L225 Difference]: With dead ends: 650 [2019-10-07 13:48:59,137 INFO L226 Difference]: Without dead ends: 643 [2019-10-07 13:48:59,137 INFO L606 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 [2019-10-07 13:48:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-07 13:48:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 639. [2019-10-07 13:48:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-07 13:48:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 849 transitions. [2019-10-07 13:48:59,179 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 849 transitions. Word has length 45 [2019-10-07 13:48:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:59,180 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 849 transitions. [2019-10-07 13:48:59,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 849 transitions. [2019-10-07 13:48:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:48:59,182 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:59,182 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:59,182 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash 818895296, now seen corresponding path program 1 times [2019-10-07 13:48:59,183 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:59,183 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:59,220 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,220 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:59,220 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:48:59,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:48:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:48:59,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:48:59,221 INFO L87 Difference]: Start difference. First operand 639 states and 849 transitions. Second operand 3 states. [2019-10-07 13:48:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:48:59,292 INFO L93 Difference]: Finished difference Result 811 states and 1071 transitions. [2019-10-07 13:48:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:48:59,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-07 13:48:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:48:59,297 INFO L225 Difference]: With dead ends: 811 [2019-10-07 13:48:59,297 INFO L226 Difference]: Without dead ends: 612 [2019-10-07 13:48:59,298 INFO L606 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 [2019-10-07 13:48:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-07 13:48:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-07 13:48:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-07 13:48:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 813 transitions. [2019-10-07 13:48:59,345 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 813 transitions. Word has length 50 [2019-10-07 13:48:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:48:59,346 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 813 transitions. [2019-10-07 13:48:59,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:48:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 813 transitions. [2019-10-07 13:48:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:48:59,348 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:48:59,348 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:48:59,348 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:48:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:48:59,349 INFO L82 PathProgramCache]: Analyzing trace with hash 59708023, now seen corresponding path program 1 times [2019-10-07 13:48:59,349 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:48:59,349 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:48:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:48:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:48:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:48:59,505 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:48:59,505 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:48:59,505 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:48:59,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:48:59,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:48:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:48:59,507 INFO L87 Difference]: Start difference. First operand 612 states and 813 transitions. Second operand 13 states. [2019-10-07 13:49:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:01,078 INFO L93 Difference]: Finished difference Result 644 states and 847 transitions. [2019-10-07 13:49:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:01,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-07 13:49:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:01,083 INFO L225 Difference]: With dead ends: 644 [2019-10-07 13:49:01,084 INFO L226 Difference]: Without dead ends: 638 [2019-10-07 13:49:01,084 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:49:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-07 13:49:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 612. [2019-10-07 13:49:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-07 13:49:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 812 transitions. [2019-10-07 13:49:01,126 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 812 transitions. Word has length 47 [2019-10-07 13:49:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:01,126 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 812 transitions. [2019-10-07 13:49:01,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 812 transitions. [2019-10-07 13:49:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:49:01,129 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:01,129 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:01,129 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:01,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:01,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2131872599, now seen corresponding path program 1 times [2019-10-07 13:49:01,129 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:01,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,130 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:01,235 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,235 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:01,235 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:01,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:01,236 INFO L87 Difference]: Start difference. First operand 612 states and 812 transitions. Second operand 9 states. [2019-10-07 13:49:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:01,408 INFO L93 Difference]: Finished difference Result 636 states and 838 transitions. [2019-10-07 13:49:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:01,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-07 13:49:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:01,414 INFO L225 Difference]: With dead ends: 636 [2019-10-07 13:49:01,414 INFO L226 Difference]: Without dead ends: 607 [2019-10-07 13:49:01,415 INFO L606 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 [2019-10-07 13:49:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-07 13:49:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2019-10-07 13:49:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-07 13:49:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 795 transitions. [2019-10-07 13:49:01,456 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 795 transitions. Word has length 48 [2019-10-07 13:49:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:01,457 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 795 transitions. [2019-10-07 13:49:01,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 795 transitions. [2019-10-07 13:49:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:01,459 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:01,459 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:01,459 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:01,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1157902169, now seen corresponding path program 1 times [2019-10-07 13:49:01,460 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:01,460 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,460 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:01,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,583 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:01,583 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:01,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:01,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:01,584 INFO L87 Difference]: Start difference. First operand 607 states and 795 transitions. Second operand 10 states. [2019-10-07 13:49:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:01,819 INFO L93 Difference]: Finished difference Result 623 states and 812 transitions. [2019-10-07 13:49:01,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:49:01,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-07 13:49:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:01,823 INFO L225 Difference]: With dead ends: 623 [2019-10-07 13:49:01,823 INFO L226 Difference]: Without dead ends: 605 [2019-10-07 13:49:01,824 INFO L606 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 [2019-10-07 13:49:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-07 13:49:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-07 13:49:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-07 13:49:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 791 transitions. [2019-10-07 13:49:01,876 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 791 transitions. Word has length 50 [2019-10-07 13:49:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:01,876 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 791 transitions. [2019-10-07 13:49:01,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 791 transitions. [2019-10-07 13:49:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:49:01,879 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:01,879 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:01,879 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1617361323, now seen corresponding path program 1 times [2019-10-07 13:49:01,880 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:01,880 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:01,880 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,880 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:02,055 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:02,055 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:02,055 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:02,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:02,056 INFO L87 Difference]: Start difference. First operand 605 states and 791 transitions. Second operand 10 states. [2019-10-07 13:49:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:02,261 INFO L93 Difference]: Finished difference Result 618 states and 805 transitions. [2019-10-07 13:49:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:49:02,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-10-07 13:49:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:02,265 INFO L225 Difference]: With dead ends: 618 [2019-10-07 13:49:02,265 INFO L226 Difference]: Without dead ends: 600 [2019-10-07 13:49:02,265 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-07 13:49:02,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-10-07 13:49:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-10-07 13:49:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 784 transitions. [2019-10-07 13:49:02,304 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 784 transitions. Word has length 49 [2019-10-07 13:49:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:02,305 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 784 transitions. [2019-10-07 13:49:02,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 784 transitions. [2019-10-07 13:49:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:02,307 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:02,307 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:02,307 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:02,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1878962800, now seen corresponding path program 1 times [2019-10-07 13:49:02,308 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:02,308 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:02,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:02,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:02,425 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:02,425 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:02,425 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:02,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:02,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:02,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:02,426 INFO L87 Difference]: Start difference. First operand 600 states and 784 transitions. Second operand 12 states. [2019-10-07 13:49:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:02,658 INFO L93 Difference]: Finished difference Result 625 states and 811 transitions. [2019-10-07 13:49:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:02,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-10-07 13:49:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:02,662 INFO L225 Difference]: With dead ends: 625 [2019-10-07 13:49:02,662 INFO L226 Difference]: Without dead ends: 601 [2019-10-07 13:49:02,663 INFO L606 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 [2019-10-07 13:49:02,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-07 13:49:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2019-10-07 13:49:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 773 transitions. [2019-10-07 13:49:02,700 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 773 transitions. Word has length 51 [2019-10-07 13:49:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:02,701 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 773 transitions. [2019-10-07 13:49:02,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 773 transitions. [2019-10-07 13:49:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:02,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:02,703 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:02,703 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 693077134, now seen corresponding path program 1 times [2019-10-07 13:49:02,704 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:02,704 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:02,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:02,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:02,833 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:02,833 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:02,833 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:02,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:02,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:02,834 INFO L87 Difference]: Start difference. First operand 599 states and 773 transitions. Second operand 11 states. [2019-10-07 13:49:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:03,109 INFO L93 Difference]: Finished difference Result 615 states and 790 transitions. [2019-10-07 13:49:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:03,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-10-07 13:49:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:03,113 INFO L225 Difference]: With dead ends: 615 [2019-10-07 13:49:03,114 INFO L226 Difference]: Without dead ends: 597 [2019-10-07 13:49:03,114 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-07 13:49:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-07 13:49:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-07 13:49:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 769 transitions. [2019-10-07 13:49:03,152 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 769 transitions. Word has length 50 [2019-10-07 13:49:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:03,152 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 769 transitions. [2019-10-07 13:49:03,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 769 transitions. [2019-10-07 13:49:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:03,155 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:03,155 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:03,155 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash 226522084, now seen corresponding path program 1 times [2019-10-07 13:49:03,156 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:03,156 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:03,156 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:03,156 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:03,232 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:03,233 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:03,233 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:03,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:03,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:03,234 INFO L87 Difference]: Start difference. First operand 597 states and 769 transitions. Second operand 5 states. [2019-10-07 13:49:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,139 INFO L93 Difference]: Finished difference Result 985 states and 1326 transitions. [2019-10-07 13:49:04,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:04,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-07 13:49:04,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:04,145 INFO L225 Difference]: With dead ends: 985 [2019-10-07 13:49:04,145 INFO L226 Difference]: Without dead ends: 860 [2019-10-07 13:49:04,146 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-07 13:49:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 628. [2019-10-07 13:49:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-07 13:49:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 814 transitions. [2019-10-07 13:49:04,192 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 814 transitions. Word has length 54 [2019-10-07 13:49:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:04,193 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 814 transitions. [2019-10-07 13:49:04,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:04,193 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 814 transitions. [2019-10-07 13:49:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:04,195 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:04,195 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:04,195 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1349453429, now seen corresponding path program 1 times [2019-10-07 13:49:04,196 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:04,196 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,196 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,196 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:04,267 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,267 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:04,267 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:04,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:04,268 INFO L87 Difference]: Start difference. First operand 628 states and 814 transitions. Second operand 9 states. [2019-10-07 13:49:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,428 INFO L93 Difference]: Finished difference Result 652 states and 840 transitions. [2019-10-07 13:49:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:04,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-07 13:49:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:04,431 INFO L225 Difference]: With dead ends: 652 [2019-10-07 13:49:04,431 INFO L226 Difference]: Without dead ends: 601 [2019-10-07 13:49:04,432 INFO L606 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 [2019-10-07 13:49:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-07 13:49:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-07 13:49:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-07 13:49:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 766 transitions. [2019-10-07 13:49:04,472 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 766 transitions. Word has length 51 [2019-10-07 13:49:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:04,473 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 766 transitions. [2019-10-07 13:49:04,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 766 transitions. [2019-10-07 13:49:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:04,475 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:04,475 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:04,475 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1644206521, now seen corresponding path program 1 times [2019-10-07 13:49:04,476 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:04,476 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,476 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:04,585 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,586 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:04,586 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:04,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:04,587 INFO L87 Difference]: Start difference. First operand 601 states and 766 transitions. Second operand 12 states. [2019-10-07 13:49:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:04,819 INFO L93 Difference]: Finished difference Result 622 states and 788 transitions. [2019-10-07 13:49:04,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:04,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-07 13:49:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:04,823 INFO L225 Difference]: With dead ends: 622 [2019-10-07 13:49:04,823 INFO L226 Difference]: Without dead ends: 599 [2019-10-07 13:49:04,824 INFO L606 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 [2019-10-07 13:49:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-07 13:49:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-07 13:49:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 762 transitions. [2019-10-07 13:49:04,866 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 762 transitions. Word has length 54 [2019-10-07 13:49:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:04,866 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 762 transitions. [2019-10-07 13:49:04,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 762 transitions. [2019-10-07 13:49:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 13:49:04,868 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:04,868 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:04,869 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1729124439, now seen corresponding path program 1 times [2019-10-07 13:49:04,869 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:04,869 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:04,869 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,870 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:05,009 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,009 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:05,009 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:05,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:05,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:05,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:05,010 INFO L87 Difference]: Start difference. First operand 599 states and 762 transitions. Second operand 12 states. [2019-10-07 13:49:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:05,225 INFO L93 Difference]: Finished difference Result 622 states and 786 transitions. [2019-10-07 13:49:05,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:05,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-10-07 13:49:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:05,230 INFO L225 Difference]: With dead ends: 622 [2019-10-07 13:49:05,230 INFO L226 Difference]: Without dead ends: 599 [2019-10-07 13:49:05,231 INFO L606 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 [2019-10-07 13:49:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-07 13:49:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-10-07 13:49:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-07 13:49:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 758 transitions. [2019-10-07 13:49:05,274 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 758 transitions. Word has length 58 [2019-10-07 13:49:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:05,275 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 758 transitions. [2019-10-07 13:49:05,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 758 transitions. [2019-10-07 13:49:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:49:05,277 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:05,278 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:05,278 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash -710700847, now seen corresponding path program 1 times [2019-10-07 13:49:05,278 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:05,279 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,279 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,279 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:05,430 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,430 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:05,430 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:05,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:05,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:05,431 INFO L87 Difference]: Start difference. First operand 597 states and 758 transitions. Second operand 12 states. [2019-10-07 13:49:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:05,620 INFO L93 Difference]: Finished difference Result 620 states and 782 transitions. [2019-10-07 13:49:05,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:05,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-07 13:49:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:05,623 INFO L225 Difference]: With dead ends: 620 [2019-10-07 13:49:05,623 INFO L226 Difference]: Without dead ends: 597 [2019-10-07 13:49:05,625 INFO L606 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 [2019-10-07 13:49:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-07 13:49:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2019-10-07 13:49:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-07 13:49:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 754 transitions. [2019-10-07 13:49:05,663 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 754 transitions. Word has length 53 [2019-10-07 13:49:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:05,663 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 754 transitions. [2019-10-07 13:49:05,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 754 transitions. [2019-10-07 13:49:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:05,666 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:05,666 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:05,667 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1479206302, now seen corresponding path program 1 times [2019-10-07 13:49:05,667 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:05,667 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,667 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:05,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,764 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:05,764 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:05,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:05,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:05,766 INFO L87 Difference]: Start difference. First operand 595 states and 754 transitions. Second operand 11 states. [2019-10-07 13:49:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:05,915 INFO L93 Difference]: Finished difference Result 656 states and 833 transitions. [2019-10-07 13:49:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:05,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-07 13:49:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:05,921 INFO L225 Difference]: With dead ends: 656 [2019-10-07 13:49:05,921 INFO L226 Difference]: Without dead ends: 605 [2019-10-07 13:49:05,924 INFO L606 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 [2019-10-07 13:49:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-07 13:49:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2019-10-07 13:49:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 771 transitions. [2019-10-07 13:49:05,986 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 771 transitions. Word has length 54 [2019-10-07 13:49:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:05,987 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 771 transitions. [2019-10-07 13:49:05,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 771 transitions. [2019-10-07 13:49:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:49:05,990 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:05,991 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:05,991 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 561992256, now seen corresponding path program 1 times [2019-10-07 13:49:05,992 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:05,992 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:05,992 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,992 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:49:06,061 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,062 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:06,062 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:06,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:06,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:06,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:06,063 INFO L87 Difference]: Start difference. First operand 599 states and 771 transitions. Second operand 5 states. [2019-10-07 13:49:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:06,526 INFO L93 Difference]: Finished difference Result 887 states and 1137 transitions. [2019-10-07 13:49:06,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:06,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-07 13:49:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:06,529 INFO L225 Difference]: With dead ends: 887 [2019-10-07 13:49:06,529 INFO L226 Difference]: Without dead ends: 599 [2019-10-07 13:49:06,531 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-07 13:49:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-07 13:49:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 759 transitions. [2019-10-07 13:49:06,573 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 759 transitions. Word has length 67 [2019-10-07 13:49:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:06,573 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 759 transitions. [2019-10-07 13:49:06,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 759 transitions. [2019-10-07 13:49:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 13:49:06,577 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:06,577 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:06,577 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:06,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1960985204, now seen corresponding path program 1 times [2019-10-07 13:49:06,577 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:06,578 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,578 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:06,578 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:49:06,618 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,618 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:06,618 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:06,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:06,619 INFO L87 Difference]: Start difference. First operand 599 states and 759 transitions. Second operand 3 states. [2019-10-07 13:49:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:06,656 INFO L93 Difference]: Finished difference Result 729 states and 914 transitions. [2019-10-07 13:49:06,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:06,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-07 13:49:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:06,659 INFO L225 Difference]: With dead ends: 729 [2019-10-07 13:49:06,659 INFO L226 Difference]: Without dead ends: 577 [2019-10-07 13:49:06,660 INFO L606 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 [2019-10-07 13:49:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-07 13:49:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-07 13:49:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-07 13:49:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 722 transitions. [2019-10-07 13:49:06,720 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 722 transitions. Word has length 68 [2019-10-07 13:49:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:06,723 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 722 transitions. [2019-10-07 13:49:06,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 722 transitions. [2019-10-07 13:49:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:49:06,727 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:06,727 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:06,727 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash 225549446, now seen corresponding path program 1 times [2019-10-07 13:49:06,728 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:06,728 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,729 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:06,729 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:06,949 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:06,950 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:06,950 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:06,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:06,951 INFO L87 Difference]: Start difference. First operand 575 states and 722 transitions. Second operand 14 states. [2019-10-07 13:49:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:07,496 INFO L93 Difference]: Finished difference Result 617 states and 772 transitions. [2019-10-07 13:49:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:49:07,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-10-07 13:49:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:07,500 INFO L225 Difference]: With dead ends: 617 [2019-10-07 13:49:07,500 INFO L226 Difference]: Without dead ends: 594 [2019-10-07 13:49:07,501 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:49:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-07 13:49:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 579. [2019-10-07 13:49:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-07 13:49:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 728 transitions. [2019-10-07 13:49:07,551 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 728 transitions. Word has length 55 [2019-10-07 13:49:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:07,551 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 728 transitions. [2019-10-07 13:49:07,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 728 transitions. [2019-10-07 13:49:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:07,553 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:07,553 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:07,554 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1949389623, now seen corresponding path program 1 times [2019-10-07 13:49:07,554 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:07,554 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:07,554 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:07,555 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:07,771 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:07,771 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:07,771 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:07,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:07,773 INFO L87 Difference]: Start difference. First operand 579 states and 728 transitions. Second operand 13 states. [2019-10-07 13:49:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:08,155 INFO L93 Difference]: Finished difference Result 595 states and 745 transitions. [2019-10-07 13:49:08,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:08,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-07 13:49:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:08,158 INFO L225 Difference]: With dead ends: 595 [2019-10-07 13:49:08,158 INFO L226 Difference]: Without dead ends: 568 [2019-10-07 13:49:08,159 INFO L606 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 [2019-10-07 13:49:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-07 13:49:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-07 13:49:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-07 13:49:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 713 transitions. [2019-10-07 13:49:08,202 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 713 transitions. Word has length 62 [2019-10-07 13:49:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:08,202 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 713 transitions. [2019-10-07 13:49:08,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 713 transitions. [2019-10-07 13:49:08,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:49:08,204 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:08,204 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:08,204 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:08,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2018558973, now seen corresponding path program 1 times [2019-10-07 13:49:08,205 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:08,205 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,205 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,205 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:08,395 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,395 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:08,396 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:08,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:08,398 INFO L87 Difference]: Start difference. First operand 568 states and 713 transitions. Second operand 13 states. [2019-10-07 13:49:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:08,699 INFO L93 Difference]: Finished difference Result 584 states and 730 transitions. [2019-10-07 13:49:08,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:08,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-07 13:49:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:08,702 INFO L225 Difference]: With dead ends: 584 [2019-10-07 13:49:08,702 INFO L226 Difference]: Without dead ends: 563 [2019-10-07 13:49:08,704 INFO L606 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 [2019-10-07 13:49:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-07 13:49:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-07 13:49:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-07 13:49:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 706 transitions. [2019-10-07 13:49:08,753 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 706 transitions. Word has length 55 [2019-10-07 13:49:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:08,753 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 706 transitions. [2019-10-07 13:49:08,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 706 transitions. [2019-10-07 13:49:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-07 13:49:08,755 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:08,755 INFO L385 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] [2019-10-07 13:49:08,755 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1240275999, now seen corresponding path program 1 times [2019-10-07 13:49:08,756 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:08,756 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,756 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,756 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:08,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,798 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:08,799 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:08,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:08,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:08,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:08,800 INFO L87 Difference]: Start difference. First operand 563 states and 706 transitions. Second operand 3 states. [2019-10-07 13:49:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:08,844 INFO L93 Difference]: Finished difference Result 658 states and 813 transitions. [2019-10-07 13:49:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:08,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-10-07 13:49:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:08,848 INFO L225 Difference]: With dead ends: 658 [2019-10-07 13:49:08,848 INFO L226 Difference]: Without dead ends: 585 [2019-10-07 13:49:08,848 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-07 13:49:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 564. [2019-10-07 13:49:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-07 13:49:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 704 transitions. [2019-10-07 13:49:08,888 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 704 transitions. Word has length 69 [2019-10-07 13:49:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:08,889 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 704 transitions. [2019-10-07 13:49:08,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 704 transitions. [2019-10-07 13:49:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:49:08,891 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:08,891 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:08,891 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 510330724, now seen corresponding path program 1 times [2019-10-07 13:49:08,895 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:08,895 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:08,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,895 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:08,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:09,023 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,023 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:09,023 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:09,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:09,025 INFO L87 Difference]: Start difference. First operand 564 states and 704 transitions. Second operand 11 states. [2019-10-07 13:49:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:09,214 INFO L93 Difference]: Finished difference Result 600 states and 745 transitions. [2019-10-07 13:49:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:09,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-07 13:49:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:09,219 INFO L225 Difference]: With dead ends: 600 [2019-10-07 13:49:09,219 INFO L226 Difference]: Without dead ends: 577 [2019-10-07 13:49:09,220 INFO L606 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 [2019-10-07 13:49:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-07 13:49:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 564. [2019-10-07 13:49:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-07 13:49:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 704 transitions. [2019-10-07 13:49:09,312 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 704 transitions. Word has length 56 [2019-10-07 13:49:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:09,314 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 704 transitions. [2019-10-07 13:49:09,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 704 transitions. [2019-10-07 13:49:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:49:09,316 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:09,316 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:09,316 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash -429600589, now seen corresponding path program 1 times [2019-10-07 13:49:09,317 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:09,317 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:09,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,477 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:09,477 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:09,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:09,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:09,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:09,478 INFO L87 Difference]: Start difference. First operand 564 states and 704 transitions. Second operand 13 states. [2019-10-07 13:49:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:09,750 INFO L93 Difference]: Finished difference Result 580 states and 721 transitions. [2019-10-07 13:49:09,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:09,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-10-07 13:49:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:09,753 INFO L225 Difference]: With dead ends: 580 [2019-10-07 13:49:09,753 INFO L226 Difference]: Without dead ends: 559 [2019-10-07 13:49:09,754 INFO L606 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 [2019-10-07 13:49:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-10-07 13:49:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-10-07 13:49:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-07 13:49:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 697 transitions. [2019-10-07 13:49:09,792 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 697 transitions. Word has length 56 [2019-10-07 13:49:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:09,792 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 697 transitions. [2019-10-07 13:49:09,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 697 transitions. [2019-10-07 13:49:09,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:49:09,794 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:09,794 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:09,795 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1199772891, now seen corresponding path program 1 times [2019-10-07 13:49:09,795 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:09,795 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,796 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:09,828 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,828 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:09,828 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:09,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:09,829 INFO L87 Difference]: Start difference. First operand 559 states and 697 transitions. Second operand 3 states. [2019-10-07 13:49:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:09,861 INFO L93 Difference]: Finished difference Result 710 states and 873 transitions. [2019-10-07 13:49:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:09,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-07 13:49:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:09,875 INFO L225 Difference]: With dead ends: 710 [2019-10-07 13:49:09,875 INFO L226 Difference]: Without dead ends: 516 [2019-10-07 13:49:09,876 INFO L606 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 [2019-10-07 13:49:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-07 13:49:09,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 498. [2019-10-07 13:49:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-07 13:49:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 597 transitions. [2019-10-07 13:49:09,911 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 597 transitions. Word has length 56 [2019-10-07 13:49:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:09,911 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 597 transitions. [2019-10-07 13:49:09,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 597 transitions. [2019-10-07 13:49:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:49:09,913 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:09,913 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:09,913 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:09,913 INFO L82 PathProgramCache]: Analyzing trace with hash 656330220, now seen corresponding path program 1 times [2019-10-07 13:49:09,914 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:09,914 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:09,914 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,914 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:10,033 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,033 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:10,033 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:10,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:10,034 INFO L87 Difference]: Start difference. First operand 498 states and 597 transitions. Second operand 11 states. [2019-10-07 13:49:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:10,156 INFO L93 Difference]: Finished difference Result 522 states and 623 transitions. [2019-10-07 13:49:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:10,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-10-07 13:49:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:10,159 INFO L225 Difference]: With dead ends: 522 [2019-10-07 13:49:10,159 INFO L226 Difference]: Without dead ends: 495 [2019-10-07 13:49:10,160 INFO L606 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 [2019-10-07 13:49:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-10-07 13:49:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-10-07 13:49:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-10-07 13:49:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 592 transitions. [2019-10-07 13:49:10,189 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 592 transitions. Word has length 57 [2019-10-07 13:49:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:10,189 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 592 transitions. [2019-10-07 13:49:10,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 592 transitions. [2019-10-07 13:49:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:10,191 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:10,191 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:10,191 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1908601480, now seen corresponding path program 1 times [2019-10-07 13:49:10,191 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:10,192 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,192 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,192 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:10,309 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,310 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:10,310 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 13:49:10,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 13:49:10,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 13:49:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:10,311 INFO L87 Difference]: Start difference. First operand 495 states and 592 transitions. Second operand 12 states. [2019-10-07 13:49:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:10,527 INFO L93 Difference]: Finished difference Result 516 states and 614 transitions. [2019-10-07 13:49:10,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:10,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-10-07 13:49:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:10,529 INFO L225 Difference]: With dead ends: 516 [2019-10-07 13:49:10,529 INFO L226 Difference]: Without dead ends: 493 [2019-10-07 13:49:10,530 INFO L606 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 [2019-10-07 13:49:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-07 13:49:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-10-07 13:49:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-07 13:49:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 588 transitions. [2019-10-07 13:49:10,565 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 588 transitions. Word has length 59 [2019-10-07 13:49:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:10,565 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 588 transitions. [2019-10-07 13:49:10,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 13:49:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 588 transitions. [2019-10-07 13:49:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:10,567 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:10,567 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:10,567 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1207180545, now seen corresponding path program 1 times [2019-10-07 13:49:10,568 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:10,568 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:10,693 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,694 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:10,694 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:10,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:10,695 INFO L87 Difference]: Start difference. First operand 493 states and 588 transitions. Second operand 14 states. [2019-10-07 13:49:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:10,882 INFO L93 Difference]: Finished difference Result 516 states and 613 transitions. [2019-10-07 13:49:10,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:10,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2019-10-07 13:49:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:10,884 INFO L225 Difference]: With dead ends: 516 [2019-10-07 13:49:10,885 INFO L226 Difference]: Without dead ends: 490 [2019-10-07 13:49:10,885 INFO L606 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 [2019-10-07 13:49:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-07 13:49:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-10-07 13:49:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-07 13:49:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 583 transitions. [2019-10-07 13:49:10,918 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 583 transitions. Word has length 59 [2019-10-07 13:49:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:10,919 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 583 transitions. [2019-10-07 13:49:10,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 583 transitions. [2019-10-07 13:49:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:10,921 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:10,921 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:10,921 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1171643961, now seen corresponding path program 1 times [2019-10-07 13:49:10,922 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:10,922 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:10,922 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,922 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:11,107 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,107 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:11,107 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:11,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:11,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:11,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:11,109 INFO L87 Difference]: Start difference. First operand 490 states and 583 transitions. Second operand 14 states. [2019-10-07 13:49:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:11,320 INFO L93 Difference]: Finished difference Result 513 states and 608 transitions. [2019-10-07 13:49:11,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:11,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-07 13:49:11,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:11,328 INFO L225 Difference]: With dead ends: 513 [2019-10-07 13:49:11,328 INFO L226 Difference]: Without dead ends: 487 [2019-10-07 13:49:11,329 INFO L606 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 [2019-10-07 13:49:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-07 13:49:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-10-07 13:49:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-10-07 13:49:11,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 578 transitions. [2019-10-07 13:49:11,361 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 578 transitions. Word has length 60 [2019-10-07 13:49:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:11,361 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 578 transitions. [2019-10-07 13:49:11,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 578 transitions. [2019-10-07 13:49:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:11,363 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:11,363 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:11,363 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:11,364 INFO L82 PathProgramCache]: Analyzing trace with hash 862953646, now seen corresponding path program 1 times [2019-10-07 13:49:11,364 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:11,364 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,364 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,364 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:11,499 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,499 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:11,499 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:11,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:11,500 INFO L87 Difference]: Start difference. First operand 487 states and 578 transitions. Second operand 14 states. [2019-10-07 13:49:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:11,693 INFO L93 Difference]: Finished difference Result 510 states and 603 transitions. [2019-10-07 13:49:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:11,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-07 13:49:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:11,696 INFO L225 Difference]: With dead ends: 510 [2019-10-07 13:49:11,696 INFO L226 Difference]: Without dead ends: 482 [2019-10-07 13:49:11,697 INFO L606 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 [2019-10-07 13:49:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-07 13:49:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-07 13:49:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-07 13:49:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 571 transitions. [2019-10-07 13:49:11,728 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 571 transitions. Word has length 60 [2019-10-07 13:49:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:11,729 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 571 transitions. [2019-10-07 13:49:11,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 571 transitions. [2019-10-07 13:49:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:49:11,730 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:11,730 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:11,730 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:11,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash -392712197, now seen corresponding path program 1 times [2019-10-07 13:49:11,731 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:11,731 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,731 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:11,870 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:11,870 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:11,870 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:11,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:11,871 INFO L87 Difference]: Start difference. First operand 482 states and 571 transitions. Second operand 14 states. [2019-10-07 13:49:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,064 INFO L93 Difference]: Finished difference Result 533 states and 624 transitions. [2019-10-07 13:49:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:12,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-10-07 13:49:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,066 INFO L225 Difference]: With dead ends: 533 [2019-10-07 13:49:12,067 INFO L226 Difference]: Without dead ends: 472 [2019-10-07 13:49:12,067 INFO L606 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 [2019-10-07 13:49:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-07 13:49:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2019-10-07 13:49:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-07 13:49:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 556 transitions. [2019-10-07 13:49:12,098 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 556 transitions. Word has length 65 [2019-10-07 13:49:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:12,098 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 556 transitions. [2019-10-07 13:49:12,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 556 transitions. [2019-10-07 13:49:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:12,099 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:12,100 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:12,100 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:12,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1876447963, now seen corresponding path program 1 times [2019-10-07 13:49:12,100 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:12,100 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,101 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:12,238 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,238 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:12,238 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:12,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:12,240 INFO L87 Difference]: Start difference. First operand 472 states and 556 transitions. Second operand 14 states. [2019-10-07 13:49:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,418 INFO L93 Difference]: Finished difference Result 495 states and 581 transitions. [2019-10-07 13:49:12,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:12,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-07 13:49:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,423 INFO L225 Difference]: With dead ends: 495 [2019-10-07 13:49:12,424 INFO L226 Difference]: Without dead ends: 466 [2019-10-07 13:49:12,426 INFO L606 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 [2019-10-07 13:49:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-07 13:49:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-07 13:49:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-07 13:49:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 548 transitions. [2019-10-07 13:49:12,469 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 548 transitions. Word has length 60 [2019-10-07 13:49:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:12,470 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 548 transitions. [2019-10-07 13:49:12,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 548 transitions. [2019-10-07 13:49:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:12,472 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:12,472 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:12,472 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash -833697960, now seen corresponding path program 1 times [2019-10-07 13:49:12,473 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:12,473 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,473 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,474 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:12,573 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,574 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:12,574 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:12,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:12,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:12,575 INFO L87 Difference]: Start difference. First operand 466 states and 548 transitions. Second operand 11 states. [2019-10-07 13:49:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,688 INFO L93 Difference]: Finished difference Result 490 states and 574 transitions. [2019-10-07 13:49:12,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:12,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-07 13:49:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,690 INFO L225 Difference]: With dead ends: 490 [2019-10-07 13:49:12,690 INFO L226 Difference]: Without dead ends: 463 [2019-10-07 13:49:12,691 INFO L606 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 [2019-10-07 13:49:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-10-07 13:49:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2019-10-07 13:49:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-07 13:49:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 543 transitions. [2019-10-07 13:49:12,721 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 543 transitions. Word has length 59 [2019-10-07 13:49:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:12,722 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 543 transitions. [2019-10-07 13:49:12,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 543 transitions. [2019-10-07 13:49:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:12,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:12,723 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:12,723 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash 870167993, now seen corresponding path program 1 times [2019-10-07 13:49:12,724 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:12,724 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:12,823 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:12,824 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:12,824 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:12,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:12,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:12,825 INFO L87 Difference]: Start difference. First operand 463 states and 543 transitions. Second operand 11 states. [2019-10-07 13:49:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:12,985 INFO L93 Difference]: Finished difference Result 487 states and 569 transitions. [2019-10-07 13:49:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:12,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-07 13:49:12,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:12,989 INFO L225 Difference]: With dead ends: 487 [2019-10-07 13:49:12,989 INFO L226 Difference]: Without dead ends: 461 [2019-10-07 13:49:12,990 INFO L606 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 [2019-10-07 13:49:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-07 13:49:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-10-07 13:49:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-07 13:49:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 539 transitions. [2019-10-07 13:49:13,075 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 539 transitions. Word has length 60 [2019-10-07 13:49:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:13,075 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 539 transitions. [2019-10-07 13:49:13,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 539 transitions. [2019-10-07 13:49:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-07 13:49:13,077 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:13,077 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:13,078 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash 293777713, now seen corresponding path program 1 times [2019-10-07 13:49:13,078 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:13,078 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,078 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,079 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:13,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,132 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:13,132 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:13,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:13,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:13,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:13,133 INFO L87 Difference]: Start difference. First operand 461 states and 539 transitions. Second operand 5 states. [2019-10-07 13:49:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:13,472 INFO L93 Difference]: Finished difference Result 514 states and 602 transitions. [2019-10-07 13:49:13,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:13,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-07 13:49:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:13,474 INFO L225 Difference]: With dead ends: 514 [2019-10-07 13:49:13,474 INFO L226 Difference]: Without dead ends: 505 [2019-10-07 13:49:13,474 INFO L606 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 [2019-10-07 13:49:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-07 13:49:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 461. [2019-10-07 13:49:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-10-07 13:49:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 537 transitions. [2019-10-07 13:49:13,507 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 537 transitions. Word has length 61 [2019-10-07 13:49:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:13,507 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 537 transitions. [2019-10-07 13:49:13,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 537 transitions. [2019-10-07 13:49:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 13:49:13,508 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:13,508 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-10-07 13:49:13,509 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1123279821, now seen corresponding path program 1 times [2019-10-07 13:49:13,509 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:13,509 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,509 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,509 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 13:49:13,623 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,624 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:13,624 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:13,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:13,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:13,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:13,625 INFO L87 Difference]: Start difference. First operand 461 states and 537 transitions. Second operand 6 states. [2019-10-07 13:49:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:13,698 INFO L93 Difference]: Finished difference Result 532 states and 618 transitions. [2019-10-07 13:49:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:13,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-10-07 13:49:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:13,701 INFO L225 Difference]: With dead ends: 532 [2019-10-07 13:49:13,701 INFO L226 Difference]: Without dead ends: 459 [2019-10-07 13:49:13,701 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-10-07 13:49:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2019-10-07 13:49:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-07 13:49:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 534 transitions. [2019-10-07 13:49:13,756 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 534 transitions. Word has length 76 [2019-10-07 13:49:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:13,756 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 534 transitions. [2019-10-07 13:49:13,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 534 transitions. [2019-10-07 13:49:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 13:49:13,758 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:13,758 INFO L385 BasicCegarLoop]: trace histogram [2, 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] [2019-10-07 13:49:13,758 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1565735709, now seen corresponding path program 1 times [2019-10-07 13:49:13,759 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:13,759 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,759 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 13:49:13,868 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:13,868 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:13,868 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:13,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:13,869 INFO L87 Difference]: Start difference. First operand 459 states and 534 transitions. Second operand 11 states. [2019-10-07 13:49:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:14,000 INFO L93 Difference]: Finished difference Result 483 states and 560 transitions. [2019-10-07 13:49:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:14,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-10-07 13:49:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:14,003 INFO L225 Difference]: With dead ends: 483 [2019-10-07 13:49:14,003 INFO L226 Difference]: Without dead ends: 452 [2019-10-07 13:49:14,004 INFO L606 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 [2019-10-07 13:49:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-07 13:49:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-10-07 13:49:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-07 13:49:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 523 transitions. [2019-10-07 13:49:14,050 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 523 transitions. Word has length 63 [2019-10-07 13:49:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:14,050 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 523 transitions. [2019-10-07 13:49:14,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 523 transitions. [2019-10-07 13:49:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:14,051 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:14,051 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:14,052 INFO L410 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2061580277, now seen corresponding path program 1 times [2019-10-07 13:49:14,052 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:14,052 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,052 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,053 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:14,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,160 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:14,160 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:14,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:14,161 INFO L87 Difference]: Start difference. First operand 452 states and 523 transitions. Second operand 11 states. [2019-10-07 13:49:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:14,302 INFO L93 Difference]: Finished difference Result 476 states and 549 transitions. [2019-10-07 13:49:14,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:14,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-07 13:49:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:14,304 INFO L225 Difference]: With dead ends: 476 [2019-10-07 13:49:14,304 INFO L226 Difference]: Without dead ends: 447 [2019-10-07 13:49:14,305 INFO L606 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 [2019-10-07 13:49:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-07 13:49:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2019-10-07 13:49:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2019-10-07 13:49:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 516 transitions. [2019-10-07 13:49:14,350 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 516 transitions. Word has length 62 [2019-10-07 13:49:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:14,350 INFO L462 AbstractCegarLoop]: Abstraction has 447 states and 516 transitions. [2019-10-07 13:49:14,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 516 transitions. [2019-10-07 13:49:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:14,352 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:14,352 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:14,352 INFO L410 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash -123151742, now seen corresponding path program 1 times [2019-10-07 13:49:14,353 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:14,353 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,353 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,353 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:14,468 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,469 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:14,469 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:14,470 INFO L87 Difference]: Start difference. First operand 447 states and 516 transitions. Second operand 11 states. [2019-10-07 13:49:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:14,691 INFO L93 Difference]: Finished difference Result 457 states and 525 transitions. [2019-10-07 13:49:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:14,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-10-07 13:49:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:14,693 INFO L225 Difference]: With dead ends: 457 [2019-10-07 13:49:14,694 INFO L226 Difference]: Without dead ends: 451 [2019-10-07 13:49:14,694 INFO L606 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 [2019-10-07 13:49:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-10-07 13:49:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 444. [2019-10-07 13:49:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-10-07 13:49:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 509 transitions. [2019-10-07 13:49:14,731 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 509 transitions. Word has length 62 [2019-10-07 13:49:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:14,731 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 509 transitions. [2019-10-07 13:49:14,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 509 transitions. [2019-10-07 13:49:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:14,732 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:14,732 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:14,733 INFO L410 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash -123428572, now seen corresponding path program 1 times [2019-10-07 13:49:14,733 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:14,733 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,733 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,734 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:14,783 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:14,783 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:14,783 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:14,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:14,784 INFO L87 Difference]: Start difference. First operand 444 states and 509 transitions. Second operand 5 states. [2019-10-07 13:49:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:15,139 INFO L93 Difference]: Finished difference Result 491 states and 566 transitions. [2019-10-07 13:49:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:15,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-07 13:49:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:15,141 INFO L225 Difference]: With dead ends: 491 [2019-10-07 13:49:15,141 INFO L226 Difference]: Without dead ends: 464 [2019-10-07 13:49:15,142 INFO L606 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 [2019-10-07 13:49:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-07 13:49:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 423. [2019-10-07 13:49:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-07 13:49:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 484 transitions. [2019-10-07 13:49:15,174 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 484 transitions. Word has length 62 [2019-10-07 13:49:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:15,175 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 484 transitions. [2019-10-07 13:49:15,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 484 transitions. [2019-10-07 13:49:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:49:15,176 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:15,177 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:15,177 INFO L410 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1308518573, now seen corresponding path program 1 times [2019-10-07 13:49:15,177 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:15,177 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,177 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,178 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:15,209 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,209 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:15,209 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:15,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:15,210 INFO L87 Difference]: Start difference. First operand 423 states and 484 transitions. Second operand 3 states. [2019-10-07 13:49:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:15,249 INFO L93 Difference]: Finished difference Result 449 states and 514 transitions. [2019-10-07 13:49:15,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:15,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-07 13:49:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:15,251 INFO L225 Difference]: With dead ends: 449 [2019-10-07 13:49:15,251 INFO L226 Difference]: Without dead ends: 426 [2019-10-07 13:49:15,252 INFO L606 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 [2019-10-07 13:49:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-07 13:49:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 422. [2019-10-07 13:49:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-10-07 13:49:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 478 transitions. [2019-10-07 13:49:15,281 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 478 transitions. Word has length 62 [2019-10-07 13:49:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:15,282 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 478 transitions. [2019-10-07 13:49:15,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 478 transitions. [2019-10-07 13:49:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-07 13:49:15,283 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:15,283 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:15,283 INFO L410 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:15,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:15,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1467463391, now seen corresponding path program 1 times [2019-10-07 13:49:15,284 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:15,284 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,284 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,284 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:15,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:15,395 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:15,396 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:15,396 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:15,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:15,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:15,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:15,396 INFO L87 Difference]: Start difference. First operand 422 states and 478 transitions. Second operand 11 states. [2019-10-07 13:49:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:16,404 INFO L93 Difference]: Finished difference Result 572 states and 636 transitions. [2019-10-07 13:49:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:16,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-10-07 13:49:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:16,406 INFO L225 Difference]: With dead ends: 572 [2019-10-07 13:49:16,406 INFO L226 Difference]: Without dead ends: 480 [2019-10-07 13:49:16,407 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-10-07 13:49:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-10-07 13:49:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 431. [2019-10-07 13:49:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-07 13:49:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 486 transitions. [2019-10-07 13:49:16,430 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 486 transitions. Word has length 65 [2019-10-07 13:49:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:16,430 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 486 transitions. [2019-10-07 13:49:16,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 486 transitions. [2019-10-07 13:49:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 13:49:16,431 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:16,431 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:16,431 INFO L410 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:16,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1037786581, now seen corresponding path program 1 times [2019-10-07 13:49:16,432 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:16,432 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:16,432 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:16,432 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 13:49:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-07 13:49:16,551 INFO L161 tionRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-10-07 13:49:16,552 INFO L451 BasicCegarLoop]: Counterexample might be feasible [2019-10-07 13:49:16,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:49:16 BoogieIcfgContainer [2019-10-07 13:49:16,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:49:16,726 INFO L168 Benchmark]: Toolchain (without parser) took 31838.33 ms. Allocated memory was 138.9 MB in the beginning and 739.2 MB in the end (delta: 600.3 MB). Free memory was 101.3 MB in the beginning and 363.0 MB in the end (delta: -261.7 MB). Peak memory consumption was 338.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:16,727 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 13:49:16,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 870.64 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 160.1 MB in the end (delta: -59.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:16,728 INFO L168 Benchmark]: Boogie Preprocessor took 114.52 ms. Allocated memory is still 203.9 MB. Free memory was 160.1 MB in the beginning and 154.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:16,729 INFO L168 Benchmark]: RCFGBuilder took 2272.84 ms. Allocated memory was 203.9 MB in the beginning and 248.5 MB in the end (delta: 44.6 MB). Free memory was 154.6 MB in the beginning and 183.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:16,730 INFO L168 Benchmark]: TraceAbstraction took 28573.71 ms. Allocated memory was 248.5 MB in the beginning and 739.2 MB in the end (delta: 490.7 MB). Free memory was 183.2 MB in the beginning and 363.0 MB in the end (delta: -179.8 MB). Peak memory consumption was 310.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:49:16,737 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 870.64 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.1 MB in the beginning and 160.1 MB in the end (delta: -59.0 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.52 ms. Allocated memory is still 203.9 MB. Free memory was 160.1 MB in the beginning and 154.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2272.84 ms. Allocated memory was 203.9 MB in the beginning and 248.5 MB in the end (delta: 44.6 MB). Free memory was 154.6 MB in the beginning and 183.2 MB in the end (delta: -28.6 MB). Peak memory consumption was 110.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28573.71 ms. Allocated memory was 248.5 MB in the beginning and 739.2 MB in the end (delta: 490.7 MB). Free memory was 183.2 MB in the beginning and 363.0 MB in the end (delta: -179.8 MB). Peak memory consumption was 310.9 MB. Max. memory is 7.1 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 ; [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=1, 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 [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=1, 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 [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=1, 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 [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=1, 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=1, 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); [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 FALSE !(tmp_ndt_4 == 0) [L1935] int tmp_ndt_5; [L1936] tmp_ndt_5 = __VERIFIER_nondet_int() [L1937] COND TRUE tmp_ndt_5 == 1 [L1946] returnVal2 = -1073741823 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, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=1, 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=-1073741823, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=1, tmp_ndt_5=1, 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, __VERIFIER_nondet_int()=1, __VERIFIER_nondet_int()=1, 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=-1073741823, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=-1073741823, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=1, tmp_ndt_5=1, UNLOADED=0] [L1980] return (returnVal2); [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)=-1073741823, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, __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=-1073741823, 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=-1073741823, 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)=-1073741823, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=-1073741823, 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); [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)=-1073741823, compFptr=0, compRegistered=1, customIrp=0, d=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=1, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=-1073741823, 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=-1073741823, 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=-1073741823, 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=-1073741823, 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, 410 locations, 1 error locations. Result: UNSAFE, OverallTime: 28.4s, OverallIterations: 59, TraceHistogramMax: 2, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 26812 SDtfs, 12759 SDslu, 125761 SDs, 0 SdLazy, 14619 SolverSat, 3304 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 622 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 479 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=678occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 58 MinimizatonAttempts, 1566 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3013 NumberOfCodeBlocks, 3013 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2891 ConstructedInterpolants, 0 QuantifiedInterpolants, 339565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 58 InterpolantComputations, 58 PerfectInterpolantSequences, 20/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...