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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:58,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:58,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:58,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:58,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:58,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:58,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:58,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:58,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:58,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:58,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:58,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:58,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:58,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:58,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:58,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:58,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:58,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:58,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:58,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:58,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:58,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:58,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:58,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:58,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:58,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:58,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:58,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:58,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:58,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:58,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:58,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:58,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:58,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:58,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:58,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:58,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:58,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:58,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:58,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:58,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:58,443 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-15 01:06:58,465 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:58,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:58,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:58,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:58,468 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:58,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:58,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:58,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:58,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:58,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:58,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:58,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:58,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:58,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:58,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:58,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:58,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:58,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:58,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:58,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:58,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:58,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:58,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:58,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:58,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:58,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:58,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:58,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:58,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:06:58,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:58,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:58,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:58,802 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:58,802 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:58,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-15 01:06:58,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9336a3d9d/edc86dd1134f45a2b2a3871b9a7e79c1/FLAG02cfdb60d [2019-10-15 01:06:59,402 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:59,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-15 01:06:59,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9336a3d9d/edc86dd1134f45a2b2a3871b9a7e79c1/FLAG02cfdb60d [2019-10-15 01:06:59,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9336a3d9d/edc86dd1134f45a2b2a3871b9a7e79c1 [2019-10-15 01:06:59,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:59,743 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:59,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:59,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:59,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:59,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:59" (1/1) ... [2019-10-15 01:06:59,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a36b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:59, skipping insertion in model container [2019-10-15 01:06:59,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:59" (1/1) ... [2019-10-15 01:06:59,762 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:59,829 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:07:00,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:07:00,331 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:07:00,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:07:00,465 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:07:00,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00 WrapperNode [2019-10-15 01:07:00,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:07:00,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:07:00,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:07:00,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:07:00,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (1/1) ... [2019-10-15 01:07:00,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:07:00,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:07:00,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:07:00,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:07:00,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (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-15 01:07:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:07:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:07:00,660 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 01:07:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-15 01:07:00,661 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-15 01:07:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-15 01:07:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-15 01:07:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-15 01:07:00,662 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-15 01:07:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-15 01:07:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 01:07:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:07:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-15 01:07:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-15 01:07:00,664 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-15 01:07:00,665 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-15 01:07:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-15 01:07:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 01:07:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 01:07:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 01:07:00,668 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 01:07:00,668 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 01:07:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-15 01:07:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-15 01:07:00,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 01:07:00,670 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-15 01:07:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-15 01:07:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-15 01:07:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-15 01:07:00,671 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 01:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:07:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:07:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:07:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:07:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-15 01:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-15 01:07:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-15 01:07:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-15 01:07:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-15 01:07:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 01:07:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 01:07:00,674 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-15 01:07:00,675 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-15 01:07:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 01:07:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 01:07:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 01:07:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-15 01:07:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 01:07:00,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:07:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 01:07:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:07:00,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:07:01,094 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,163 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,164 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,172 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,182 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,183 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,190 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,396 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 01:07:01,396 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 01:07:01,399 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,506 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-15 01:07:01,506 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-15 01:07:01,522 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 01:07:01,543 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 01:07:01,630 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,657 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,658 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,658 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,666 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,667 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,667 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,676 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,676 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,716 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,748 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-15 01:07:01,748 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-15 01:07:01,751 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,886 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-15 01:07:01,886 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-15 01:07:01,943 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,949 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,949 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,949 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,964 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,965 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,965 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:07:01,971 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 01:07:01,971 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 01:07:01,983 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:07:01,984 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:07:01,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:01 BoogieIcfgContainer [2019-10-15 01:07:01,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:07:01,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:07:01,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:07:01,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:07:01,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:59" (1/3) ... [2019-10-15 01:07:01,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381f180d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:07:01, skipping insertion in model container [2019-10-15 01:07:01,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:07:00" (2/3) ... [2019-10-15 01:07:01,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381f180d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:07:01, skipping insertion in model container [2019-10-15 01:07:01,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:07:01" (3/3) ... [2019-10-15 01:07:02,009 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-15 01:07:02,029 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:07:02,038 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:07:02,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:07:02,079 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:07:02,080 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:07:02,080 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:07:02,080 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:07:02,080 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:07:02,080 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:07:02,080 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:07:02,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:07:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2019-10-15 01:07:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 01:07:02,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,115 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:02,117 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash 513471565, now seen corresponding path program 1 times [2019-10-15 01:07:02,133 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743047633] [2019-10-15 01:07:02,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,435 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-15 01:07:02,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743047633] [2019-10-15 01:07:02,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:02,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192918230] [2019-10-15 01:07:02,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:02,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:02,463 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2019-10-15 01:07:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:02,610 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2019-10-15 01:07:02,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:02,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-15 01:07:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:02,640 INFO L225 Difference]: With dead ends: 624 [2019-10-15 01:07:02,640 INFO L226 Difference]: Without dead ends: 380 [2019-10-15 01:07:02,647 INFO L600 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-15 01:07:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-15 01:07:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-10-15 01:07:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-15 01:07:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2019-10-15 01:07:02,735 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2019-10-15 01:07:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:02,736 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2019-10-15 01:07:02,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2019-10-15 01:07:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:07:02,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:02,738 INFO L380 BasicCegarLoop]: trace histogram [1, 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-15 01:07:02,738 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:02,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:02,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2120474792, now seen corresponding path program 1 times [2019-10-15 01:07:02,738 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:02,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273675493] [2019-10-15 01:07:02,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:02,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:02,898 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-15 01:07:02,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273675493] [2019-10-15 01:07:02,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:02,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:02,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045428074] [2019-10-15 01:07:02,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:02,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:02,902 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2019-10-15 01:07:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,141 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2019-10-15 01:07:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:07:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,148 INFO L225 Difference]: With dead ends: 699 [2019-10-15 01:07:03,148 INFO L226 Difference]: Without dead ends: 536 [2019-10-15 01:07:03,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-15 01:07:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2019-10-15 01:07:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-15 01:07:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2019-10-15 01:07:03,206 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2019-10-15 01:07:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,206 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2019-10-15 01:07:03,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2019-10-15 01:07:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:07:03,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,209 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-15 01:07:03,209 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1525052010, now seen corresponding path program 1 times [2019-10-15 01:07:03,210 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075965841] [2019-10-15 01:07:03,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,367 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-15 01:07:03,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075965841] [2019-10-15 01:07:03,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630655489] [2019-10-15 01:07:03,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,370 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2019-10-15 01:07:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,428 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2019-10-15 01:07:03,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 01:07:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,434 INFO L225 Difference]: With dead ends: 642 [2019-10-15 01:07:03,434 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:07:03,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-15 01:07:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:07:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2019-10-15 01:07:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:07:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2019-10-15 01:07:03,472 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2019-10-15 01:07:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,473 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2019-10-15 01:07:03,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2019-10-15 01:07:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:07:03,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:03,475 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1803096900, now seen corresponding path program 1 times [2019-10-15 01:07:03,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743310489] [2019-10-15 01:07:03,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,542 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-15 01:07:03,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743310489] [2019-10-15 01:07:03,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804764509] [2019-10-15 01:07:03,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,545 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2019-10-15 01:07:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,618 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2019-10-15 01:07:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-15 01:07:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,635 INFO L225 Difference]: With dead ends: 1080 [2019-10-15 01:07:03,635 INFO L226 Difference]: Without dead ends: 788 [2019-10-15 01:07:03,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-15 01:07:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-15 01:07:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2019-10-15 01:07:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-15 01:07:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2019-10-15 01:07:03,701 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2019-10-15 01:07:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,701 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2019-10-15 01:07:03,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2019-10-15 01:07:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:07:03,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:03,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1275107652, now seen corresponding path program 1 times [2019-10-15 01:07:03,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383247324] [2019-10-15 01:07:03,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,780 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-15 01:07:03,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383247324] [2019-10-15 01:07:03,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818078579] [2019-10-15 01:07:03,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:03,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:03,783 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2019-10-15 01:07:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:03,867 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2019-10-15 01:07:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:03,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-15 01:07:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:03,873 INFO L225 Difference]: With dead ends: 795 [2019-10-15 01:07:03,873 INFO L226 Difference]: Without dead ends: 790 [2019-10-15 01:07:03,874 INFO L600 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-15 01:07:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-15 01:07:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-10-15 01:07:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-15 01:07:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2019-10-15 01:07:03,912 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2019-10-15 01:07:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:03,912 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2019-10-15 01:07:03,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2019-10-15 01:07:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 01:07:03,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:03,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:03,916 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1074736541, now seen corresponding path program 1 times [2019-10-15 01:07:03,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:03,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075459211] [2019-10-15 01:07:03,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:03,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:03,998 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-15 01:07:03,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075459211] [2019-10-15 01:07:03,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:03,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:03,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720364528] [2019-10-15 01:07:04,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:04,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:04,001 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2019-10-15 01:07:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,133 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2019-10-15 01:07:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:04,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-15 01:07:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,140 INFO L225 Difference]: With dead ends: 803 [2019-10-15 01:07:04,140 INFO L226 Difference]: Without dead ends: 800 [2019-10-15 01:07:04,141 INFO L600 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-15 01:07:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-15 01:07:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2019-10-15 01:07:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-10-15 01:07:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2019-10-15 01:07:04,179 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2019-10-15 01:07:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,179 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2019-10-15 01:07:04,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2019-10-15 01:07:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 01:07:04,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,182 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:04,182 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1033738490, now seen corresponding path program 1 times [2019-10-15 01:07:04,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342642011] [2019-10-15 01:07:04,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,243 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-15 01:07:04,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342642011] [2019-10-15 01:07:04,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:04,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672544322] [2019-10-15 01:07:04,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:04,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:04,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:04,246 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2019-10-15 01:07:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,317 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2019-10-15 01:07:04,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:04,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-15 01:07:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,324 INFO L225 Difference]: With dead ends: 812 [2019-10-15 01:07:04,324 INFO L226 Difference]: Without dead ends: 797 [2019-10-15 01:07:04,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-15 01:07:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-10-15 01:07:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-15 01:07:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2019-10-15 01:07:04,377 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2019-10-15 01:07:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,378 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2019-10-15 01:07:04,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2019-10-15 01:07:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 01:07:04,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:04,381 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1325280387, now seen corresponding path program 1 times [2019-10-15 01:07:04,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858824327] [2019-10-15 01:07:04,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,457 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-15 01:07:04,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858824327] [2019-10-15 01:07:04,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:04,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210743948] [2019-10-15 01:07:04,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:04,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:04,460 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2019-10-15 01:07:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,530 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2019-10-15 01:07:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:04,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-15 01:07:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,537 INFO L225 Difference]: With dead ends: 810 [2019-10-15 01:07:04,537 INFO L226 Difference]: Without dead ends: 790 [2019-10-15 01:07:04,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:04,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-15 01:07:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-15 01:07:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-15 01:07:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-10-15 01:07:04,574 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2019-10-15 01:07:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,576 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-10-15 01:07:04,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-10-15 01:07:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:07:04,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,579 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:04,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1677893832, now seen corresponding path program 1 times [2019-10-15 01:07:04,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740721528] [2019-10-15 01:07:04,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,647 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-15 01:07:04,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740721528] [2019-10-15 01:07:04,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:04,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827394720] [2019-10-15 01:07:04,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:04,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:04,649 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-10-15 01:07:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:04,788 INFO L93 Difference]: Finished difference Result 1168 states and 1590 transitions. [2019-10-15 01:07:04,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:04,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-15 01:07:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:04,796 INFO L225 Difference]: With dead ends: 1168 [2019-10-15 01:07:04,796 INFO L226 Difference]: Without dead ends: 1165 [2019-10-15 01:07:04,797 INFO L600 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-15 01:07:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-15 01:07:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2019-10-15 01:07:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-15 01:07:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1235 transitions. [2019-10-15 01:07:04,867 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1235 transitions. Word has length 44 [2019-10-15 01:07:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:04,867 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1235 transitions. [2019-10-15 01:07:04,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1235 transitions. [2019-10-15 01:07:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:07:04,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:04,869 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:04,869 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:04,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2097381887, now seen corresponding path program 1 times [2019-10-15 01:07:04,870 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:04,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968628903] [2019-10-15 01:07:04,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:04,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:04,950 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-15 01:07:04,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968628903] [2019-10-15 01:07:04,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:04,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:04,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206636541] [2019-10-15 01:07:04,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:04,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:04,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:04,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:04,952 INFO L87 Difference]: Start difference. First operand 913 states and 1235 transitions. Second operand 8 states. [2019-10-15 01:07:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:05,608 INFO L93 Difference]: Finished difference Result 935 states and 1257 transitions. [2019-10-15 01:07:05,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:05,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-15 01:07:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:05,614 INFO L225 Difference]: With dead ends: 935 [2019-10-15 01:07:05,614 INFO L226 Difference]: Without dead ends: 929 [2019-10-15 01:07:05,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-10-15 01:07:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 913. [2019-10-15 01:07:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-15 01:07:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1234 transitions. [2019-10-15 01:07:05,675 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1234 transitions. Word has length 43 [2019-10-15 01:07:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:05,676 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1234 transitions. [2019-10-15 01:07:05,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1234 transitions. [2019-10-15 01:07:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 01:07:05,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:05,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:05,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash 667497540, now seen corresponding path program 1 times [2019-10-15 01:07:05,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:05,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492121603] [2019-10-15 01:07:05,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:05,752 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-15 01:07:05,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492121603] [2019-10-15 01:07:05,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:05,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:05,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370557512] [2019-10-15 01:07:05,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:05,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:05,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:05,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:05,754 INFO L87 Difference]: Start difference. First operand 913 states and 1234 transitions. Second operand 4 states. [2019-10-15 01:07:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:05,856 INFO L93 Difference]: Finished difference Result 941 states and 1267 transitions. [2019-10-15 01:07:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:05,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-15 01:07:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:05,862 INFO L225 Difference]: With dead ends: 941 [2019-10-15 01:07:05,862 INFO L226 Difference]: Without dead ends: 919 [2019-10-15 01:07:05,863 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-10-15 01:07:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2019-10-15 01:07:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-10-15 01:07:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2019-10-15 01:07:05,914 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 42 [2019-10-15 01:07:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:05,914 INFO L462 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2019-10-15 01:07:05,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2019-10-15 01:07:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:07:05,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:05,916 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:05,916 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 237043572, now seen corresponding path program 1 times [2019-10-15 01:07:05,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:05,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585596908] [2019-10-15 01:07:05,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:05,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:06,042 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-15 01:07:06,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585596908] [2019-10-15 01:07:06,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:06,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:06,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845315723] [2019-10-15 01:07:06,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:06,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:06,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:06,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:06,044 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 8 states. [2019-10-15 01:07:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:06,948 INFO L93 Difference]: Finished difference Result 1641 states and 2187 transitions. [2019-10-15 01:07:06,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:07:06,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-15 01:07:06,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:06,955 INFO L225 Difference]: With dead ends: 1641 [2019-10-15 01:07:06,955 INFO L226 Difference]: Without dead ends: 1090 [2019-10-15 01:07:06,957 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-15 01:07:06,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 906. [2019-10-15 01:07:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-15 01:07:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1215 transitions. [2019-10-15 01:07:07,002 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1215 transitions. Word has length 45 [2019-10-15 01:07:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:07,002 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1215 transitions. [2019-10-15 01:07:07,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1215 transitions. [2019-10-15 01:07:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 01:07:07,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:07,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:07,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash -266291307, now seen corresponding path program 1 times [2019-10-15 01:07:07,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:07,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566012197] [2019-10-15 01:07:07,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:07,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-15 01:07:07,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566012197] [2019-10-15 01:07:07,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:07,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:07,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136724722] [2019-10-15 01:07:07,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:07,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:07,089 INFO L87 Difference]: Start difference. First operand 906 states and 1215 transitions. Second operand 8 states. [2019-10-15 01:07:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:07,815 INFO L93 Difference]: Finished difference Result 928 states and 1236 transitions. [2019-10-15 01:07:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:07,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-15 01:07:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:07,822 INFO L225 Difference]: With dead ends: 928 [2019-10-15 01:07:07,822 INFO L226 Difference]: Without dead ends: 922 [2019-10-15 01:07:07,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:07:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-15 01:07:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 906. [2019-10-15 01:07:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-15 01:07:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-15 01:07:07,894 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 44 [2019-10-15 01:07:07,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:07,896 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-15 01:07:07,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-15 01:07:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 01:07:07,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:07,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:07,900 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2124566473, now seen corresponding path program 1 times [2019-10-15 01:07:07,901 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:07,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538374551] [2019-10-15 01:07:07,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:07,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:07,961 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-15 01:07:07,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538374551] [2019-10-15 01:07:07,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:07,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:07,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066872260] [2019-10-15 01:07:07,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:07,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:07,965 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 4 states. [2019-10-15 01:07:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,098 INFO L93 Difference]: Finished difference Result 934 states and 1247 transitions. [2019-10-15 01:07:08,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:08,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-15 01:07:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,103 INFO L225 Difference]: With dead ends: 934 [2019-10-15 01:07:08,103 INFO L226 Difference]: Without dead ends: 912 [2019-10-15 01:07:08,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-10-15 01:07:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2019-10-15 01:07:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-15 01:07:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-15 01:07:08,151 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 43 [2019-10-15 01:07:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,152 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-15 01:07:08,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-15 01:07:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 01:07:08,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,154 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:08,154 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,155 INFO L82 PathProgramCache]: Analyzing trace with hash 418451048, now seen corresponding path program 1 times [2019-10-15 01:07:08,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319936182] [2019-10-15 01:07:08,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,223 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-15 01:07:08,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319936182] [2019-10-15 01:07:08,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:08,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776179640] [2019-10-15 01:07:08,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:08,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:08,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:08,225 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2019-10-15 01:07:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,285 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2019-10-15 01:07:08,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:08,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-15 01:07:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,291 INFO L225 Difference]: With dead ends: 922 [2019-10-15 01:07:08,292 INFO L226 Difference]: Without dead ends: 904 [2019-10-15 01:07:08,294 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-10-15 01:07:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-10-15 01:07:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-15 01:07:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2019-10-15 01:07:08,336 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2019-10-15 01:07:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,336 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2019-10-15 01:07:08,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2019-10-15 01:07:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 01:07:08,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,339 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:08,339 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1008250026, now seen corresponding path program 1 times [2019-10-15 01:07:08,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727994268] [2019-10-15 01:07:08,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,382 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-15 01:07:08,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727994268] [2019-10-15 01:07:08,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:08,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984881268] [2019-10-15 01:07:08,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:08,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:08,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:08,387 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2019-10-15 01:07:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,430 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2019-10-15 01:07:08,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:08,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 01:07:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,435 INFO L225 Difference]: With dead ends: 944 [2019-10-15 01:07:08,435 INFO L226 Difference]: Without dead ends: 868 [2019-10-15 01:07:08,436 INFO L600 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-15 01:07:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-15 01:07:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2019-10-15 01:07:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-15 01:07:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2019-10-15 01:07:08,474 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2019-10-15 01:07:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,474 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2019-10-15 01:07:08,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2019-10-15 01:07:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 01:07:08,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:08,476 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1391552118, now seen corresponding path program 1 times [2019-10-15 01:07:08,477 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39593020] [2019-10-15 01:07:08,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,477 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,520 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-15 01:07:08,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39593020] [2019-10-15 01:07:08,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:08,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107869405] [2019-10-15 01:07:08,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:08,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:08,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:08,522 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2019-10-15 01:07:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,569 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2019-10-15 01:07:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:08,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-15 01:07:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,575 INFO L225 Difference]: With dead ends: 881 [2019-10-15 01:07:08,575 INFO L226 Difference]: Without dead ends: 863 [2019-10-15 01:07:08,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-15 01:07:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-15 01:07:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-15 01:07:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2019-10-15 01:07:08,616 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2019-10-15 01:07:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,616 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2019-10-15 01:07:08,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2019-10-15 01:07:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:08,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:08,618 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 868426094, now seen corresponding path program 1 times [2019-10-15 01:07:08,618 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78372599] [2019-10-15 01:07:08,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:08,665 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-15 01:07:08,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78372599] [2019-10-15 01:07:08,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:08,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:08,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61607324] [2019-10-15 01:07:08,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:08,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:08,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:08,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:08,667 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 4 states. [2019-10-15 01:07:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:08,919 INFO L93 Difference]: Finished difference Result 947 states and 1238 transitions. [2019-10-15 01:07:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:08,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-15 01:07:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:08,923 INFO L225 Difference]: With dead ends: 947 [2019-10-15 01:07:08,923 INFO L226 Difference]: Without dead ends: 614 [2019-10-15 01:07:08,925 INFO L600 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-15 01:07:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-15 01:07:08,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 577. [2019-10-15 01:07:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:07:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 748 transitions. [2019-10-15 01:07:08,961 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 748 transitions. Word has length 52 [2019-10-15 01:07:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:08,961 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 748 transitions. [2019-10-15 01:07:08,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 748 transitions. [2019-10-15 01:07:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:08,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:08,964 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:08,964 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1378147806, now seen corresponding path program 1 times [2019-10-15 01:07:08,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:08,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024763504] [2019-10-15 01:07:08,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:08,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,026 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-15 01:07:09,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024763504] [2019-10-15 01:07:09,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:09,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908230457] [2019-10-15 01:07:09,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:09,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:09,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:09,028 INFO L87 Difference]: Start difference. First operand 577 states and 748 transitions. Second operand 6 states. [2019-10-15 01:07:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,107 INFO L93 Difference]: Finished difference Result 597 states and 768 transitions. [2019-10-15 01:07:09,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:09,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-15 01:07:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,110 INFO L225 Difference]: With dead ends: 597 [2019-10-15 01:07:09,110 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:07:09,111 INFO L600 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-15 01:07:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:07:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-15 01:07:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:07:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2019-10-15 01:07:09,140 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 50 [2019-10-15 01:07:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,141 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2019-10-15 01:07:09,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2019-10-15 01:07:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 01:07:09,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,147 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:09,147 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,148 INFO L82 PathProgramCache]: Analyzing trace with hash 994153444, now seen corresponding path program 1 times [2019-10-15 01:07:09,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111156357] [2019-10-15 01:07:09,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,192 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-15 01:07:09,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111156357] [2019-10-15 01:07:09,193 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:09,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176385191] [2019-10-15 01:07:09,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:09,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:09,194 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand 3 states. [2019-10-15 01:07:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,329 INFO L93 Difference]: Finished difference Result 779 states and 1004 transitions. [2019-10-15 01:07:09,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:09,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 01:07:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,334 INFO L225 Difference]: With dead ends: 779 [2019-10-15 01:07:09,334 INFO L226 Difference]: Without dead ends: 752 [2019-10-15 01:07:09,335 INFO L600 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-15 01:07:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-15 01:07:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 622. [2019-10-15 01:07:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-15 01:07:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2019-10-15 01:07:09,386 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 50 [2019-10-15 01:07:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,387 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2019-10-15 01:07:09,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2019-10-15 01:07:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:09,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:09,390 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,390 INFO L82 PathProgramCache]: Analyzing trace with hash -12540829, now seen corresponding path program 1 times [2019-10-15 01:07:09,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807084847] [2019-10-15 01:07:09,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,475 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-15 01:07:09,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807084847] [2019-10-15 01:07:09,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:09,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001959519] [2019-10-15 01:07:09,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:09,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:09,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:09,477 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2019-10-15 01:07:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,628 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2019-10-15 01:07:09,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:09,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-15 01:07:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,634 INFO L225 Difference]: With dead ends: 661 [2019-10-15 01:07:09,634 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 01:07:09,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 01:07:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-15 01:07:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-15 01:07:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2019-10-15 01:07:09,682 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2019-10-15 01:07:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,683 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2019-10-15 01:07:09,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2019-10-15 01:07:09,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:09,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,685 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:09,686 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1421151086, now seen corresponding path program 1 times [2019-10-15 01:07:09,686 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300669985] [2019-10-15 01:07:09,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:09,784 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-15 01:07:09,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300669985] [2019-10-15 01:07:09,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:09,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:09,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394264023] [2019-10-15 01:07:09,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:09,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:09,787 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2019-10-15 01:07:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:09,857 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2019-10-15 01:07:09,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:09,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-15 01:07:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:09,862 INFO L225 Difference]: With dead ends: 637 [2019-10-15 01:07:09,862 INFO L226 Difference]: Without dead ends: 612 [2019-10-15 01:07:09,864 INFO L600 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-15 01:07:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-15 01:07:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-15 01:07:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-15 01:07:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-10-15 01:07:09,911 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2019-10-15 01:07:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:09,912 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-10-15 01:07:09,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-10-15 01:07:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:09,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:09,917 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:09,917 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1205911361, now seen corresponding path program 1 times [2019-10-15 01:07:09,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:09,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110116228] [2019-10-15 01:07:09,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:09,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,023 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-15 01:07:10,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110116228] [2019-10-15 01:07:10,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:10,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854667529] [2019-10-15 01:07:10,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:10,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:10,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:10,025 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2019-10-15 01:07:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,199 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2019-10-15 01:07:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:10,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-15 01:07:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,203 INFO L225 Difference]: With dead ends: 642 [2019-10-15 01:07:10,203 INFO L226 Difference]: Without dead ends: 638 [2019-10-15 01:07:10,204 INFO L600 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-15 01:07:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-15 01:07:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2019-10-15 01:07:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-15 01:07:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2019-10-15 01:07:10,244 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2019-10-15 01:07:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,244 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2019-10-15 01:07:10,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2019-10-15 01:07:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:07:10,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,246 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:10,246 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1205634531, now seen corresponding path program 1 times [2019-10-15 01:07:10,247 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158541079] [2019-10-15 01:07:10,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,247 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,336 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-15 01:07:10,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158541079] [2019-10-15 01:07:10,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:10,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207118086] [2019-10-15 01:07:10,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:10,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:10,339 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2019-10-15 01:07:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:10,437 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2019-10-15 01:07:10,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:10,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-15 01:07:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:10,441 INFO L225 Difference]: With dead ends: 1024 [2019-10-15 01:07:10,441 INFO L226 Difference]: Without dead ends: 670 [2019-10-15 01:07:10,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-15 01:07:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-10-15 01:07:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-15 01:07:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2019-10-15 01:07:10,479 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2019-10-15 01:07:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:10,479 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2019-10-15 01:07:10,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2019-10-15 01:07:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:10,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:10,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:10,481 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:10,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1316245040, now seen corresponding path program 1 times [2019-10-15 01:07:10,482 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:10,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907326067] [2019-10-15 01:07:10,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:10,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:10,699 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-15 01:07:10,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907326067] [2019-10-15 01:07:10,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:10,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:07:10,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232422859] [2019-10-15 01:07:10,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:07:10,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:07:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:10,701 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 15 states. [2019-10-15 01:07:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:13,933 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2019-10-15 01:07:13,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 01:07:13,934 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-10-15 01:07:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:13,938 INFO L225 Difference]: With dead ends: 1041 [2019-10-15 01:07:13,938 INFO L226 Difference]: Without dead ends: 794 [2019-10-15 01:07:13,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-10-15 01:07:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-15 01:07:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 662. [2019-10-15 01:07:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-15 01:07:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 850 transitions. [2019-10-15 01:07:13,977 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 850 transitions. Word has length 52 [2019-10-15 01:07:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:13,977 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 850 transitions. [2019-10-15 01:07:13,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 850 transitions. [2019-10-15 01:07:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:13,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:13,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:13,979 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash 472130064, now seen corresponding path program 1 times [2019-10-15 01:07:13,980 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:13,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429117712] [2019-10-15 01:07:13,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:13,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:14,090 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-15 01:07:14,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429117712] [2019-10-15 01:07:14,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:14,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:07:14,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858094321] [2019-10-15 01:07:14,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:07:14,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:07:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:07:14,095 INFO L87 Difference]: Start difference. First operand 662 states and 850 transitions. Second operand 10 states. [2019-10-15 01:07:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,068 INFO L93 Difference]: Finished difference Result 849 states and 1112 transitions. [2019-10-15 01:07:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:07:16,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-15 01:07:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,073 INFO L225 Difference]: With dead ends: 849 [2019-10-15 01:07:16,073 INFO L226 Difference]: Without dead ends: 833 [2019-10-15 01:07:16,074 INFO L600 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-15 01:07:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-10-15 01:07:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 676. [2019-10-15 01:07:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-15 01:07:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 863 transitions. [2019-10-15 01:07:16,111 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 863 transitions. Word has length 52 [2019-10-15 01:07:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,111 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 863 transitions. [2019-10-15 01:07:16,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:07:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 863 transitions. [2019-10-15 01:07:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:16,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,113 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:16,113 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1499440053, now seen corresponding path program 1 times [2019-10-15 01:07:16,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014361773] [2019-10-15 01:07:16,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,114 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:16,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-15 01:07:16,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014361773] [2019-10-15 01:07:16,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:16,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:16,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050943804] [2019-10-15 01:07:16,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:16,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:16,185 INFO L87 Difference]: Start difference. First operand 676 states and 863 transitions. Second operand 7 states. [2019-10-15 01:07:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:16,931 INFO L93 Difference]: Finished difference Result 812 states and 1040 transitions. [2019-10-15 01:07:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:16,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-15 01:07:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:16,936 INFO L225 Difference]: With dead ends: 812 [2019-10-15 01:07:16,937 INFO L226 Difference]: Without dead ends: 714 [2019-10-15 01:07:16,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-15 01:07:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 694. [2019-10-15 01:07:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-15 01:07:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 886 transitions. [2019-10-15 01:07:16,982 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 886 transitions. Word has length 52 [2019-10-15 01:07:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:16,982 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 886 transitions. [2019-10-15 01:07:16,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 886 transitions. [2019-10-15 01:07:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:07:16,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:16,984 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:16,985 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1356160695, now seen corresponding path program 1 times [2019-10-15 01:07:16,985 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:16,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897822879] [2019-10-15 01:07:16,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,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-15 01:07:17,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897822879] [2019-10-15 01:07:17,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:17,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870053188] [2019-10-15 01:07:17,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:17,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:17,023 INFO L87 Difference]: Start difference. First operand 694 states and 886 transitions. Second operand 3 states. [2019-10-15 01:07:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,129 INFO L93 Difference]: Finished difference Result 854 states and 1106 transitions. [2019-10-15 01:07:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:17,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-15 01:07:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,133 INFO L225 Difference]: With dead ends: 854 [2019-10-15 01:07:17,133 INFO L226 Difference]: Without dead ends: 781 [2019-10-15 01:07:17,134 INFO L600 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-15 01:07:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-15 01:07:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 667. [2019-10-15 01:07:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-15 01:07:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 865 transitions. [2019-10-15 01:07:17,171 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 865 transitions. Word has length 52 [2019-10-15 01:07:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,172 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 865 transitions. [2019-10-15 01:07:17,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 865 transitions. [2019-10-15 01:07:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:07:17,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,174 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:17,174 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1526640246, now seen corresponding path program 1 times [2019-10-15 01:07:17,174 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068121683] [2019-10-15 01:07:17,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,227 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-15 01:07:17,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068121683] [2019-10-15 01:07:17,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:17,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909206312] [2019-10-15 01:07:17,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:17,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:17,229 INFO L87 Difference]: Start difference. First operand 667 states and 865 transitions. Second operand 3 states. [2019-10-15 01:07:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:17,319 INFO L93 Difference]: Finished difference Result 978 states and 1267 transitions. [2019-10-15 01:07:17,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:17,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:07:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:17,323 INFO L225 Difference]: With dead ends: 978 [2019-10-15 01:07:17,323 INFO L226 Difference]: Without dead ends: 661 [2019-10-15 01:07:17,325 INFO L600 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-15 01:07:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-15 01:07:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-10-15 01:07:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-15 01:07:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-15 01:07:17,367 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 58 [2019-10-15 01:07:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:17,368 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-15 01:07:17,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-15 01:07:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:17,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:17,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:17,372 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:17,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 195627467, now seen corresponding path program 1 times [2019-10-15 01:07:17,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:17,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771330347] [2019-10-15 01:07:17,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:17,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:17,535 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-15 01:07:17,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771330347] [2019-10-15 01:07:17,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:17,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:17,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241737948] [2019-10-15 01:07:17,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:17,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:17,538 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 11 states. [2019-10-15 01:07:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:18,614 INFO L93 Difference]: Finished difference Result 1020 states and 1331 transitions. [2019-10-15 01:07:18,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:07:18,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-15 01:07:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:18,617 INFO L225 Difference]: With dead ends: 1020 [2019-10-15 01:07:18,617 INFO L226 Difference]: Without dead ends: 691 [2019-10-15 01:07:18,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-15 01:07:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 661. [2019-10-15 01:07:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-15 01:07:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-15 01:07:18,652 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 54 [2019-10-15 01:07:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:18,652 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-15 01:07:18,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-15 01:07:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:07:18,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:18,654 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:18,655 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash 837184011, now seen corresponding path program 1 times [2019-10-15 01:07:18,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:18,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635168959] [2019-10-15 01:07:18,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:18,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:18,712 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-15 01:07:18,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635168959] [2019-10-15 01:07:18,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:18,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:18,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565702914] [2019-10-15 01:07:18,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:18,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:18,718 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 5 states. [2019-10-15 01:07:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,103 INFO L93 Difference]: Finished difference Result 728 states and 929 transitions. [2019-10-15 01:07:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:19,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 01:07:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,108 INFO L225 Difference]: With dead ends: 728 [2019-10-15 01:07:19,108 INFO L226 Difference]: Without dead ends: 710 [2019-10-15 01:07:19,108 INFO L600 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-15 01:07:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-15 01:07:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 643. [2019-10-15 01:07:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-15 01:07:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 820 transitions. [2019-10-15 01:07:19,143 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 820 transitions. Word has length 54 [2019-10-15 01:07:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,143 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 820 transitions. [2019-10-15 01:07:19,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 820 transitions. [2019-10-15 01:07:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:07:19,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,145 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:19,146 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,146 INFO L82 PathProgramCache]: Analyzing trace with hash -848857517, now seen corresponding path program 1 times [2019-10-15 01:07:19,146 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841533260] [2019-10-15 01:07:19,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,217 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-15 01:07:19,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841533260] [2019-10-15 01:07:19,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:19,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908051053] [2019-10-15 01:07:19,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:19,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:19,219 INFO L87 Difference]: Start difference. First operand 643 states and 820 transitions. Second operand 8 states. [2019-10-15 01:07:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,291 INFO L93 Difference]: Finished difference Result 656 states and 832 transitions. [2019-10-15 01:07:19,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:19,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-15 01:07:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,295 INFO L225 Difference]: With dead ends: 656 [2019-10-15 01:07:19,295 INFO L226 Difference]: Without dead ends: 628 [2019-10-15 01:07:19,295 INFO L600 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-15 01:07:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-15 01:07:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-10-15 01:07:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-15 01:07:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 801 transitions. [2019-10-15 01:07:19,336 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 801 transitions. Word has length 55 [2019-10-15 01:07:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,336 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 801 transitions. [2019-10-15 01:07:19,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 801 transitions. [2019-10-15 01:07:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:07:19,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:19,343 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,343 INFO L82 PathProgramCache]: Analyzing trace with hash 682290104, now seen corresponding path program 1 times [2019-10-15 01:07:19,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509236856] [2019-10-15 01:07:19,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,418 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-15 01:07:19,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509236856] [2019-10-15 01:07:19,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:19,419 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165604534] [2019-10-15 01:07:19,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:19,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:19,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:19,420 INFO L87 Difference]: Start difference. First operand 628 states and 801 transitions. Second operand 8 states. [2019-10-15 01:07:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,569 INFO L93 Difference]: Finished difference Result 651 states and 824 transitions. [2019-10-15 01:07:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:19,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-15 01:07:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,573 INFO L225 Difference]: With dead ends: 651 [2019-10-15 01:07:19,573 INFO L226 Difference]: Without dead ends: 623 [2019-10-15 01:07:19,574 INFO L600 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-15 01:07:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-15 01:07:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-15 01:07:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-15 01:07:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 793 transitions. [2019-10-15 01:07:19,608 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 793 transitions. Word has length 56 [2019-10-15 01:07:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,609 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 793 transitions. [2019-10-15 01:07:19,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 793 transitions. [2019-10-15 01:07:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 01:07:19,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:19,611 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1988865588, now seen corresponding path program 1 times [2019-10-15 01:07:19,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607196199] [2019-10-15 01:07:19,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,754 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-15 01:07:19,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607196199] [2019-10-15 01:07:19,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:19,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953733919] [2019-10-15 01:07:19,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:19,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:19,787 INFO L87 Difference]: Start difference. First operand 623 states and 793 transitions. Second operand 5 states. [2019-10-15 01:07:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:19,847 INFO L93 Difference]: Finished difference Result 882 states and 1130 transitions. [2019-10-15 01:07:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:19,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-15 01:07:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:19,850 INFO L225 Difference]: With dead ends: 882 [2019-10-15 01:07:19,850 INFO L226 Difference]: Without dead ends: 565 [2019-10-15 01:07:19,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-15 01:07:19,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-10-15 01:07:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-15 01:07:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 709 transitions. [2019-10-15 01:07:19,900 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 709 transitions. Word has length 64 [2019-10-15 01:07:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:19,900 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 709 transitions. [2019-10-15 01:07:19,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 709 transitions. [2019-10-15 01:07:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:07:19,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:19,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:19,902 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:19,902 INFO L82 PathProgramCache]: Analyzing trace with hash 315715581, now seen corresponding path program 1 times [2019-10-15 01:07:19,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:19,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259671059] [2019-10-15 01:07:19,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:19,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:19,961 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-15 01:07:19,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259671059] [2019-10-15 01:07:19,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:19,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:19,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043210826] [2019-10-15 01:07:19,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:19,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:19,963 INFO L87 Difference]: Start difference. First operand 565 states and 709 transitions. Second operand 6 states. [2019-10-15 01:07:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:20,029 INFO L93 Difference]: Finished difference Result 584 states and 728 transitions. [2019-10-15 01:07:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:20,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-15 01:07:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:20,032 INFO L225 Difference]: With dead ends: 584 [2019-10-15 01:07:20,032 INFO L226 Difference]: Without dead ends: 560 [2019-10-15 01:07:20,033 INFO L600 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-15 01:07:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-15 01:07:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-15 01:07:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-15 01:07:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 703 transitions. [2019-10-15 01:07:20,069 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 703 transitions. Word has length 60 [2019-10-15 01:07:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:20,069 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 703 transitions. [2019-10-15 01:07:20,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 703 transitions. [2019-10-15 01:07:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 01:07:20,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:20,072 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:20,072 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash 365447091, now seen corresponding path program 1 times [2019-10-15 01:07:20,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:20,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790763541] [2019-10-15 01:07:20,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:20,133 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-15 01:07:20,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790763541] [2019-10-15 01:07:20,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:20,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:20,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112186703] [2019-10-15 01:07:20,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:20,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:20,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:20,135 INFO L87 Difference]: Start difference. First operand 560 states and 703 transitions. Second operand 5 states. [2019-10-15 01:07:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:20,386 INFO L93 Difference]: Finished difference Result 819 states and 1033 transitions. [2019-10-15 01:07:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:20,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-15 01:07:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:20,390 INFO L225 Difference]: With dead ends: 819 [2019-10-15 01:07:20,390 INFO L226 Difference]: Without dead ends: 560 [2019-10-15 01:07:20,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-15 01:07:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-15 01:07:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-15 01:07:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 701 transitions. [2019-10-15 01:07:20,423 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 701 transitions. Word has length 68 [2019-10-15 01:07:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:20,424 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 701 transitions. [2019-10-15 01:07:20,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 701 transitions. [2019-10-15 01:07:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:07:20,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:20,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:20,428 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:20,429 INFO L82 PathProgramCache]: Analyzing trace with hash -701574740, now seen corresponding path program 1 times [2019-10-15 01:07:20,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:20,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77926547] [2019-10-15 01:07:20,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:20,502 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-15 01:07:20,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77926547] [2019-10-15 01:07:20,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:20,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:20,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865608942] [2019-10-15 01:07:20,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:20,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:20,504 INFO L87 Difference]: Start difference. First operand 560 states and 701 transitions. Second operand 9 states. [2019-10-15 01:07:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:20,681 INFO L93 Difference]: Finished difference Result 589 states and 732 transitions. [2019-10-15 01:07:20,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:20,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-15 01:07:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:20,684 INFO L225 Difference]: With dead ends: 589 [2019-10-15 01:07:20,684 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:07:20,685 INFO L600 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-15 01:07:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:07:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:07:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:07:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 693 transitions. [2019-10-15 01:07:20,715 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 693 transitions. Word has length 61 [2019-10-15 01:07:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:20,715 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 693 transitions. [2019-10-15 01:07:20,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 693 transitions. [2019-10-15 01:07:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:20,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:20,717 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:20,718 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1376834024, now seen corresponding path program 1 times [2019-10-15 01:07:20,718 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:20,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527328788] [2019-10-15 01:07:20,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:20,768 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-15 01:07:20,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527328788] [2019-10-15 01:07:20,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:20,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:20,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799430988] [2019-10-15 01:07:20,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:20,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:20,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:20,770 INFO L87 Difference]: Start difference. First operand 555 states and 693 transitions. Second operand 5 states. [2019-10-15 01:07:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:20,811 INFO L93 Difference]: Finished difference Result 678 states and 838 transitions. [2019-10-15 01:07:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:20,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-15 01:07:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:20,813 INFO L225 Difference]: With dead ends: 678 [2019-10-15 01:07:20,814 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:07:20,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:07:20,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-15 01:07:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-15 01:07:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 697 transitions. [2019-10-15 01:07:20,844 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 697 transitions. Word has length 63 [2019-10-15 01:07:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:20,845 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 697 transitions. [2019-10-15 01:07:20,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 697 transitions. [2019-10-15 01:07:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 01:07:20,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:20,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:20,847 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:20,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:20,847 INFO L82 PathProgramCache]: Analyzing trace with hash 902963543, now seen corresponding path program 1 times [2019-10-15 01:07:20,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:20,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704073543] [2019-10-15 01:07:20,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:20,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:20,971 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-15 01:07:20,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704073543] [2019-10-15 01:07:20,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:20,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:20,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332924422] [2019-10-15 01:07:20,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:20,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:20,974 INFO L87 Difference]: Start difference. First operand 559 states and 697 transitions. Second operand 9 states. [2019-10-15 01:07:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:21,094 INFO L93 Difference]: Finished difference Result 696 states and 856 transitions. [2019-10-15 01:07:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:21,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-15 01:07:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:21,097 INFO L225 Difference]: With dead ends: 696 [2019-10-15 01:07:21,098 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:07:21,102 INFO L600 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-15 01:07:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:07:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-15 01:07:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-15 01:07:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 696 transitions. [2019-10-15 01:07:21,146 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 696 transitions. Word has length 63 [2019-10-15 01:07:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:21,146 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 696 transitions. [2019-10-15 01:07:21,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 696 transitions. [2019-10-15 01:07:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:21,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:21,148 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:21,149 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:21,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:21,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2118524936, now seen corresponding path program 1 times [2019-10-15 01:07:21,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:21,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515812974] [2019-10-15 01:07:21,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:21,271 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-15 01:07:21,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515812974] [2019-10-15 01:07:21,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:21,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:21,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899028048] [2019-10-15 01:07:21,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:21,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:21,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:21,273 INFO L87 Difference]: Start difference. First operand 559 states and 696 transitions. Second operand 9 states. [2019-10-15 01:07:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:21,535 INFO L93 Difference]: Finished difference Result 588 states and 727 transitions. [2019-10-15 01:07:21,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:21,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-15 01:07:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:21,540 INFO L225 Difference]: With dead ends: 588 [2019-10-15 01:07:21,540 INFO L226 Difference]: Without dead ends: 553 [2019-10-15 01:07:21,546 INFO L600 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-15 01:07:21,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-15 01:07:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-15 01:07:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-15 01:07:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 687 transitions. [2019-10-15 01:07:21,632 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 687 transitions. Word has length 62 [2019-10-15 01:07:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:21,632 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 687 transitions. [2019-10-15 01:07:21,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 687 transitions. [2019-10-15 01:07:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:21,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:21,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:21,636 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:21,636 INFO L82 PathProgramCache]: Analyzing trace with hash -129702502, now seen corresponding path program 1 times [2019-10-15 01:07:21,637 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:21,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241121407] [2019-10-15 01:07:21,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:21,746 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-15 01:07:21,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241121407] [2019-10-15 01:07:21,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:21,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:21,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964279062] [2019-10-15 01:07:21,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:21,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:21,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:21,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:21,749 INFO L87 Difference]: Start difference. First operand 553 states and 687 transitions. Second operand 9 states. [2019-10-15 01:07:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:21,915 INFO L93 Difference]: Finished difference Result 582 states and 718 transitions. [2019-10-15 01:07:21,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:21,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-15 01:07:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:21,918 INFO L225 Difference]: With dead ends: 582 [2019-10-15 01:07:21,918 INFO L226 Difference]: Without dead ends: 548 [2019-10-15 01:07:21,918 INFO L600 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-15 01:07:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-15 01:07:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-15 01:07:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-15 01:07:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 679 transitions. [2019-10-15 01:07:21,947 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 679 transitions. Word has length 62 [2019-10-15 01:07:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:21,948 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 679 transitions. [2019-10-15 01:07:21,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 679 transitions. [2019-10-15 01:07:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 01:07:21,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:21,949 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:21,950 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -905491201, now seen corresponding path program 1 times [2019-10-15 01:07:21,950 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:21,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577196224] [2019-10-15 01:07:21,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:21,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:22,032 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-15 01:07:22,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577196224] [2019-10-15 01:07:22,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:22,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:07:22,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187733768] [2019-10-15 01:07:22,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:07:22,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:22,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:07:22,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:07:22,034 INFO L87 Difference]: Start difference. First operand 548 states and 679 transitions. Second operand 8 states. [2019-10-15 01:07:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:22,204 INFO L93 Difference]: Finished difference Result 565 states and 696 transitions. [2019-10-15 01:07:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:07:22,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-10-15 01:07:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:22,208 INFO L225 Difference]: With dead ends: 565 [2019-10-15 01:07:22,208 INFO L226 Difference]: Without dead ends: 533 [2019-10-15 01:07:22,208 INFO L600 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-15 01:07:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-15 01:07:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2019-10-15 01:07:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-15 01:07:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 659 transitions. [2019-10-15 01:07:22,253 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 659 transitions. Word has length 62 [2019-10-15 01:07:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:22,254 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 659 transitions. [2019-10-15 01:07:22,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:07:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 659 transitions. [2019-10-15 01:07:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-15 01:07:22,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:22,257 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:22,257 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1235234569, now seen corresponding path program 1 times [2019-10-15 01:07:22,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:22,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052218167] [2019-10-15 01:07:22,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:22,367 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-15 01:07:22,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052218167] [2019-10-15 01:07:22,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:22,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:22,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176293811] [2019-10-15 01:07:22,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:22,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:22,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:22,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:22,372 INFO L87 Difference]: Start difference. First operand 533 states and 659 transitions. Second operand 6 states. [2019-10-15 01:07:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:22,466 INFO L93 Difference]: Finished difference Result 775 states and 967 transitions. [2019-10-15 01:07:22,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:22,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-10-15 01:07:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:22,470 INFO L225 Difference]: With dead ends: 775 [2019-10-15 01:07:22,471 INFO L226 Difference]: Without dead ends: 549 [2019-10-15 01:07:22,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-15 01:07:22,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2019-10-15 01:07:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-15 01:07:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 657 transitions. [2019-10-15 01:07:22,521 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 657 transitions. Word has length 71 [2019-10-15 01:07:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:22,523 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 657 transitions. [2019-10-15 01:07:22,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 657 transitions. [2019-10-15 01:07:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 01:07:22,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:22,526 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:22,526 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -981702428, now seen corresponding path program 1 times [2019-10-15 01:07:22,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:22,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933687483] [2019-10-15 01:07:22,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:22,590 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-15 01:07:22,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933687483] [2019-10-15 01:07:22,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:22,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:07:22,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677083852] [2019-10-15 01:07:22,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:07:22,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:07:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:07:22,594 INFO L87 Difference]: Start difference. First operand 533 states and 657 transitions. Second operand 3 states. [2019-10-15 01:07:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:22,645 INFO L93 Difference]: Finished difference Result 890 states and 1105 transitions. [2019-10-15 01:07:22,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:07:22,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-15 01:07:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:22,648 INFO L225 Difference]: With dead ends: 890 [2019-10-15 01:07:22,648 INFO L226 Difference]: Without dead ends: 637 [2019-10-15 01:07:22,649 INFO L600 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-15 01:07:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-15 01:07:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 607. [2019-10-15 01:07:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-15 01:07:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 751 transitions. [2019-10-15 01:07:22,683 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 751 transitions. Word has length 73 [2019-10-15 01:07:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:22,685 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 751 transitions. [2019-10-15 01:07:22,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:07:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 751 transitions. [2019-10-15 01:07:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-15 01:07:22,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:22,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:22,687 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:22,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash -573109325, now seen corresponding path program 1 times [2019-10-15 01:07:22,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:22,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642830713] [2019-10-15 01:07:22,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:22,775 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-15 01:07:22,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642830713] [2019-10-15 01:07:22,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:22,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:22,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386541871] [2019-10-15 01:07:22,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:22,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:22,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:22,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:22,777 INFO L87 Difference]: Start difference. First operand 607 states and 751 transitions. Second operand 9 states. [2019-10-15 01:07:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:22,950 INFO L93 Difference]: Finished difference Result 636 states and 782 transitions. [2019-10-15 01:07:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:22,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-15 01:07:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:22,953 INFO L225 Difference]: With dead ends: 636 [2019-10-15 01:07:22,953 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:07:22,954 INFO L600 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-15 01:07:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:07:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-15 01:07:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-15 01:07:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 694 transitions. [2019-10-15 01:07:22,984 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 694 transitions. Word has length 66 [2019-10-15 01:07:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:22,984 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 694 transitions. [2019-10-15 01:07:22,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 694 transitions. [2019-10-15 01:07:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 01:07:22,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:22,986 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:22,987 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:22,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1657933026, now seen corresponding path program 1 times [2019-10-15 01:07:22,987 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:22,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836265342] [2019-10-15 01:07:22,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:22,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:23,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-15 01:07:23,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836265342] [2019-10-15 01:07:23,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:23,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:07:23,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061482616] [2019-10-15 01:07:23,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:07:23,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:07:23,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:07:23,061 INFO L87 Difference]: Start difference. First operand 561 states and 694 transitions. Second operand 4 states. [2019-10-15 01:07:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:23,249 INFO L93 Difference]: Finished difference Result 1273 states and 1559 transitions. [2019-10-15 01:07:23,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:07:23,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-15 01:07:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:23,253 INFO L225 Difference]: With dead ends: 1273 [2019-10-15 01:07:23,253 INFO L226 Difference]: Without dead ends: 765 [2019-10-15 01:07:23,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-15 01:07:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-15 01:07:23,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 655. [2019-10-15 01:07:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-15 01:07:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 800 transitions. [2019-10-15 01:07:23,295 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 800 transitions. Word has length 82 [2019-10-15 01:07:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:23,296 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 800 transitions. [2019-10-15 01:07:23,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:07:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 800 transitions. [2019-10-15 01:07:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-15 01:07:23,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:23,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:23,298 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233248, now seen corresponding path program 1 times [2019-10-15 01:07:23,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:23,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196207102] [2019-10-15 01:07:23,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:23,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:23,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:23,442 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-15 01:07:23,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196207102] [2019-10-15 01:07:23,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:23,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:23,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131438828] [2019-10-15 01:07:23,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:23,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:23,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:23,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:23,446 INFO L87 Difference]: Start difference. First operand 655 states and 800 transitions. Second operand 7 states. [2019-10-15 01:07:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:24,110 INFO L93 Difference]: Finished difference Result 959 states and 1175 transitions. [2019-10-15 01:07:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:24,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-15 01:07:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:24,115 INFO L225 Difference]: With dead ends: 959 [2019-10-15 01:07:24,115 INFO L226 Difference]: Without dead ends: 650 [2019-10-15 01:07:24,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-15 01:07:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 639. [2019-10-15 01:07:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-15 01:07:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 772 transitions. [2019-10-15 01:07:24,156 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 772 transitions. Word has length 82 [2019-10-15 01:07:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 772 transitions. [2019-10-15 01:07:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 772 transitions. [2019-10-15 01:07:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:07:24,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:24,158 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:24,159 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:24,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:24,159 INFO L82 PathProgramCache]: Analyzing trace with hash -501162190, now seen corresponding path program 1 times [2019-10-15 01:07:24,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:24,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478864425] [2019-10-15 01:07:24,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:24,210 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-15 01:07:24,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478864425] [2019-10-15 01:07:24,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:24,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:24,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160077698] [2019-10-15 01:07:24,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:24,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:24,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:24,211 INFO L87 Difference]: Start difference. First operand 639 states and 772 transitions. Second operand 5 states. [2019-10-15 01:07:24,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:24,256 INFO L93 Difference]: Finished difference Result 825 states and 989 transitions. [2019-10-15 01:07:24,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:24,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-15 01:07:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:24,259 INFO L225 Difference]: With dead ends: 825 [2019-10-15 01:07:24,259 INFO L226 Difference]: Without dead ends: 637 [2019-10-15 01:07:24,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-15 01:07:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-15 01:07:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-15 01:07:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 768 transitions. [2019-10-15 01:07:24,299 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 768 transitions. Word has length 76 [2019-10-15 01:07:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:24,299 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 768 transitions. [2019-10-15 01:07:24,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 768 transitions. [2019-10-15 01:07:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 01:07:24,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:24,301 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:24,302 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash 211753811, now seen corresponding path program 1 times [2019-10-15 01:07:24,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:24,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714723869] [2019-10-15 01:07:24,302 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:24,378 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-15 01:07:24,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714723869] [2019-10-15 01:07:24,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:24,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:24,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087276414] [2019-10-15 01:07:24,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:24,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:24,380 INFO L87 Difference]: Start difference. First operand 637 states and 768 transitions. Second operand 9 states. [2019-10-15 01:07:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:24,458 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2019-10-15 01:07:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:24,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-10-15 01:07:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:24,460 INFO L225 Difference]: With dead ends: 651 [2019-10-15 01:07:24,460 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:07:24,461 INFO L600 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-15 01:07:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:07:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2019-10-15 01:07:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:07:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2019-10-15 01:07:24,499 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 76 [2019-10-15 01:07:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:24,499 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2019-10-15 01:07:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2019-10-15 01:07:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:07:24,501 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:24,502 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:24,502 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1448627846, now seen corresponding path program 1 times [2019-10-15 01:07:24,502 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:24,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804666507] [2019-10-15 01:07:24,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:24,587 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-15 01:07:24,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804666507] [2019-10-15 01:07:24,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:24,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:24,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699345063] [2019-10-15 01:07:24,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:24,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:24,590 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2019-10-15 01:07:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:24,685 INFO L93 Difference]: Finished difference Result 902 states and 1114 transitions. [2019-10-15 01:07:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:24,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-15 01:07:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:24,689 INFO L225 Difference]: With dead ends: 902 [2019-10-15 01:07:24,690 INFO L226 Difference]: Without dead ends: 648 [2019-10-15 01:07:24,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-15 01:07:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 553. [2019-10-15 01:07:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-15 01:07:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 659 transitions. [2019-10-15 01:07:24,737 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 659 transitions. Word has length 83 [2019-10-15 01:07:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 659 transitions. [2019-10-15 01:07:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 659 transitions. [2019-10-15 01:07:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:07:24,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:24,740 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:24,741 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:24,741 INFO L82 PathProgramCache]: Analyzing trace with hash -433541091, now seen corresponding path program 1 times [2019-10-15 01:07:24,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:24,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254646700] [2019-10-15 01:07:24,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:24,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:24,804 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-15 01:07:24,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254646700] [2019-10-15 01:07:24,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:24,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:24,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103153714] [2019-10-15 01:07:24,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:24,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:24,806 INFO L87 Difference]: Start difference. First operand 553 states and 659 transitions. Second operand 5 states. [2019-10-15 01:07:25,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:25,238 INFO L93 Difference]: Finished difference Result 1005 states and 1180 transitions. [2019-10-15 01:07:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:25,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-15 01:07:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:25,242 INFO L225 Difference]: With dead ends: 1005 [2019-10-15 01:07:25,242 INFO L226 Difference]: Without dead ends: 651 [2019-10-15 01:07:25,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-15 01:07:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 628. [2019-10-15 01:07:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-15 01:07:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 735 transitions. [2019-10-15 01:07:25,315 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 735 transitions. Word has length 78 [2019-10-15 01:07:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:25,316 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 735 transitions. [2019-10-15 01:07:25,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 735 transitions. [2019-10-15 01:07:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:07:25,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:25,318 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:25,319 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1570342342, now seen corresponding path program 1 times [2019-10-15 01:07:25,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:25,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699050107] [2019-10-15 01:07:25,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:25,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:25,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:25,414 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-15 01:07:25,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699050107] [2019-10-15 01:07:25,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:25,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:25,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706985962] [2019-10-15 01:07:25,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:25,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:25,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:25,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:25,416 INFO L87 Difference]: Start difference. First operand 628 states and 735 transitions. Second operand 9 states. [2019-10-15 01:07:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:25,568 INFO L93 Difference]: Finished difference Result 630 states and 736 transitions. [2019-10-15 01:07:25,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:25,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-10-15 01:07:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:25,571 INFO L225 Difference]: With dead ends: 630 [2019-10-15 01:07:25,571 INFO L226 Difference]: Without dead ends: 449 [2019-10-15 01:07:25,571 INFO L600 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-15 01:07:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-15 01:07:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-15 01:07:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-15 01:07:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 533 transitions. [2019-10-15 01:07:25,610 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 533 transitions. Word has length 79 [2019-10-15 01:07:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:25,610 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 533 transitions. [2019-10-15 01:07:25,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 533 transitions. [2019-10-15 01:07:25,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 01:07:25,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:25,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:25,613 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:25,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:25,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1336030567, now seen corresponding path program 1 times [2019-10-15 01:07:25,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:25,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276133015] [2019-10-15 01:07:25,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:25,614 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:25,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:25,692 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-15 01:07:25,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276133015] [2019-10-15 01:07:25,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:25,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:25,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496074917] [2019-10-15 01:07:25,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:25,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:25,694 INFO L87 Difference]: Start difference. First operand 449 states and 533 transitions. Second operand 9 states. [2019-10-15 01:07:25,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:25,806 INFO L93 Difference]: Finished difference Result 470 states and 554 transitions. [2019-10-15 01:07:25,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:25,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-15 01:07:25,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:25,808 INFO L225 Difference]: With dead ends: 470 [2019-10-15 01:07:25,808 INFO L226 Difference]: Without dead ends: 449 [2019-10-15 01:07:25,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:07:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-15 01:07:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-15 01:07:25,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-15 01:07:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2019-10-15 01:07:25,838 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 88 [2019-10-15 01:07:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:25,838 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2019-10-15 01:07:25,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2019-10-15 01:07:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 01:07:25,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:25,840 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:25,840 INFO L410 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2100668997, now seen corresponding path program 1 times [2019-10-15 01:07:25,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:25,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384022961] [2019-10-15 01:07:25,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:25,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:25,902 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-15 01:07:25,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384022961] [2019-10-15 01:07:25,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:25,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:07:25,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138727409] [2019-10-15 01:07:25,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:07:25,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:25,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:07:25,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:25,904 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand 7 states. [2019-10-15 01:07:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:26,048 INFO L93 Difference]: Finished difference Result 847 states and 1007 transitions. [2019-10-15 01:07:26,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:26,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-10-15 01:07:26,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:26,051 INFO L225 Difference]: With dead ends: 847 [2019-10-15 01:07:26,051 INFO L226 Difference]: Without dead ends: 792 [2019-10-15 01:07:26,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-15 01:07:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 370. [2019-10-15 01:07:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-15 01:07:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2019-10-15 01:07:26,081 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 99 [2019-10-15 01:07:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:26,082 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2019-10-15 01:07:26,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:07:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2019-10-15 01:07:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 01:07:26,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:26,084 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:26,084 INFO L410 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:26,084 INFO L82 PathProgramCache]: Analyzing trace with hash -289766285, now seen corresponding path program 1 times [2019-10-15 01:07:26,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:26,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292162177] [2019-10-15 01:07:26,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:26,190 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-15 01:07:26,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292162177] [2019-10-15 01:07:26,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:26,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:07:26,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824132415] [2019-10-15 01:07:26,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:07:26,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:07:26,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:26,192 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2019-10-15 01:07:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:26,301 INFO L93 Difference]: Finished difference Result 515 states and 603 transitions. [2019-10-15 01:07:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:07:26,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-10-15 01:07:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:26,303 INFO L225 Difference]: With dead ends: 515 [2019-10-15 01:07:26,303 INFO L226 Difference]: Without dead ends: 366 [2019-10-15 01:07:26,304 INFO L600 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-15 01:07:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-15 01:07:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-10-15 01:07:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-15 01:07:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2019-10-15 01:07:26,331 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 104 [2019-10-15 01:07:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:26,331 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2019-10-15 01:07:26,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:07:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2019-10-15 01:07:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:07:26,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:26,333 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-10-15 01:07:26,333 INFO L410 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash -211623252, now seen corresponding path program 1 times [2019-10-15 01:07:26,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:26,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17397368] [2019-10-15 01:07:26,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:07:26,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17397368] [2019-10-15 01:07:26,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:26,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:26,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202879430] [2019-10-15 01:07:26,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:26,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:26,405 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2019-10-15 01:07:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:26,449 INFO L93 Difference]: Finished difference Result 381 states and 434 transitions. [2019-10-15 01:07:26,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:26,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-10-15 01:07:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:26,450 INFO L225 Difference]: With dead ends: 381 [2019-10-15 01:07:26,451 INFO L226 Difference]: Without dead ends: 305 [2019-10-15 01:07:26,451 INFO L600 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-15 01:07:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-15 01:07:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-10-15 01:07:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-15 01:07:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2019-10-15 01:07:26,470 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 113 [2019-10-15 01:07:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:26,470 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2019-10-15 01:07:26,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2019-10-15 01:07:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 01:07:26,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:26,472 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:07:26,472 INFO L410 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1015672895, now seen corresponding path program 1 times [2019-10-15 01:07:26,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:26,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347944255] [2019-10-15 01:07:26,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 01:07:26,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347944255] [2019-10-15 01:07:26,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:26,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:07:26,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571511797] [2019-10-15 01:07:26,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:07:26,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:26,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:07:26,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:07:26,561 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand 9 states. [2019-10-15 01:07:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:26,654 INFO L93 Difference]: Finished difference Result 316 states and 355 transitions. [2019-10-15 01:07:26,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:07:26,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-15 01:07:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:26,656 INFO L225 Difference]: With dead ends: 316 [2019-10-15 01:07:26,656 INFO L226 Difference]: Without dead ends: 287 [2019-10-15 01:07:26,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:07:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-15 01:07:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-10-15 01:07:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-15 01:07:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2019-10-15 01:07:26,676 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 134 [2019-10-15 01:07:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:26,676 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2019-10-15 01:07:26,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:07:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2019-10-15 01:07:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:07:26,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:26,679 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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-15 01:07:26,679 INFO L410 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash 14849890, now seen corresponding path program 1 times [2019-10-15 01:07:26,679 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:26,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083325549] [2019-10-15 01:07:26,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:26,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-15 01:07:26,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083325549] [2019-10-15 01:07:26,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:26,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:07:26,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534357298] [2019-10-15 01:07:26,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:07:26,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:07:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:26,862 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand 15 states. [2019-10-15 01:07:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:27,043 INFO L93 Difference]: Finished difference Result 368 states and 412 transitions. [2019-10-15 01:07:27,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:07:27,043 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-10-15 01:07:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:27,045 INFO L225 Difference]: With dead ends: 368 [2019-10-15 01:07:27,045 INFO L226 Difference]: Without dead ends: 271 [2019-10-15 01:07:27,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:07:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-15 01:07:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2019-10-15 01:07:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-15 01:07:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-15 01:07:27,066 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 135 [2019-10-15 01:07:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:27,066 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-15 01:07:27,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-15 01:07:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:07:27,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:27,068 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 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-15 01:07:27,069 INFO L410 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash 709369442, now seen corresponding path program 1 times [2019-10-15 01:07:27,069 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:27,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795435472] [2019-10-15 01:07:27,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:27,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:27,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:27,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795435472] [2019-10-15 01:07:27,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:27,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:27,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784362016] [2019-10-15 01:07:27,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:27,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:27,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:27,133 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 5 states. [2019-10-15 01:07:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:27,176 INFO L93 Difference]: Finished difference Result 305 states and 339 transitions. [2019-10-15 01:07:27,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:27,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-15 01:07:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:27,178 INFO L225 Difference]: With dead ends: 305 [2019-10-15 01:07:27,178 INFO L226 Difference]: Without dead ends: 276 [2019-10-15 01:07:27,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-15 01:07:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2019-10-15 01:07:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-15 01:07:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-15 01:07:27,198 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 143 [2019-10-15 01:07:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:27,198 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-15 01:07:27,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-15 01:07:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:07:27,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:27,200 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-15 01:07:27,200 INFO L410 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1897304323, now seen corresponding path program 1 times [2019-10-15 01:07:27,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:27,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479927390] [2019-10-15 01:07:27,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:27,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:27,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:07:27,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479927390] [2019-10-15 01:07:27,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:27,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:27,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569164556] [2019-10-15 01:07:27,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:27,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:27,269 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 6 states. [2019-10-15 01:07:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:27,305 INFO L93 Difference]: Finished difference Result 357 states and 400 transitions. [2019-10-15 01:07:27,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:07:27,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:07:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:27,308 INFO L225 Difference]: With dead ends: 357 [2019-10-15 01:07:27,308 INFO L226 Difference]: Without dead ends: 269 [2019-10-15 01:07:27,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-15 01:07:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-15 01:07:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2019-10-15 01:07:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-15 01:07:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2019-10-15 01:07:27,334 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 144 [2019-10-15 01:07:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:27,334 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2019-10-15 01:07:27,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2019-10-15 01:07:27,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:07:27,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:27,336 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:27,337 INFO L410 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:27,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1361167968, now seen corresponding path program 1 times [2019-10-15 01:07:27,338 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:27,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678250465] [2019-10-15 01:07:27,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:27,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:27,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:07:27,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678250465] [2019-10-15 01:07:27,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:27,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 01:07:27,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871391410] [2019-10-15 01:07:27,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 01:07:27,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 01:07:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:07:27,528 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 14 states. [2019-10-15 01:07:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:28,680 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-10-15 01:07:28,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:07:28,680 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-10-15 01:07:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:28,682 INFO L225 Difference]: With dead ends: 310 [2019-10-15 01:07:28,682 INFO L226 Difference]: Without dead ends: 273 [2019-10-15 01:07:28,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:07:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-10-15 01:07:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2019-10-15 01:07:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-15 01:07:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2019-10-15 01:07:28,704 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 145 [2019-10-15 01:07:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:28,704 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2019-10-15 01:07:28,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 01:07:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2019-10-15 01:07:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 01:07:28,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:28,706 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:28,706 INFO L410 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash -659068543, now seen corresponding path program 1 times [2019-10-15 01:07:28,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:28,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23712394] [2019-10-15 01:07:28,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:28,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:28,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:28,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23712394] [2019-10-15 01:07:28,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:28,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:07:28,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442625435] [2019-10-15 01:07:28,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:07:28,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:07:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:07:28,802 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand 6 states. [2019-10-15 01:07:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:28,881 INFO L93 Difference]: Finished difference Result 352 states and 397 transitions. [2019-10-15 01:07:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:07:28,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-15 01:07:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:28,885 INFO L225 Difference]: With dead ends: 352 [2019-10-15 01:07:28,885 INFO L226 Difference]: Without dead ends: 292 [2019-10-15 01:07:28,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:07:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-15 01:07:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 269. [2019-10-15 01:07:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-15 01:07:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 296 transitions. [2019-10-15 01:07:28,910 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 296 transitions. Word has length 148 [2019-10-15 01:07:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:28,910 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 296 transitions. [2019-10-15 01:07:28,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:07:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 296 transitions. [2019-10-15 01:07:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:07:28,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:28,912 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:28,912 INFO L410 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2021606810, now seen corresponding path program 1 times [2019-10-15 01:07:28,913 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:28,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36484307] [2019-10-15 01:07:28,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:28,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:28,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:07:29,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36484307] [2019-10-15 01:07:29,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:29,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:07:29,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196585337] [2019-10-15 01:07:29,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:07:29,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:29,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:07:29,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:29,047 INFO L87 Difference]: Start difference. First operand 269 states and 296 transitions. Second operand 5 states. [2019-10-15 01:07:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:29,089 INFO L93 Difference]: Finished difference Result 305 states and 333 transitions. [2019-10-15 01:07:29,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:07:29,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:07:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:29,090 INFO L225 Difference]: With dead ends: 305 [2019-10-15 01:07:29,090 INFO L226 Difference]: Without dead ends: 275 [2019-10-15 01:07:29,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:07:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-15 01:07:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2019-10-15 01:07:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-15 01:07:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 300 transitions. [2019-10-15 01:07:29,111 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 300 transitions. Word has length 150 [2019-10-15 01:07:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:29,112 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 300 transitions. [2019-10-15 01:07:29,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:07:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 300 transitions. [2019-10-15 01:07:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:07:29,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:29,113 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:29,113 INFO L410 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:29,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2091873989, now seen corresponding path program 1 times [2019-10-15 01:07:29,114 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:29,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356579293] [2019-10-15 01:07:29,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:29,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:29,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:07:29,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356579293] [2019-10-15 01:07:29,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:07:29,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-15 01:07:29,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400931650] [2019-10-15 01:07:29,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-15 01:07:29,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:07:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-15 01:07:29,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:07:29,274 INFO L87 Difference]: Start difference. First operand 273 states and 300 transitions. Second operand 15 states. [2019-10-15 01:07:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:07:29,500 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2019-10-15 01:07:29,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:07:29,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2019-10-15 01:07:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:07:29,505 INFO L225 Difference]: With dead ends: 319 [2019-10-15 01:07:29,505 INFO L226 Difference]: Without dead ends: 283 [2019-10-15 01:07:29,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:07:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-10-15 01:07:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2019-10-15 01:07:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-15 01:07:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 280 transitions. [2019-10-15 01:07:29,529 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 280 transitions. Word has length 150 [2019-10-15 01:07:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:07:29,529 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 280 transitions. [2019-10-15 01:07:29,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-15 01:07:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 280 transitions. [2019-10-15 01:07:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:07:29,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:07:29,531 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 01:07:29,531 INFO L410 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:07:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:07:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1666371012, now seen corresponding path program 1 times [2019-10-15 01:07:29,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:07:29,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506746335] [2019-10-15 01:07:29,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:29,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:07:29,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:07:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:07:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:07:29,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506746335] [2019-10-15 01:07:29,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102769665] [2019-10-15 01:07:29,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true