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 -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:51,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:51,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:51,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:51,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:51,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:51,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:51,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:51,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:51,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:51,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:51,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:51,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:51,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:51,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:51,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:51,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:51,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:51,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:51,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:51,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:51,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:51,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:51,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:51,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:51,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:51,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:51,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:51,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:51,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:51,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:51,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:51,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:51,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:51,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:51,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:51,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:51,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:51,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:51,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:51,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:51,866 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-09-20 12:59:51,880 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:51,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:51,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:51,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:51,882 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:51,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:51,882 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:51,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:51,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:51,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:51,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:51,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:51,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:51,884 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:51,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:51,884 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:51,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:51,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:51,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:51,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:51,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:51,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:51,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:51,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:51,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:51,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:51,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:51,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:51,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:51,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:51,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:51,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:51,935 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:51,935 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:51,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-09-20 12:59:52,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a241e20f/b991847acde2467caf9ce6afa0b1a5a5/FLAGd80aff28b [2019-09-20 12:59:52,564 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:52,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-1.c [2019-09-20 12:59:52,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a241e20f/b991847acde2467caf9ce6afa0b1a5a5/FLAGd80aff28b [2019-09-20 12:59:52,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a241e20f/b991847acde2467caf9ce6afa0b1a5a5 [2019-09-20 12:59:52,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:52,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:52,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:52,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:52,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:52,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:52" (1/1) ... [2019-09-20 12:59:52,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550648e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:52, skipping insertion in model container [2019-09-20 12:59:52,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:52" (1/1) ... [2019-09-20 12:59:52,848 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:52,920 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:53,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:53,449 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:53,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:53,573 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:53,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53 WrapperNode [2019-09-20 12:59:53,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:53,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:53,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:53,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:53,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (1/1) ... [2019-09-20 12:59:53,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:53,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:53,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:53,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:53,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (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-09-20 12:59:53,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:53,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:53,784 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 12:59:53,784 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-09-20 12:59:53,785 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-09-20 12:59:53,785 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-09-20 12:59:53,785 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-09-20 12:59:53,785 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-09-20 12:59:53,786 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-09-20 12:59:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-09-20 12:59:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 12:59:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-20 12:59:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-20 12:59:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-20 12:59:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-20 12:59:53,792 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-20 12:59:53,792 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 12:59:53,792 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 12:59:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 12:59:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 12:59:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 12:59:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-20 12:59:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-20 12:59:53,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-20 12:59:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-09-20 12:59:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-09-20 12:59:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-09-20 12:59:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-09-20 12:59:53,794 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 12:59:53,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-09-20 12:59:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-20 12:59:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-20 12:59:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-20 12:59:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 12:59:53,797 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 12:59:53,798 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 12:59:53,798 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-20 12:59:53,798 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-20 12:59:53,798 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-20 12:59:53,798 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-09-20 12:59:53,798 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-09-20 12:59:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-09-20 12:59:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-09-20 12:59:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 12:59:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 12:59:53,799 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 12:59:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-09-20 12:59:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 12:59:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 12:59:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:53,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:54,211 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,306 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:54,307 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:54,320 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,338 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:54,339 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:54,352 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,594 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-20 12:59:54,594 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-20 12:59:54,596 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,713 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-09-20 12:59:54,714 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-09-20 12:59:54,734 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,767 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 12:59:54,767 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 12:59:54,854 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,866 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:54,866 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:54,867 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,878 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:54,879 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:54,879 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,892 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:54,893 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:54,956 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:54,988 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-20 12:59:54,988 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-20 12:59:54,990 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,130 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-09-20 12:59:55,130 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-09-20 12:59:55,178 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,185 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:55,185 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:55,186 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,202 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:55,203 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:55,203 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:55,209 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:55,209 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:55,223 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:55,224 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:59:55,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:55 BoogieIcfgContainer [2019-09-20 12:59:55,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:55,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:55,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:55,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:55,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:52" (1/3) ... [2019-09-20 12:59:55,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5df52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:55, skipping insertion in model container [2019-09-20 12:59:55,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:53" (2/3) ... [2019-09-20 12:59:55,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5df52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:55, skipping insertion in model container [2019-09-20 12:59:55,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:55" (3/3) ... [2019-09-20 12:59:55,236 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2019-09-20 12:59:55,246 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:55,256 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:55,272 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:55,315 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:55,315 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:55,316 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:55,316 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:55,316 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:55,316 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:55,316 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:55,316 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:55,316 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states. [2019-09-20 12:59:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:55,356 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,357 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:55,359 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1980583479, now seen corresponding path program 1 times [2019-09-20 12:59:55,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:55,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:55,678 INFO L87 Difference]: Start difference. First operand 390 states. Second operand 3 states. [2019-09-20 12:59:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,835 INFO L93 Difference]: Finished difference Result 626 states and 913 transitions. [2019-09-20 12:59:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:55,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 12:59:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,855 INFO L225 Difference]: With dead ends: 626 [2019-09-20 12:59:55,855 INFO L226 Difference]: Without dead ends: 382 [2019-09-20 12:59:55,866 INFO L636 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-09-20 12:59:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-20 12:59:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-09-20 12:59:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-20 12:59:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2019-09-20 12:59:55,969 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 20 [2019-09-20 12:59:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,969 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2019-09-20 12:59:55,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2019-09-20 12:59:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 12:59:55,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,975 INFO L407 BasicCegarLoop]: trace histogram [1, 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-09-20 12:59:55,975 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1877533292, now seen corresponding path program 1 times [2019-09-20 12:59:55,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,201 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2019-09-20 12:59:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,432 INFO L93 Difference]: Finished difference Result 705 states and 959 transitions. [2019-09-20 12:59:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 12:59:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,440 INFO L225 Difference]: With dead ends: 705 [2019-09-20 12:59:56,440 INFO L226 Difference]: Without dead ends: 540 [2019-09-20 12:59:56,442 INFO L636 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-09-20 12:59:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-20 12:59:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 521. [2019-09-20 12:59:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-20 12:59:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 709 transitions. [2019-09-20 12:59:56,503 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 709 transitions. Word has length 25 [2019-09-20 12:59:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,504 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 709 transitions. [2019-09-20 12:59:56,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 709 transitions. [2019-09-20 12:59:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:59:56,506 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,506 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:56,507 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2127650726, now seen corresponding path program 1 times [2019-09-20 12:59:56,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,683 INFO L87 Difference]: Start difference. First operand 521 states and 709 transitions. Second operand 3 states. [2019-09-20 12:59:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,742 INFO L93 Difference]: Finished difference Result 646 states and 866 transitions. [2019-09-20 12:59:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 12:59:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,748 INFO L225 Difference]: With dead ends: 646 [2019-09-20 12:59:56,748 INFO L226 Difference]: Without dead ends: 625 [2019-09-20 12:59:56,749 INFO L636 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-09-20 12:59:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-20 12:59:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 585. [2019-09-20 12:59:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-20 12:59:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 792 transitions. [2019-09-20 12:59:56,787 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 792 transitions. Word has length 31 [2019-09-20 12:59:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,788 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 792 transitions. [2019-09-20 12:59:56,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 792 transitions. [2019-09-20 12:59:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 12:59:56,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,790 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:56,791 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash -984761052, now seen corresponding path program 1 times [2019-09-20 12:59:56,791 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,885 INFO L87 Difference]: Start difference. First operand 585 states and 792 transitions. Second operand 3 states. [2019-09-20 12:59:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,940 INFO L93 Difference]: Finished difference Result 1096 states and 1479 transitions. [2019-09-20 12:59:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 12:59:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,946 INFO L225 Difference]: With dead ends: 1096 [2019-09-20 12:59:56,947 INFO L226 Difference]: Without dead ends: 796 [2019-09-20 12:59:56,948 INFO L636 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-09-20 12:59:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-20 12:59:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 767. [2019-09-20 12:59:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-09-20 12:59:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1042 transitions. [2019-09-20 12:59:57,002 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1042 transitions. Word has length 33 [2019-09-20 12:59:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,003 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1042 transitions. [2019-09-20 12:59:57,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1042 transitions. [2019-09-20 12:59:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:57,017 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,017 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:57,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1494073565, now seen corresponding path program 1 times [2019-09-20 12:59:57,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:57,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:57,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:57,069 INFO L87 Difference]: Start difference. First operand 767 states and 1042 transitions. Second operand 3 states. [2019-09-20 12:59:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,161 INFO L93 Difference]: Finished difference Result 811 states and 1096 transitions. [2019-09-20 12:59:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:57,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 12:59:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,167 INFO L225 Difference]: With dead ends: 811 [2019-09-20 12:59:57,168 INFO L226 Difference]: Without dead ends: 806 [2019-09-20 12:59:57,168 INFO L636 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-09-20 12:59:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-09-20 12:59:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 802. [2019-09-20 12:59:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-09-20 12:59:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1086 transitions. [2019-09-20 12:59:57,218 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1086 transitions. Word has length 39 [2019-09-20 12:59:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,221 INFO L475 AbstractCegarLoop]: Abstraction has 802 states and 1086 transitions. [2019-09-20 12:59:57,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1086 transitions. [2019-09-20 12:59:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 12:59:57,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,224 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:57,224 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1679216250, now seen corresponding path program 1 times [2019-09-20 12:59:57,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:57,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:57,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:57,309 INFO L87 Difference]: Start difference. First operand 802 states and 1086 transitions. Second operand 3 states. [2019-09-20 12:59:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,428 INFO L93 Difference]: Finished difference Result 817 states and 1106 transitions. [2019-09-20 12:59:57,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:57,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-20 12:59:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,435 INFO L225 Difference]: With dead ends: 817 [2019-09-20 12:59:57,435 INFO L226 Difference]: Without dead ends: 814 [2019-09-20 12:59:57,436 INFO L636 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-09-20 12:59:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-20 12:59:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 813. [2019-09-20 12:59:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-09-20 12:59:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1100 transitions. [2019-09-20 12:59:57,484 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1100 transitions. Word has length 38 [2019-09-20 12:59:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,485 INFO L475 AbstractCegarLoop]: Abstraction has 813 states and 1100 transitions. [2019-09-20 12:59:57,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1100 transitions. [2019-09-20 12:59:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 12:59:57,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,488 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:57,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1380961955, now seen corresponding path program 1 times [2019-09-20 12:59:57,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:57,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:57,601 INFO L87 Difference]: Start difference. First operand 813 states and 1100 transitions. Second operand 5 states. [2019-09-20 12:59:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,672 INFO L93 Difference]: Finished difference Result 826 states and 1114 transitions. [2019-09-20 12:59:57,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:57,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-20 12:59:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,678 INFO L225 Difference]: With dead ends: 826 [2019-09-20 12:59:57,679 INFO L226 Difference]: Without dead ends: 811 [2019-09-20 12:59:57,680 INFO L636 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-09-20 12:59:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-09-20 12:59:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2019-09-20 12:59:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-09-20 12:59:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1096 transitions. [2019-09-20 12:59:57,729 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1096 transitions. Word has length 40 [2019-09-20 12:59:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,729 INFO L475 AbstractCegarLoop]: Abstraction has 811 states and 1096 transitions. [2019-09-20 12:59:57,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1096 transitions. [2019-09-20 12:59:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:57,733 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,733 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:57,734 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash 310268416, now seen corresponding path program 1 times [2019-09-20 12:59:57,734 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:57,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:57,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:57,810 INFO L87 Difference]: Start difference. First operand 811 states and 1096 transitions. Second operand 5 states. [2019-09-20 12:59:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,878 INFO L93 Difference]: Finished difference Result 824 states and 1110 transitions. [2019-09-20 12:59:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:57,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-20 12:59:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,886 INFO L225 Difference]: With dead ends: 824 [2019-09-20 12:59:57,886 INFO L226 Difference]: Without dead ends: 804 [2019-09-20 12:59:57,887 INFO L636 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-09-20 12:59:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-09-20 12:59:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2019-09-20 12:59:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-20 12:59:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1087 transitions. [2019-09-20 12:59:57,926 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1087 transitions. Word has length 39 [2019-09-20 12:59:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,926 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1087 transitions. [2019-09-20 12:59:57,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1087 transitions. [2019-09-20 12:59:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 12:59:57,929 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,929 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:57,929 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1241145468, now seen corresponding path program 1 times [2019-09-20 12:59:57,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:58,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:58,013 INFO L87 Difference]: Start difference. First operand 804 states and 1087 transitions. Second operand 3 states. [2019-09-20 12:59:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,148 INFO L93 Difference]: Finished difference Result 1184 states and 1615 transitions. [2019-09-20 12:59:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:58,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-20 12:59:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,157 INFO L225 Difference]: With dead ends: 1184 [2019-09-20 12:59:58,157 INFO L226 Difference]: Without dead ends: 1181 [2019-09-20 12:59:58,159 INFO L636 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-09-20 12:59:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-20 12:59:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 927. [2019-09-20 12:59:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-09-20 12:59:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1256 transitions. [2019-09-20 12:59:58,208 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1256 transitions. Word has length 44 [2019-09-20 12:59:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,209 INFO L475 AbstractCegarLoop]: Abstraction has 927 states and 1256 transitions. [2019-09-20 12:59:58,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1256 transitions. [2019-09-20 12:59:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 12:59:58,211 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,212 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:58,212 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1407580827, now seen corresponding path program 1 times [2019-09-20 12:59:58,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,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-09-20 12:59:58,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:58,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:58,338 INFO L87 Difference]: Start difference. First operand 927 states and 1256 transitions. Second operand 8 states. [2019-09-20 12:59:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,044 INFO L93 Difference]: Finished difference Result 954 states and 1284 transitions. [2019-09-20 12:59:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:59,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-09-20 12:59:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,051 INFO L225 Difference]: With dead ends: 954 [2019-09-20 12:59:59,051 INFO L226 Difference]: Without dead ends: 945 [2019-09-20 12:59:59,052 INFO L636 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-09-20 12:59:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-09-20 12:59:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 927. [2019-09-20 12:59:59,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-09-20 12:59:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1254 transitions. [2019-09-20 12:59:59,102 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1254 transitions. Word has length 43 [2019-09-20 12:59:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,102 INFO L475 AbstractCegarLoop]: Abstraction has 927 states and 1254 transitions. [2019-09-20 12:59:59,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1254 transitions. [2019-09-20 12:59:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-20 12:59:59,104 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,104 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:59,104 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash -319659871, now seen corresponding path program 1 times [2019-09-20 12:59:59,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:59,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:59,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:59,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:59,159 INFO L87 Difference]: Start difference. First operand 927 states and 1254 transitions. Second operand 4 states. [2019-09-20 12:59:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,235 INFO L93 Difference]: Finished difference Result 955 states and 1287 transitions. [2019-09-20 12:59:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:59,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-09-20 12:59:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,242 INFO L225 Difference]: With dead ends: 955 [2019-09-20 12:59:59,242 INFO L226 Difference]: Without dead ends: 933 [2019-09-20 12:59:59,244 INFO L636 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-09-20 12:59:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-09-20 12:59:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 929. [2019-09-20 12:59:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-20 12:59:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1256 transitions. [2019-09-20 12:59:59,293 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1256 transitions. Word has length 42 [2019-09-20 12:59:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,294 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1256 transitions. [2019-09-20 12:59:59,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1256 transitions. [2019-09-20 12:59:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:59:59,296 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,296 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:59:59,297 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,297 INFO L82 PathProgramCache]: Analyzing trace with hash -58863371, now seen corresponding path program 1 times [2019-09-20 12:59:59,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:59,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:59,434 INFO L87 Difference]: Start difference. First operand 929 states and 1256 transitions. Second operand 8 states. [2019-09-20 13:00:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:00,351 INFO L93 Difference]: Finished difference Result 1675 states and 2239 transitions. [2019-09-20 13:00:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:00:00,352 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-09-20 13:00:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:00,358 INFO L225 Difference]: With dead ends: 1675 [2019-09-20 13:00:00,359 INFO L226 Difference]: Without dead ends: 1115 [2019-09-20 13:00:00,360 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:00,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-09-20 13:00:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 920. [2019-09-20 13:00:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-20 13:00:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1235 transitions. [2019-09-20 13:00:00,408 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1235 transitions. Word has length 45 [2019-09-20 13:00:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:00,409 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1235 transitions. [2019-09-20 13:00:00,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1235 transitions. [2019-09-20 13:00:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:00:00,410 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:00,410 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:00,410 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1574584051, now seen corresponding path program 1 times [2019-09-20 13:00:00,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:00,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:00,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:00,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:00,488 INFO L87 Difference]: Start difference. First operand 920 states and 1235 transitions. Second operand 8 states. [2019-09-20 13:00:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,302 INFO L93 Difference]: Finished difference Result 947 states and 1262 transitions. [2019-09-20 13:00:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:01,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-09-20 13:00:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,310 INFO L225 Difference]: With dead ends: 947 [2019-09-20 13:00:01,310 INFO L226 Difference]: Without dead ends: 938 [2019-09-20 13:00:01,311 INFO L636 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-09-20 13:00:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-20 13:00:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 920. [2019-09-20 13:00:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-20 13:00:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1233 transitions. [2019-09-20 13:00:01,369 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1233 transitions. Word has length 44 [2019-09-20 13:00:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,371 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1233 transitions. [2019-09-20 13:00:01,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1233 transitions. [2019-09-20 13:00:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 13:00:01,373 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,374 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:01,374 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash -209494515, now seen corresponding path program 1 times [2019-09-20 13:00:01,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:01,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:01,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:01,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:01,447 INFO L87 Difference]: Start difference. First operand 920 states and 1233 transitions. Second operand 4 states. [2019-09-20 13:00:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,552 INFO L93 Difference]: Finished difference Result 948 states and 1266 transitions. [2019-09-20 13:00:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:01,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-09-20 13:00:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,557 INFO L225 Difference]: With dead ends: 948 [2019-09-20 13:00:01,558 INFO L226 Difference]: Without dead ends: 926 [2019-09-20 13:00:01,559 INFO L636 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-09-20 13:00:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-09-20 13:00:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 920. [2019-09-20 13:00:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-20 13:00:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1233 transitions. [2019-09-20 13:00:01,610 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1233 transitions. Word has length 43 [2019-09-20 13:00:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,610 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1233 transitions. [2019-09-20 13:00:01,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1233 transitions. [2019-09-20 13:00:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:00:01,612 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,612 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:01,613 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1512549362, now seen corresponding path program 1 times [2019-09-20 13:00:01,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:01,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:01,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:01,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:01,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:01,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:01,686 INFO L87 Difference]: Start difference. First operand 920 states and 1233 transitions. Second operand 5 states. [2019-09-20 13:00:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,749 INFO L93 Difference]: Finished difference Result 936 states and 1248 transitions. [2019-09-20 13:00:01,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:01,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-20 13:00:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,755 INFO L225 Difference]: With dead ends: 936 [2019-09-20 13:00:01,755 INFO L226 Difference]: Without dead ends: 918 [2019-09-20 13:00:01,756 INFO L636 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-09-20 13:00:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-20 13:00:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2019-09-20 13:00:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-20 13:00:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1229 transitions. [2019-09-20 13:00:01,801 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1229 transitions. Word has length 45 [2019-09-20 13:00:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,802 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1229 transitions. [2019-09-20 13:00:01,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1229 transitions. [2019-09-20 13:00:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:00:01,804 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,804 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:01,804 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2056203452, now seen corresponding path program 1 times [2019-09-20 13:00:01,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:01,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:01,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:01,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:01,845 INFO L87 Difference]: Start difference. First operand 918 states and 1229 transitions. Second operand 3 states. [2019-09-20 13:00:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,892 INFO L93 Difference]: Finished difference Result 948 states and 1265 transitions. [2019-09-20 13:00:01,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:01,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:00:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,898 INFO L225 Difference]: With dead ends: 948 [2019-09-20 13:00:01,898 INFO L226 Difference]: Without dead ends: 900 [2019-09-20 13:00:01,899 INFO L636 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-09-20 13:00:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-09-20 13:00:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2019-09-20 13:00:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-20 13:00:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1197 transitions. [2019-09-20 13:00:01,956 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1197 transitions. Word has length 46 [2019-09-20 13:00:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,956 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1197 transitions. [2019-09-20 13:00:01,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1197 transitions. [2019-09-20 13:00:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:00:01,959 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,959 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:01,959 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1390121879, now seen corresponding path program 1 times [2019-09-20 13:00:01,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:02,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:02,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:02,019 INFO L87 Difference]: Start difference. First operand 896 states and 1197 transitions. Second operand 5 states. [2019-09-20 13:00:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,094 INFO L93 Difference]: Finished difference Result 912 states and 1212 transitions. [2019-09-20 13:00:02,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:02,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-20 13:00:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,103 INFO L225 Difference]: With dead ends: 912 [2019-09-20 13:00:02,103 INFO L226 Difference]: Without dead ends: 894 [2019-09-20 13:00:02,104 INFO L636 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-09-20 13:00:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-20 13:00:02,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2019-09-20 13:00:02,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2019-09-20 13:00:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1193 transitions. [2019-09-20 13:00:02,185 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1193 transitions. Word has length 47 [2019-09-20 13:00:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,185 INFO L475 AbstractCegarLoop]: Abstraction has 894 states and 1193 transitions. [2019-09-20 13:00:02,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1193 transitions. [2019-09-20 13:00:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:02,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,187 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:02,187 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1483722839, now seen corresponding path program 1 times [2019-09-20 13:00:02,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,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-09-20 13:00:02,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:02,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:02,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:02,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:02,245 INFO L87 Difference]: Start difference. First operand 894 states and 1193 transitions. Second operand 4 states. [2019-09-20 13:00:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,459 INFO L93 Difference]: Finished difference Result 978 states and 1276 transitions. [2019-09-20 13:00:02,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:02,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-09-20 13:00:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,463 INFO L225 Difference]: With dead ends: 978 [2019-09-20 13:00:02,463 INFO L226 Difference]: Without dead ends: 645 [2019-09-20 13:00:02,465 INFO L636 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-09-20 13:00:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-20 13:00:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 608. [2019-09-20 13:00:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-20 13:00:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 786 transitions. [2019-09-20 13:00:02,496 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 786 transitions. Word has length 52 [2019-09-20 13:00:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,496 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 786 transitions. [2019-09-20 13:00:02,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 786 transitions. [2019-09-20 13:00:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:00:02,498 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,498 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:02,499 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash -489978371, now seen corresponding path program 1 times [2019-09-20 13:00:02,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:02,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:02,558 INFO L87 Difference]: Start difference. First operand 608 states and 786 transitions. Second operand 6 states. [2019-09-20 13:00:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,645 INFO L93 Difference]: Finished difference Result 628 states and 806 transitions. [2019-09-20 13:00:02,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:02,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-20 13:00:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,649 INFO L225 Difference]: With dead ends: 628 [2019-09-20 13:00:02,649 INFO L226 Difference]: Without dead ends: 608 [2019-09-20 13:00:02,650 INFO L636 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-09-20 13:00:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-20 13:00:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-20 13:00:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-20 13:00:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 774 transitions. [2019-09-20 13:00:02,678 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 774 transitions. Word has length 50 [2019-09-20 13:00:02,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,679 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 774 transitions. [2019-09-20 13:00:02,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 774 transitions. [2019-09-20 13:00:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:00:02,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,680 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:02,681 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash -192140927, now seen corresponding path program 1 times [2019-09-20 13:00:02,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:02,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:02,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:02,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:02,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:02,720 INFO L87 Difference]: Start difference. First operand 608 states and 774 transitions. Second operand 3 states. [2019-09-20 13:00:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,834 INFO L93 Difference]: Finished difference Result 816 states and 1051 transitions. [2019-09-20 13:00:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:02,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-20 13:00:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,839 INFO L225 Difference]: With dead ends: 816 [2019-09-20 13:00:02,839 INFO L226 Difference]: Without dead ends: 804 [2019-09-20 13:00:02,840 INFO L636 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-09-20 13:00:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-09-20 13:00:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 671. [2019-09-20 13:00:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-20 13:00:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 852 transitions. [2019-09-20 13:00:02,875 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 852 transitions. Word has length 50 [2019-09-20 13:00:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,876 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 852 transitions. [2019-09-20 13:00:02,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 852 transitions. [2019-09-20 13:00:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:02,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,878 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:02,878 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2014423191, now seen corresponding path program 1 times [2019-09-20 13:00:02,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:02,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:00:02,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:00:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:00:02,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:00:02,939 INFO L87 Difference]: Start difference. First operand 671 states and 852 transitions. Second operand 7 states. [2019-09-20 13:00:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,047 INFO L93 Difference]: Finished difference Result 721 states and 906 transitions. [2019-09-20 13:00:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:03,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-20 13:00:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,051 INFO L225 Difference]: With dead ends: 721 [2019-09-20 13:00:03,051 INFO L226 Difference]: Without dead ends: 672 [2019-09-20 13:00:03,052 INFO L636 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-09-20 13:00:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-20 13:00:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 659. [2019-09-20 13:00:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-20 13:00:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2019-09-20 13:00:03,085 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 51 [2019-09-20 13:00:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,085 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2019-09-20 13:00:03,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:00:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2019-09-20 13:00:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:03,087 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,087 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:03,087 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1090292134, now seen corresponding path program 1 times [2019-09-20 13:00:03,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:03,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-09-20 13:00:03,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:03,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:03,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:03,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:03,194 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand 6 states. [2019-09-20 13:00:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,266 INFO L93 Difference]: Finished difference Result 686 states and 864 transitions. [2019-09-20 13:00:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:03,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-09-20 13:00:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,270 INFO L225 Difference]: With dead ends: 686 [2019-09-20 13:00:03,271 INFO L226 Difference]: Without dead ends: 661 [2019-09-20 13:00:03,271 INFO L636 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-09-20 13:00:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-20 13:00:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-09-20 13:00:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-20 13:00:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 835 transitions. [2019-09-20 13:00:03,310 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 835 transitions. Word has length 51 [2019-09-20 13:00:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,311 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 835 transitions. [2019-09-20 13:00:03,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 835 transitions. [2019-09-20 13:00:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:03,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,318 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:03,319 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1208522397, now seen corresponding path program 1 times [2019-09-20 13:00:03,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:03,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:03,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:03,422 INFO L87 Difference]: Start difference. First operand 661 states and 835 transitions. Second operand 8 states. [2019-09-20 13:00:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,599 INFO L93 Difference]: Finished difference Result 691 states and 869 transitions. [2019-09-20 13:00:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:03,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-20 13:00:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,603 INFO L225 Difference]: With dead ends: 691 [2019-09-20 13:00:03,603 INFO L226 Difference]: Without dead ends: 687 [2019-09-20 13:00:03,604 INFO L636 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-09-20 13:00:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-20 13:00:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2019-09-20 13:00:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-20 13:00:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 856 transitions. [2019-09-20 13:00:03,637 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 856 transitions. Word has length 51 [2019-09-20 13:00:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,637 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 856 transitions. [2019-09-20 13:00:03,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 856 transitions. [2019-09-20 13:00:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:03,639 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,640 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:03,640 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1208799227, now seen corresponding path program 1 times [2019-09-20 13:00:03,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:03,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:03,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:03,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:03,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:03,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:03,708 INFO L87 Difference]: Start difference. First operand 679 states and 856 transitions. Second operand 8 states. [2019-09-20 13:00:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,809 INFO L93 Difference]: Finished difference Result 1079 states and 1387 transitions. [2019-09-20 13:00:03,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:03,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-20 13:00:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,814 INFO L225 Difference]: With dead ends: 1079 [2019-09-20 13:00:03,814 INFO L226 Difference]: Without dead ends: 722 [2019-09-20 13:00:03,816 INFO L636 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-09-20 13:00:03,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-09-20 13:00:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 705. [2019-09-20 13:00:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-20 13:00:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 900 transitions. [2019-09-20 13:00:03,851 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 900 transitions. Word has length 51 [2019-09-20 13:00:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,851 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 900 transitions. [2019-09-20 13:00:03,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 900 transitions. [2019-09-20 13:00:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:03,853 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,854 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:03,854 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 987376175, now seen corresponding path program 1 times [2019-09-20 13:00:03,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:04,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:04,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:00:04,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:00:04,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:00:04,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:00:04,070 INFO L87 Difference]: Start difference. First operand 705 states and 900 transitions. Second operand 15 states. [2019-09-20 13:00:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:07,311 INFO L93 Difference]: Finished difference Result 1101 states and 1422 transitions. [2019-09-20 13:00:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:00:07,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-09-20 13:00:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:07,316 INFO L225 Difference]: With dead ends: 1101 [2019-09-20 13:00:07,317 INFO L226 Difference]: Without dead ends: 851 [2019-09-20 13:00:07,318 INFO L636 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-09-20 13:00:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2019-09-20 13:00:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 716. [2019-09-20 13:00:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-20 13:00:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 915 transitions. [2019-09-20 13:00:07,403 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 915 transitions. Word has length 52 [2019-09-20 13:00:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:07,403 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 915 transitions. [2019-09-20 13:00:07,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:00:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 915 transitions. [2019-09-20 13:00:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:07,405 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:07,405 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:07,406 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:07,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1519216017, now seen corresponding path program 1 times [2019-09-20 13:00:07,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:07,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:07,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:07,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:07,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:07,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:07,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:07,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:07,547 INFO L87 Difference]: Start difference. First operand 716 states and 915 transitions. Second operand 10 states. [2019-09-20 13:00:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:09,756 INFO L93 Difference]: Finished difference Result 921 states and 1198 transitions. [2019-09-20 13:00:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:00:09,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-09-20 13:00:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:09,763 INFO L225 Difference]: With dead ends: 921 [2019-09-20 13:00:09,763 INFO L226 Difference]: Without dead ends: 905 [2019-09-20 13:00:09,764 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-09-20 13:00:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 730. [2019-09-20 13:00:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-20 13:00:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 928 transitions. [2019-09-20 13:00:09,808 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 928 transitions. Word has length 52 [2019-09-20 13:00:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:09,809 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 928 transitions. [2019-09-20 13:00:09,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 928 transitions. [2019-09-20 13:00:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:09,811 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:09,811 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:09,812 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash -581698746, now seen corresponding path program 1 times [2019-09-20 13:00:09,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:09,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:09,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:09,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:09,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:09,860 INFO L87 Difference]: Start difference. First operand 730 states and 928 transitions. Second operand 3 states. [2019-09-20 13:00:10,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:10,032 INFO L93 Difference]: Finished difference Result 974 states and 1255 transitions. [2019-09-20 13:00:10,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:10,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-20 13:00:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:10,038 INFO L225 Difference]: With dead ends: 974 [2019-09-20 13:00:10,038 INFO L226 Difference]: Without dead ends: 944 [2019-09-20 13:00:10,039 INFO L636 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-09-20 13:00:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-09-20 13:00:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 802. [2019-09-20 13:00:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-09-20 13:00:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1021 transitions. [2019-09-20 13:00:10,086 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1021 transitions. Word has length 52 [2019-09-20 13:00:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:10,088 INFO L475 AbstractCegarLoop]: Abstraction has 802 states and 1021 transitions. [2019-09-20 13:00:10,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1021 transitions. [2019-09-20 13:00:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:10,090 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:10,091 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:10,091 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -724978104, now seen corresponding path program 1 times [2019-09-20 13:00:10,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:10,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:10,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:10,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:00:10,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:00:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:00:10,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:00:10,170 INFO L87 Difference]: Start difference. First operand 802 states and 1021 transitions. Second operand 7 states. [2019-09-20 13:00:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:10,996 INFO L93 Difference]: Finished difference Result 866 states and 1102 transitions. [2019-09-20 13:00:10,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:10,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-09-20 13:00:10,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:11,000 INFO L225 Difference]: With dead ends: 866 [2019-09-20 13:00:11,001 INFO L226 Difference]: Without dead ends: 760 [2019-09-20 13:00:11,002 INFO L636 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-09-20 13:00:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-09-20 13:00:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 742. [2019-09-20 13:00:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-09-20 13:00:11,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 938 transitions. [2019-09-20 13:00:11,041 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 938 transitions. Word has length 52 [2019-09-20 13:00:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:11,041 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 938 transitions. [2019-09-20 13:00:11,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:00:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 938 transitions. [2019-09-20 13:00:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:00:11,043 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:11,043 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:11,043 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 44639785, now seen corresponding path program 1 times [2019-09-20 13:00:11,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:11,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:11,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:11,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:11,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:11,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:11,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:11,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:11,105 INFO L87 Difference]: Start difference. First operand 742 states and 938 transitions. Second operand 3 states. [2019-09-20 13:00:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:11,199 INFO L93 Difference]: Finished difference Result 1040 states and 1327 transitions. [2019-09-20 13:00:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:11,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-20 13:00:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:11,203 INFO L225 Difference]: With dead ends: 1040 [2019-09-20 13:00:11,204 INFO L226 Difference]: Without dead ends: 742 [2019-09-20 13:00:11,207 INFO L636 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-09-20 13:00:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2019-09-20 13:00:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2019-09-20 13:00:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-09-20 13:00:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 936 transitions. [2019-09-20 13:00:11,247 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 936 transitions. Word has length 58 [2019-09-20 13:00:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:11,248 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 936 transitions. [2019-09-20 13:00:11,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 936 transitions. [2019-09-20 13:00:11,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:11,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:11,250 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:11,250 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1295429258, now seen corresponding path program 1 times [2019-09-20 13:00:11,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:11,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:11,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:11,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:11,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:11,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:11,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:11,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:11,402 INFO L87 Difference]: Start difference. First operand 742 states and 936 transitions. Second operand 11 states. [2019-09-20 13:00:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:12,533 INFO L93 Difference]: Finished difference Result 1091 states and 1402 transitions. [2019-09-20 13:00:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:00:12,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-09-20 13:00:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:12,537 INFO L225 Difference]: With dead ends: 1091 [2019-09-20 13:00:12,538 INFO L226 Difference]: Without dead ends: 781 [2019-09-20 13:00:12,539 INFO L636 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-09-20 13:00:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-09-20 13:00:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 748. [2019-09-20 13:00:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-09-20 13:00:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 945 transitions. [2019-09-20 13:00:12,581 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 945 transitions. Word has length 54 [2019-09-20 13:00:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:12,581 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 945 transitions. [2019-09-20 13:00:12,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 945 transitions. [2019-09-20 13:00:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:00:12,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:12,583 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:12,584 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1936985802, now seen corresponding path program 1 times [2019-09-20 13:00:12,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:12,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:12,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:12,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:12,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:12,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:12,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:12,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:12,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:12,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:12,638 INFO L87 Difference]: Start difference. First operand 748 states and 945 transitions. Second operand 5 states. [2019-09-20 13:00:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,089 INFO L93 Difference]: Finished difference Result 837 states and 1056 transitions. [2019-09-20 13:00:13,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:13,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-20 13:00:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,093 INFO L225 Difference]: With dead ends: 837 [2019-09-20 13:00:13,093 INFO L226 Difference]: Without dead ends: 819 [2019-09-20 13:00:13,094 INFO L636 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-09-20 13:00:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-20 13:00:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 743. [2019-09-20 13:00:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-09-20 13:00:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 935 transitions. [2019-09-20 13:00:13,140 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 935 transitions. Word has length 54 [2019-09-20 13:00:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,140 INFO L475 AbstractCegarLoop]: Abstraction has 743 states and 935 transitions. [2019-09-20 13:00:13,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 935 transitions. [2019-09-20 13:00:13,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:00:13,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,148 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:13,149 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,149 INFO L82 PathProgramCache]: Analyzing trace with hash -88385251, now seen corresponding path program 1 times [2019-09-20 13:00:13,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:13,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:13,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:13,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:13,256 INFO L87 Difference]: Start difference. First operand 743 states and 935 transitions. Second operand 8 states. [2019-09-20 13:00:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,329 INFO L93 Difference]: Finished difference Result 756 states and 947 transitions. [2019-09-20 13:00:13,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:13,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-09-20 13:00:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,333 INFO L225 Difference]: With dead ends: 756 [2019-09-20 13:00:13,333 INFO L226 Difference]: Without dead ends: 728 [2019-09-20 13:00:13,335 INFO L636 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-09-20 13:00:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-09-20 13:00:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2019-09-20 13:00:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2019-09-20 13:00:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 916 transitions. [2019-09-20 13:00:13,383 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 916 transitions. Word has length 55 [2019-09-20 13:00:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,383 INFO L475 AbstractCegarLoop]: Abstraction has 728 states and 916 transitions. [2019-09-20 13:00:13,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 916 transitions. [2019-09-20 13:00:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:00:13,385 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,386 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:13,386 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1842434508, now seen corresponding path program 1 times [2019-09-20 13:00:13,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:13,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:13,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:13,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:13,453 INFO L87 Difference]: Start difference. First operand 728 states and 916 transitions. Second operand 8 states. [2019-09-20 13:00:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:13,657 INFO L93 Difference]: Finished difference Result 751 states and 939 transitions. [2019-09-20 13:00:13,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:13,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-09-20 13:00:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:13,668 INFO L225 Difference]: With dead ends: 751 [2019-09-20 13:00:13,668 INFO L226 Difference]: Without dead ends: 723 [2019-09-20 13:00:13,672 INFO L636 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-09-20 13:00:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-20 13:00:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-09-20 13:00:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-09-20 13:00:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 908 transitions. [2019-09-20 13:00:13,734 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 908 transitions. Word has length 56 [2019-09-20 13:00:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:13,734 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 908 transitions. [2019-09-20 13:00:13,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 908 transitions. [2019-09-20 13:00:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:00:13,738 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:13,738 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:13,739 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 407710022, now seen corresponding path program 1 times [2019-09-20 13:00:13,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:13,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:13,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:13,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:13,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:13,926 INFO L87 Difference]: Start difference. First operand 723 states and 908 transitions. Second operand 5 states. [2019-09-20 13:00:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:14,000 INFO L93 Difference]: Finished difference Result 982 states and 1245 transitions. [2019-09-20 13:00:14,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:14,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-20 13:00:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:14,016 INFO L225 Difference]: With dead ends: 982 [2019-09-20 13:00:14,016 INFO L226 Difference]: Without dead ends: 665 [2019-09-20 13:00:14,018 INFO L636 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-09-20 13:00:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-20 13:00:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2019-09-20 13:00:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-20 13:00:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 824 transitions. [2019-09-20 13:00:14,088 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 824 transitions. Word has length 64 [2019-09-20 13:00:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:14,089 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 824 transitions. [2019-09-20 13:00:14,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:14,089 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 824 transitions. [2019-09-20 13:00:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:00:14,095 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:14,095 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:14,095 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 727993337, now seen corresponding path program 1 times [2019-09-20 13:00:14,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:14,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,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-09-20 13:00:14,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:14,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:14,192 INFO L87 Difference]: Start difference. First operand 665 states and 824 transitions. Second operand 6 states. [2019-09-20 13:00:14,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:14,292 INFO L93 Difference]: Finished difference Result 696 states and 855 transitions. [2019-09-20 13:00:14,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:14,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-20 13:00:14,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:14,296 INFO L225 Difference]: With dead ends: 696 [2019-09-20 13:00:14,296 INFO L226 Difference]: Without dead ends: 672 [2019-09-20 13:00:14,297 INFO L636 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-09-20 13:00:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-09-20 13:00:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2019-09-20 13:00:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-20 13:00:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 818 transitions. [2019-09-20 13:00:14,385 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 818 transitions. Word has length 60 [2019-09-20 13:00:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:14,385 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 818 transitions. [2019-09-20 13:00:14,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 818 transitions. [2019-09-20 13:00:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:00:14,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:14,387 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:14,387 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:14,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1568169683, now seen corresponding path program 1 times [2019-09-20 13:00:14,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:14,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:14,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:14,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:14,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:14,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:14,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:14,454 INFO L87 Difference]: Start difference. First operand 660 states and 818 transitions. Second operand 5 states. [2019-09-20 13:00:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:14,765 INFO L93 Difference]: Finished difference Result 919 states and 1148 transitions. [2019-09-20 13:00:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:14,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-20 13:00:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:14,768 INFO L225 Difference]: With dead ends: 919 [2019-09-20 13:00:14,768 INFO L226 Difference]: Without dead ends: 660 [2019-09-20 13:00:14,771 INFO L636 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-09-20 13:00:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-09-20 13:00:14,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-09-20 13:00:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-20 13:00:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 816 transitions. [2019-09-20 13:00:14,814 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 816 transitions. Word has length 68 [2019-09-20 13:00:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:14,814 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 816 transitions. [2019-09-20 13:00:14,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 816 transitions. [2019-09-20 13:00:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:00:14,817 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:14,817 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:14,817 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1688753324, now seen corresponding path program 1 times [2019-09-20 13:00:14,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:14,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:14,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:14,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:14,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:14,904 INFO L87 Difference]: Start difference. First operand 660 states and 816 transitions. Second operand 9 states. [2019-09-20 13:00:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,104 INFO L93 Difference]: Finished difference Result 689 states and 847 transitions. [2019-09-20 13:00:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:15,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-20 13:00:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,108 INFO L225 Difference]: With dead ends: 689 [2019-09-20 13:00:15,108 INFO L226 Difference]: Without dead ends: 655 [2019-09-20 13:00:15,112 INFO L636 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-09-20 13:00:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-20 13:00:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-09-20 13:00:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-20 13:00:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 808 transitions. [2019-09-20 13:00:15,166 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 808 transitions. Word has length 61 [2019-09-20 13:00:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,168 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 808 transitions. [2019-09-20 13:00:15,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 808 transitions. [2019-09-20 13:00:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:00:15,171 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,171 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:15,171 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1152303328, now seen corresponding path program 1 times [2019-09-20 13:00:15,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:15,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:15,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:15,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:15,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:15,256 INFO L87 Difference]: Start difference. First operand 655 states and 808 transitions. Second operand 5 states. [2019-09-20 13:00:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,317 INFO L93 Difference]: Finished difference Result 778 states and 953 transitions. [2019-09-20 13:00:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:15,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 13:00:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,321 INFO L225 Difference]: With dead ends: 778 [2019-09-20 13:00:15,321 INFO L226 Difference]: Without dead ends: 661 [2019-09-20 13:00:15,323 INFO L636 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-09-20 13:00:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-20 13:00:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2019-09-20 13:00:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-20 13:00:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 812 transitions. [2019-09-20 13:00:15,367 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 812 transitions. Word has length 63 [2019-09-20 13:00:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,367 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 812 transitions. [2019-09-20 13:00:15,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 812 transitions. [2019-09-20 13:00:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:00:15,370 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,370 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:15,370 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,370 INFO L82 PathProgramCache]: Analyzing trace with hash -862866401, now seen corresponding path program 1 times [2019-09-20 13:00:15,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:15,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:15,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:15,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:15,481 INFO L87 Difference]: Start difference. First operand 659 states and 812 transitions. Second operand 9 states. [2019-09-20 13:00:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,578 INFO L93 Difference]: Finished difference Result 896 states and 1085 transitions. [2019-09-20 13:00:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:15,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-20 13:00:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,581 INFO L225 Difference]: With dead ends: 896 [2019-09-20 13:00:15,581 INFO L226 Difference]: Without dead ends: 661 [2019-09-20 13:00:15,583 INFO L636 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-09-20 13:00:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-09-20 13:00:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 659. [2019-09-20 13:00:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-20 13:00:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 811 transitions. [2019-09-20 13:00:15,623 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 811 transitions. Word has length 63 [2019-09-20 13:00:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,623 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 811 transitions. [2019-09-20 13:00:15,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 811 transitions. [2019-09-20 13:00:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:00:15,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,625 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:15,626 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1439197500, now seen corresponding path program 1 times [2019-09-20 13:00:15,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:15,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:15,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:15,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:15,704 INFO L87 Difference]: Start difference. First operand 659 states and 811 transitions. Second operand 9 states. [2019-09-20 13:00:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:15,889 INFO L93 Difference]: Finished difference Result 688 states and 842 transitions. [2019-09-20 13:00:15,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:15,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-09-20 13:00:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:15,893 INFO L225 Difference]: With dead ends: 688 [2019-09-20 13:00:15,893 INFO L226 Difference]: Without dead ends: 653 [2019-09-20 13:00:15,894 INFO L636 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-09-20 13:00:15,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-09-20 13:00:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-09-20 13:00:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-20 13:00:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 802 transitions. [2019-09-20 13:00:15,937 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 802 transitions. Word has length 62 [2019-09-20 13:00:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:15,938 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 802 transitions. [2019-09-20 13:00:15,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 802 transitions. [2019-09-20 13:00:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:00:15,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:15,940 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:15,940 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 607542358, now seen corresponding path program 1 times [2019-09-20 13:00:15,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:15,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:16,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:16,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:16,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:16,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:16,037 INFO L87 Difference]: Start difference. First operand 653 states and 802 transitions. Second operand 9 states. [2019-09-20 13:00:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,242 INFO L93 Difference]: Finished difference Result 682 states and 833 transitions. [2019-09-20 13:00:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:16,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-09-20 13:00:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,244 INFO L225 Difference]: With dead ends: 682 [2019-09-20 13:00:16,244 INFO L226 Difference]: Without dead ends: 648 [2019-09-20 13:00:16,245 INFO L636 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-09-20 13:00:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-20 13:00:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-09-20 13:00:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-20 13:00:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 794 transitions. [2019-09-20 13:00:16,279 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 794 transitions. Word has length 62 [2019-09-20 13:00:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,279 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 794 transitions. [2019-09-20 13:00:16,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 794 transitions. [2019-09-20 13:00:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:00:16,281 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,281 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:16,281 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash 500831766, now seen corresponding path program 1 times [2019-09-20 13:00:16,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:16,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:16,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:16,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:16,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:16,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:16,363 INFO L87 Difference]: Start difference. First operand 648 states and 794 transitions. Second operand 6 states. [2019-09-20 13:00:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,421 INFO L93 Difference]: Finished difference Result 666 states and 810 transitions. [2019-09-20 13:00:16,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:00:16,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-20 13:00:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,423 INFO L225 Difference]: With dead ends: 666 [2019-09-20 13:00:16,423 INFO L226 Difference]: Without dead ends: 640 [2019-09-20 13:00:16,424 INFO L636 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-09-20 13:00:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-20 13:00:16,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-09-20 13:00:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-20 13:00:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 784 transitions. [2019-09-20 13:00:16,457 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 784 transitions. Word has length 63 [2019-09-20 13:00:16,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,457 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 784 transitions. [2019-09-20 13:00:16,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 784 transitions. [2019-09-20 13:00:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:00:16,459 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,459 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:16,459 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -392212102, now seen corresponding path program 1 times [2019-09-20 13:00:16,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:16,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:16,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:16,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:16,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:16,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:16,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:16,528 INFO L87 Difference]: Start difference. First operand 640 states and 784 transitions. Second operand 8 states. [2019-09-20 13:00:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,663 INFO L93 Difference]: Finished difference Result 657 states and 801 transitions. [2019-09-20 13:00:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:16,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-09-20 13:00:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,665 INFO L225 Difference]: With dead ends: 657 [2019-09-20 13:00:16,665 INFO L226 Difference]: Without dead ends: 625 [2019-09-20 13:00:16,666 INFO L636 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-09-20 13:00:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-20 13:00:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-09-20 13:00:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-20 13:00:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 764 transitions. [2019-09-20 13:00:16,708 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 764 transitions. Word has length 62 [2019-09-20 13:00:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,709 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 764 transitions. [2019-09-20 13:00:16,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 764 transitions. [2019-09-20 13:00:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-20 13:00:16,712 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,712 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:16,712 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1207446898, now seen corresponding path program 1 times [2019-09-20 13:00:16,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:16,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:16,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:16,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:16,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:16,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:16,809 INFO L87 Difference]: Start difference. First operand 625 states and 764 transitions. Second operand 6 states. [2019-09-20 13:00:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:16,899 INFO L93 Difference]: Finished difference Result 876 states and 1082 transitions. [2019-09-20 13:00:16,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:16,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-20 13:00:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:16,902 INFO L225 Difference]: With dead ends: 876 [2019-09-20 13:00:16,902 INFO L226 Difference]: Without dead ends: 650 [2019-09-20 13:00:16,904 INFO L636 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-09-20 13:00:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-20 13:00:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 625. [2019-09-20 13:00:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-20 13:00:16,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 762 transitions. [2019-09-20 13:00:16,942 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 762 transitions. Word has length 71 [2019-09-20 13:00:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:16,943 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 762 transitions. [2019-09-20 13:00:16,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 762 transitions. [2019-09-20 13:00:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:00:16,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:16,945 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:16,945 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -251803701, now seen corresponding path program 1 times [2019-09-20 13:00:16,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:16,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:16,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:16,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:17,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:17,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:17,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:17,019 INFO L87 Difference]: Start difference. First operand 625 states and 762 transitions. Second operand 5 states. [2019-09-20 13:00:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,067 INFO L93 Difference]: Finished difference Result 640 states and 778 transitions. [2019-09-20 13:00:17,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:17,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-20 13:00:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,070 INFO L225 Difference]: With dead ends: 640 [2019-09-20 13:00:17,070 INFO L226 Difference]: Without dead ends: 615 [2019-09-20 13:00:17,071 INFO L636 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-09-20 13:00:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-20 13:00:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 605. [2019-09-20 13:00:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-20 13:00:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 740 transitions. [2019-09-20 13:00:17,108 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 740 transitions. Word has length 64 [2019-09-20 13:00:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,108 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 740 transitions. [2019-09-20 13:00:17,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 740 transitions. [2019-09-20 13:00:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-20 13:00:17,110 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,111 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:17,111 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1603697752, now seen corresponding path program 1 times [2019-09-20 13:00:17,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:17,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:17,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:17,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:17,158 INFO L87 Difference]: Start difference. First operand 605 states and 740 transitions. Second operand 3 states. [2019-09-20 13:00:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,204 INFO L93 Difference]: Finished difference Result 962 states and 1188 transitions. [2019-09-20 13:00:17,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:17,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-20 13:00:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,208 INFO L225 Difference]: With dead ends: 962 [2019-09-20 13:00:17,208 INFO L226 Difference]: Without dead ends: 709 [2019-09-20 13:00:17,209 INFO L636 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-09-20 13:00:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-09-20 13:00:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 679. [2019-09-20 13:00:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-20 13:00:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 834 transitions. [2019-09-20 13:00:17,252 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 834 transitions. Word has length 73 [2019-09-20 13:00:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,252 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 834 transitions. [2019-09-20 13:00:17,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 834 transitions. [2019-09-20 13:00:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:00:17,254 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,254 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:17,255 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 438096047, now seen corresponding path program 1 times [2019-09-20 13:00:17,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:17,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:17,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:17,335 INFO L87 Difference]: Start difference. First operand 679 states and 834 transitions. Second operand 9 states. [2019-09-20 13:00:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,562 INFO L93 Difference]: Finished difference Result 708 states and 865 transitions. [2019-09-20 13:00:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:17,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-09-20 13:00:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,566 INFO L225 Difference]: With dead ends: 708 [2019-09-20 13:00:17,566 INFO L226 Difference]: Without dead ends: 633 [2019-09-20 13:00:17,567 INFO L636 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-09-20 13:00:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-20 13:00:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-20 13:00:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-20 13:00:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 777 transitions. [2019-09-20 13:00:17,617 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 777 transitions. Word has length 66 [2019-09-20 13:00:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,617 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 777 transitions. [2019-09-20 13:00:17,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 777 transitions. [2019-09-20 13:00:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:00:17,621 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,621 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:17,621 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash -760769285, now seen corresponding path program 1 times [2019-09-20 13:00:17,622 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:17,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:17,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:17,739 INFO L87 Difference]: Start difference. First operand 633 states and 777 transitions. Second operand 4 states. [2019-09-20 13:00:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,998 INFO L93 Difference]: Finished difference Result 1493 states and 1811 transitions. [2019-09-20 13:00:17,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:17,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:00:17,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,008 INFO L225 Difference]: With dead ends: 1493 [2019-09-20 13:00:18,008 INFO L226 Difference]: Without dead ends: 909 [2019-09-20 13:00:18,011 INFO L636 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-09-20 13:00:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-20 13:00:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 773. [2019-09-20 13:00:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-09-20 13:00:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 936 transitions. [2019-09-20 13:00:18,096 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 936 transitions. Word has length 82 [2019-09-20 13:00:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,096 INFO L475 AbstractCegarLoop]: Abstraction has 773 states and 936 transitions. [2019-09-20 13:00:18,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 936 transitions. [2019-09-20 13:00:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:00:18,098 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,099 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:18,099 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1321469063, now seen corresponding path program 1 times [2019-09-20 13:00:18,099 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:00:18,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:00:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:00:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:00:18,244 INFO L87 Difference]: Start difference. First operand 773 states and 936 transitions. Second operand 7 states. [2019-09-20 13:00:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,215 INFO L93 Difference]: Finished difference Result 1097 states and 1335 transitions. [2019-09-20 13:00:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:19,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-20 13:00:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,218 INFO L225 Difference]: With dead ends: 1097 [2019-09-20 13:00:19,219 INFO L226 Difference]: Without dead ends: 788 [2019-09-20 13:00:19,224 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:00:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-20 13:00:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 757. [2019-09-20 13:00:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-09-20 13:00:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 908 transitions. [2019-09-20 13:00:19,283 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 908 transitions. Word has length 82 [2019-09-20 13:00:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,284 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 908 transitions. [2019-09-20 13:00:19,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:00:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 908 transitions. [2019-09-20 13:00:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:00:19,287 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,288 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:19,288 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 448269423, now seen corresponding path program 1 times [2019-09-20 13:00:19,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:19,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:19,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:19,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:19,347 INFO L87 Difference]: Start difference. First operand 757 states and 908 transitions. Second operand 5 states. [2019-09-20 13:00:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,418 INFO L93 Difference]: Finished difference Result 951 states and 1135 transitions. [2019-09-20 13:00:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:19,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-20 13:00:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,435 INFO L225 Difference]: With dead ends: 951 [2019-09-20 13:00:19,435 INFO L226 Difference]: Without dead ends: 777 [2019-09-20 13:00:19,436 INFO L636 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-09-20 13:00:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-09-20 13:00:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 769. [2019-09-20 13:00:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-20 13:00:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 922 transitions. [2019-09-20 13:00:19,487 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 922 transitions. Word has length 76 [2019-09-20 13:00:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,488 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 922 transitions. [2019-09-20 13:00:19,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 922 transitions. [2019-09-20 13:00:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-20 13:00:19,490 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,490 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:19,491 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1161185424, now seen corresponding path program 1 times [2019-09-20 13:00:19,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:19,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:19,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:19,573 INFO L87 Difference]: Start difference. First operand 769 states and 922 transitions. Second operand 9 states. [2019-09-20 13:00:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,680 INFO L93 Difference]: Finished difference Result 901 states and 1069 transitions. [2019-09-20 13:00:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:19,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-20 13:00:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,683 INFO L225 Difference]: With dead ends: 901 [2019-09-20 13:00:19,684 INFO L226 Difference]: Without dead ends: 723 [2019-09-20 13:00:19,684 INFO L636 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-09-20 13:00:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-20 13:00:19,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 719. [2019-09-20 13:00:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-09-20 13:00:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 855 transitions. [2019-09-20 13:00:19,730 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 855 transitions. Word has length 76 [2019-09-20 13:00:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,731 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 855 transitions. [2019-09-20 13:00:19,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:19,732 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 855 transitions. [2019-09-20 13:00:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:00:19,734 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,734 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:19,734 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 531350456, now seen corresponding path program 1 times [2019-09-20 13:00:19,735 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:19,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:19,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:19,837 INFO L87 Difference]: Start difference. First operand 719 states and 855 transitions. Second operand 6 states. [2019-09-20 13:00:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,929 INFO L93 Difference]: Finished difference Result 1052 states and 1286 transitions. [2019-09-20 13:00:19,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:19,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-20 13:00:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,933 INFO L225 Difference]: With dead ends: 1052 [2019-09-20 13:00:19,934 INFO L226 Difference]: Without dead ends: 798 [2019-09-20 13:00:19,935 INFO L636 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-09-20 13:00:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-20 13:00:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 685. [2019-09-20 13:00:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-09-20 13:00:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 811 transitions. [2019-09-20 13:00:19,986 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 811 transitions. Word has length 83 [2019-09-20 13:00:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,987 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 811 transitions. [2019-09-20 13:00:19,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 811 transitions. [2019-09-20 13:00:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:00:19,989 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,989 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:19,989 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1176705031, now seen corresponding path program 1 times [2019-09-20 13:00:19,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:20,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:20,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:20,052 INFO L87 Difference]: Start difference. First operand 685 states and 811 transitions. Second operand 5 states. [2019-09-20 13:00:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,550 INFO L93 Difference]: Finished difference Result 1233 states and 1441 transitions. [2019-09-20 13:00:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:20,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-20 13:00:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,553 INFO L225 Difference]: With dead ends: 1233 [2019-09-20 13:00:20,554 INFO L226 Difference]: Without dead ends: 783 [2019-09-20 13:00:20,555 INFO L636 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-09-20 13:00:20,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-20 13:00:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 760. [2019-09-20 13:00:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-09-20 13:00:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 885 transitions. [2019-09-20 13:00:20,610 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 885 transitions. Word has length 78 [2019-09-20 13:00:20,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,611 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 885 transitions. [2019-09-20 13:00:20,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 885 transitions. [2019-09-20 13:00:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:00:20,613 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,613 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:20,613 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1769905959, now seen corresponding path program 1 times [2019-09-20 13:00:20,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:20,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:20,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:20,695 INFO L87 Difference]: Start difference. First operand 760 states and 885 transitions. Second operand 9 states. [2019-09-20 13:00:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,896 INFO L93 Difference]: Finished difference Result 762 states and 886 transitions. [2019-09-20 13:00:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:20,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-20 13:00:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,899 INFO L225 Difference]: With dead ends: 762 [2019-09-20 13:00:20,899 INFO L226 Difference]: Without dead ends: 622 [2019-09-20 13:00:20,900 INFO L636 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-09-20 13:00:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-20 13:00:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-09-20 13:00:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-20 13:00:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 726 transitions. [2019-09-20 13:00:20,952 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 726 transitions. Word has length 79 [2019-09-20 13:00:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,952 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 726 transitions. [2019-09-20 13:00:20,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 726 transitions. [2019-09-20 13:00:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:00:20,954 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,954 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:20,955 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1765631649, now seen corresponding path program 1 times [2019-09-20 13:00:20,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:21,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:21,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:21,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:21,050 INFO L87 Difference]: Start difference. First operand 622 states and 726 transitions. Second operand 9 states. [2019-09-20 13:00:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,203 INFO L93 Difference]: Finished difference Result 661 states and 767 transitions. [2019-09-20 13:00:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:21,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-20 13:00:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,206 INFO L225 Difference]: With dead ends: 661 [2019-09-20 13:00:21,206 INFO L226 Difference]: Without dead ends: 640 [2019-09-20 13:00:21,207 INFO L636 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-09-20 13:00:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-20 13:00:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 622. [2019-09-20 13:00:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-20 13:00:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 725 transitions. [2019-09-20 13:00:21,249 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 725 transitions. Word has length 88 [2019-09-20 13:00:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,250 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 725 transitions. [2019-09-20 13:00:21,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 725 transitions. [2019-09-20 13:00:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:00:21,252 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,252 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:21,252 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1105227521, now seen corresponding path program 1 times [2019-09-20 13:00:21,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:21,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:21,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:21,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:21,378 INFO L87 Difference]: Start difference. First operand 622 states and 725 transitions. Second operand 10 states. [2019-09-20 13:00:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,403 INFO L93 Difference]: Finished difference Result 632 states and 733 transitions. [2019-09-20 13:00:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:00:22,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-09-20 13:00:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,406 INFO L225 Difference]: With dead ends: 632 [2019-09-20 13:00:22,406 INFO L226 Difference]: Without dead ends: 627 [2019-09-20 13:00:22,406 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 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-09-20 13:00:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-20 13:00:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 622. [2019-09-20 13:00:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-20 13:00:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 724 transitions. [2019-09-20 13:00:22,450 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 724 transitions. Word has length 83 [2019-09-20 13:00:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,451 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 724 transitions. [2019-09-20 13:00:22,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 724 transitions. [2019-09-20 13:00:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:00:22,452 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,453 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:00:22,453 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash -534357869, now seen corresponding path program 1 times [2019-09-20 13:00:22,453 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:22,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:22,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:22,573 INFO L87 Difference]: Start difference. First operand 622 states and 724 transitions. Second operand 9 states.