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/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:49,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:49,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:50,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:50,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:50,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:50,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:50,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:50,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:50,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:50,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:50,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:50,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:50,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:50,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:50,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:50,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:50,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:50,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:50,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:50,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:50,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:50,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:50,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:50,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:50,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:50,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:50,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:50,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:50,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:50,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:50,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:50,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:50,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:50,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:50,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:50,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:50,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:50,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:50,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:50,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:50,040 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:50,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:50,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:50,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:50,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:50,059 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:50,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:50,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:50,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:50,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:50,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:50,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:50,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:50,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:50,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:50,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:50,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:50,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:50,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:50,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:50,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:50,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:50,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:50,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:50,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:50,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:50,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:50,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:50,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:50,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:50,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:50,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:50,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:50,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:50,146 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:50,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-20 12:59:50,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33b41bf4/062520ecde654baebc3af4db7fdc88d7/FLAG0921167cc [2019-09-20 12:59:50,822 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:50,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-20 12:59:50,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33b41bf4/062520ecde654baebc3af4db7fdc88d7/FLAG0921167cc [2019-09-20 12:59:51,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33b41bf4/062520ecde654baebc3af4db7fdc88d7 [2019-09-20 12:59:51,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:51,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:51,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:51,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:51,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:51,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:51" (1/1) ... [2019-09-20 12:59:51,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296724e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:51, skipping insertion in model container [2019-09-20 12:59:51,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:51" (1/1) ... [2019-09-20 12:59:51,110 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:51,172 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:51,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:51,592 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:51,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:51,724 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:51,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:51 WrapperNode [2019-09-20 12:59:51,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:51,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:51,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:51,729 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:51,748 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:51" (1/1) ... [2019-09-20 12:59:51,748 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:51" (1/1) ... [2019-09-20 12:59:51,779 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:51" (1/1) ... [2019-09-20 12:59:51,780 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:51" (1/1) ... [2019-09-20 12:59:51,819 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:51" (1/1) ... [2019-09-20 12:59:51,832 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:51" (1/1) ... [2019-09-20 12:59:51,837 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:51" (1/1) ... [2019-09-20 12:59:51,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:51,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:51,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:51,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:51,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:51" (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:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:51,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 12:59:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 12:59:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-09-20 12:59:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-09-20 12:59:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-09-20 12:59:51,928 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-09-20 12:59:51,929 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-09-20 12:59:51,929 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-09-20 12:59:51,929 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-09-20 12:59:51,929 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-09-20 12:59:51,929 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-09-20 12:59:51,929 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-09-20 12:59:51,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-09-20 12:59:51,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-09-20 12:59:51,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-09-20 12:59:51,930 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-09-20 12:59:51,930 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 12:59:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-20 12:59:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 12:59:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 12:59:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 12:59:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 12:59:51,932 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 12:59:51,932 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 12:59:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 12:59:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-09-20 12:59:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-09-20 12:59:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-09-20 12:59:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-09-20 12:59:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-09-20 12:59:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-09-20 12:59:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-09-20 12:59:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-09-20 12:59:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-09-20 12:59:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-20 12:59:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 12:59:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 12:59:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 12:59:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 12:59:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 12:59:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:52,364 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:52,554 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-20 12:59:52,555 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-20 12:59:52,576 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:52,718 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-20 12:59:52,719 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-20 12:59:52,748 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:52,774 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 12:59:52,774 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 12:59:52,780 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:52,792 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 12:59:52,792 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 12:59:53,059 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:53,108 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-20 12:59:53,108 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-20 12:59:53,145 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 12:59:53,175 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-20 12:59:53,175 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-20 12:59:53,220 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:53,221 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:59:53,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:53 BoogieIcfgContainer [2019-09-20 12:59:53,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:53,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:53,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:53,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:53,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:51" (1/3) ... [2019-09-20 12:59:53,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3063b833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:53, skipping insertion in model container [2019-09-20 12:59:53,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:51" (2/3) ... [2019-09-20 12:59:53,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3063b833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:53, skipping insertion in model container [2019-09-20 12:59:53,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:53" (3/3) ... [2019-09-20 12:59:53,231 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-09-20 12:59:53,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:53,251 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:53,269 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:53,305 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:53,306 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:53,307 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:53,307 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:53,307 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:53,307 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:53,308 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:53,308 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:53,308 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-09-20 12:59:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:53,349 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:53,350 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:53,352 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-09-20 12:59:53,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:53,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:53,617 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:53,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:53,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:53,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:53,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:53,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:53,642 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-09-20 12:59:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:53,839 INFO L93 Difference]: Finished difference Result 537 states and 780 transitions. [2019-09-20 12:59:53,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:53,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 12:59:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:53,857 INFO L225 Difference]: With dead ends: 537 [2019-09-20 12:59:53,858 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 12:59:53,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:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 12:59:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-09-20 12:59:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-20 12:59:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-09-20 12:59:53,942 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-09-20 12:59:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:53,942 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-09-20 12:59:53,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-09-20 12:59:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 12:59:53,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:53,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] [2019-09-20 12:59:53,945 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:53,946 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-09-20 12:59:53,946 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:53,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:54,107 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:54,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:54,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:54,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:54,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:54,110 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-09-20 12:59:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:54,408 INFO L93 Difference]: Finished difference Result 637 states and 882 transitions. [2019-09-20 12:59:54,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:54,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 12:59:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:54,428 INFO L225 Difference]: With dead ends: 637 [2019-09-20 12:59:54,428 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 12:59:54,431 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:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 12:59:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-09-20 12:59:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-20 12:59:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-09-20 12:59:54,525 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-09-20 12:59:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:54,526 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-09-20 12:59:54,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-09-20 12:59:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:59:54,532 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:54,532 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:54,533 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:54,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-09-20 12:59:54,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:54,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:54,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:54,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:54,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:54,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:54,714 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-09-20 12:59:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:54,804 INFO L93 Difference]: Finished difference Result 963 states and 1383 transitions. [2019-09-20 12:59:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:54,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 12:59:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:54,815 INFO L225 Difference]: With dead ends: 963 [2019-09-20 12:59:54,815 INFO L226 Difference]: Without dead ends: 646 [2019-09-20 12:59:54,819 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-20 12:59:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-09-20 12:59:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-20 12:59:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-09-20 12:59:54,882 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-09-20 12:59:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:54,882 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-09-20 12:59:54,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-09-20 12:59:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 12:59:54,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:54,885 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] [2019-09-20 12:59:54,885 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-09-20 12:59:54,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:54,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:54,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,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:55,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:55,014 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-09-20 12:59:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,114 INFO L93 Difference]: Finished difference Result 621 states and 887 transitions. [2019-09-20 12:59:55,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:55,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 12:59:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,121 INFO L225 Difference]: With dead ends: 621 [2019-09-20 12:59:55,121 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 12:59:55,122 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:55,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 12:59:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-09-20 12:59:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-20 12:59:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-09-20 12:59:55,168 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-09-20 12:59:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,168 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-09-20 12:59:55,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-09-20 12:59:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:55,173 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,173 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:55,173 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-09-20 12:59:55,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,245 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,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:55,247 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-09-20 12:59:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,331 INFO L93 Difference]: Finished difference Result 1072 states and 1583 transitions. [2019-09-20 12:59:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:55,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 12:59:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,348 INFO L225 Difference]: With dead ends: 1072 [2019-09-20 12:59:55,357 INFO L226 Difference]: Without dead ends: 1053 [2019-09-20 12:59:55,360 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,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-20 12:59:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-09-20 12:59:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-09-20 12:59:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-09-20 12:59:55,446 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-09-20 12:59:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,449 INFO L475 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-09-20 12:59:55,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-09-20 12:59:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 12:59:55,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,451 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:55,452 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-09-20 12:59:55,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,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 12:59:55,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:55,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:55,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:55,528 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-09-20 12:59:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,658 INFO L93 Difference]: Finished difference Result 1050 states and 1554 transitions. [2019-09-20 12:59:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:55,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 12:59:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,668 INFO L225 Difference]: With dead ends: 1050 [2019-09-20 12:59:55,668 INFO L226 Difference]: Without dead ends: 1045 [2019-09-20 12:59:55,670 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,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-20 12:59:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-09-20 12:59:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-20 12:59:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-09-20 12:59:55,725 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-09-20 12:59:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,725 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-09-20 12:59:55,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-09-20 12:59:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 12:59:55,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,728 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:55,728 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,729 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-09-20 12:59:55,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:55,797 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,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:55,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:55,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:55,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:55,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:55,799 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-09-20 12:59:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:55,871 INFO L93 Difference]: Finished difference Result 1058 states and 1564 transitions. [2019-09-20 12:59:55,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:55,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-20 12:59:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:55,881 INFO L225 Difference]: With dead ends: 1058 [2019-09-20 12:59:55,881 INFO L226 Difference]: Without dead ends: 1036 [2019-09-20 12:59:55,882 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 12:59:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-20 12:59:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-09-20 12:59:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-20 12:59:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-09-20 12:59:55,981 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-09-20 12:59:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:55,983 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-09-20 12:59:55,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-09-20 12:59:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:59:55,985 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:55,986 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:55,986 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:55,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-09-20 12:59:55,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:55,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:55,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:55,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:55,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,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 12:59:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:56,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:56,070 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-09-20 12:59:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:56,132 INFO L93 Difference]: Finished difference Result 1448 states and 2195 transitions. [2019-09-20 12:59:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:56,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 12:59:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:56,142 INFO L225 Difference]: With dead ends: 1448 [2019-09-20 12:59:56,142 INFO L226 Difference]: Without dead ends: 578 [2019-09-20 12:59:56,152 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:56,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-20 12:59:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-09-20 12:59:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-20 12:59:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-09-20 12:59:56,198 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-09-20 12:59:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:56,198 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-09-20 12:59:56,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-09-20 12:59:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 12:59:56,201 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:56,201 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:56,202 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-09-20 12:59:56,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:56,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:56,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:56,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 12:59:56,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:56,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:56,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:56,380 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-09-20 12:59:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:57,378 INFO L93 Difference]: Finished difference Result 607 states and 855 transitions. [2019-09-20 12:59:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:57,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-20 12:59:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:57,384 INFO L225 Difference]: With dead ends: 607 [2019-09-20 12:59:57,384 INFO L226 Difference]: Without dead ends: 601 [2019-09-20 12:59:57,386 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-20 12:59:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-20 12:59:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-20 12:59:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-09-20 12:59:57,423 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-09-20 12:59:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:57,424 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-09-20 12:59:57,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-09-20 12:59:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:59:57,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:57,425 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:57,425 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-09-20 12:59:57,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:57,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:57,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:57,554 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,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:57,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 12:59:57,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:57,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:57,557 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-09-20 12:59:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,393 INFO L93 Difference]: Finished difference Result 607 states and 853 transitions. [2019-09-20 12:59:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:58,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-20 12:59:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,400 INFO L225 Difference]: With dead ends: 607 [2019-09-20 12:59:58,400 INFO L226 Difference]: Without dead ends: 601 [2019-09-20 12:59:58,401 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-20 12:59:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-20 12:59:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-20 12:59:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-09-20 12:59:58,468 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-09-20 12:59:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,468 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-09-20 12:59:58,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-09-20 12:59:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 12:59:58,470 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,470 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 12:59:58,470 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-09-20 12:59:58,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,551 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,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:58,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:58,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:58,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:58,553 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-09-20 12:59:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,629 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-09-20 12:59:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:59:58,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-20 12:59:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,634 INFO L225 Difference]: With dead ends: 601 [2019-09-20 12:59:58,634 INFO L226 Difference]: Without dead ends: 576 [2019-09-20 12:59:58,636 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 12:59:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-20 12:59:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-20 12:59:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-20 12:59:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-09-20 12:59:58,677 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-09-20 12:59:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,677 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-09-20 12:59:58,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-09-20 12:59:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 12:59:58,678 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,679 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 12:59:58,679 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-09-20 12:59:58,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:58,723 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,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:58,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:58,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:58,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:58,725 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-09-20 12:59:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:58,901 INFO L93 Difference]: Finished difference Result 810 states and 1201 transitions. [2019-09-20 12:59:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:58,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 12:59:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:58,911 INFO L225 Difference]: With dead ends: 810 [2019-09-20 12:59:58,911 INFO L226 Difference]: Without dead ends: 802 [2019-09-20 12:59:58,913 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,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-20 12:59:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-09-20 12:59:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-20 12:59:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-09-20 12:59:58,972 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-09-20 12:59:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:58,973 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-09-20 12:59:58,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-09-20 12:59:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:58,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:58,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, 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,976 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1713004902, now seen corresponding path program 1 times [2019-09-20 12:59:58,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:58,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:58,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:58,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:58,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,053 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,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:59:59,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:59,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:59,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:59,055 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-09-20 12:59:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,390 INFO L93 Difference]: Finished difference Result 719 states and 992 transitions. [2019-09-20 12:59:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:59,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-20 12:59:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,394 INFO L225 Difference]: With dead ends: 719 [2019-09-20 12:59:59,394 INFO L226 Difference]: Without dead ends: 452 [2019-09-20 12:59:59,396 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 12:59:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-20 12:59:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-09-20 12:59:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-20 12:59:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-09-20 12:59:59,435 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 49 [2019-09-20 12:59:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,437 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-09-20 12:59:59,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-09-20 12:59:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:59,439 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,439 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 12:59:59,440 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,440 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-09-20 12:59:59,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,528 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,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:59,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:59,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:59,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:59,530 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-09-20 12:59:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,755 INFO L93 Difference]: Finished difference Result 447 states and 582 transitions. [2019-09-20 12:59:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:59,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-20 12:59:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,758 INFO L225 Difference]: With dead ends: 447 [2019-09-20 12:59:59,758 INFO L226 Difference]: Without dead ends: 443 [2019-09-20 12:59:59,760 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 12:59:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-20 12:59:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-20 12:59:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-20 12:59:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-09-20 12:59:59,794 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-09-20 12:59:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:59,794 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-09-20 12:59:59,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-09-20 12:59:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:59,797 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:59,797 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 12:59:59,797 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-09-20 12:59:59,798 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:59,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:59,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:59,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:59,891 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,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:59,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 12:59:59,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:59,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:59,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:59,892 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-09-20 12:59:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:59,983 INFO L93 Difference]: Finished difference Result 760 states and 1040 transitions. [2019-09-20 12:59:59,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:59,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-20 12:59:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:59,987 INFO L225 Difference]: With dead ends: 760 [2019-09-20 12:59:59,987 INFO L226 Difference]: Without dead ends: 462 [2019-09-20 12:59:59,991 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 12:59:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-20 13:00:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-09-20 13:00:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-20 13:00:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-20 13:00:00,031 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-09-20 13:00:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:00,032 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-20 13:00:00,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-20 13:00:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:00:00,033 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:00,033 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] [2019-09-20 13:00:00,034 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-09-20 13:00:00,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:00,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:00,212 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,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:00,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:00,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:00,215 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-09-20 13:00:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,141 INFO L93 Difference]: Finished difference Result 776 states and 1071 transitions. [2019-09-20 13:00:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:01,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-20 13:00:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,146 INFO L225 Difference]: With dead ends: 776 [2019-09-20 13:00:01,146 INFO L226 Difference]: Without dead ends: 475 [2019-09-20 13:00:01,148 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-20 13:00:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-09-20 13:00:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-20 13:00:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-20 13:00:01,180 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-09-20 13:00:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,181 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-20 13:00:01,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-20 13:00:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:00:01,183 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,184 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] [2019-09-20 13:00:01,184 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-09-20 13:00:01,184 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:01,274 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,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:01,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:01,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:01,276 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-09-20 13:00:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:01,914 INFO L93 Difference]: Finished difference Result 580 states and 794 transitions. [2019-09-20 13:00:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:01,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-20 13:00:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:01,919 INFO L225 Difference]: With dead ends: 580 [2019-09-20 13:00:01,920 INFO L226 Difference]: Without dead ends: 561 [2019-09-20 13:00:01,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-20 13:00:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-09-20 13:00:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-20 13:00:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-09-20 13:00:01,950 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-09-20 13:00:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:01,950 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-09-20 13:00:01,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-09-20 13:00:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:00:01,951 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:01,952 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] [2019-09-20 13:00:01,952 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-09-20 13:00:01,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:01,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:01,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:01,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,028 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,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:02,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:02,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:02,030 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-09-20 13:00:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,186 INFO L93 Difference]: Finished difference Result 448 states and 584 transitions. [2019-09-20 13:00:02,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:02,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 13:00:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,189 INFO L225 Difference]: With dead ends: 448 [2019-09-20 13:00:02,189 INFO L226 Difference]: Without dead ends: 417 [2019-09-20 13:00:02,190 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:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-20 13:00:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-09-20 13:00:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:00:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-09-20 13:00:02,216 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-09-20 13:00:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,217 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-09-20 13:00:02,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-09-20 13:00:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:00:02,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:02,224 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-09-20 13:00:02,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,277 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,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:02,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:02,280 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-09-20 13:00:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,327 INFO L93 Difference]: Finished difference Result 432 states and 563 transitions. [2019-09-20 13:00:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:02,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-20 13:00:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,331 INFO L225 Difference]: With dead ends: 432 [2019-09-20 13:00:02,331 INFO L226 Difference]: Without dead ends: 399 [2019-09-20 13:00:02,332 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,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-20 13:00:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-09-20 13:00:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-20 13:00:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-09-20 13:00:02,353 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-09-20 13:00:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,353 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-09-20 13:00:02,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-09-20 13:00:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:00:02,354 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,355 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,355 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-09-20 13:00:02,355 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,431 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,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:02,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:02,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:02,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:02,432 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-09-20 13:00:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,560 INFO L93 Difference]: Finished difference Result 429 states and 565 transitions. [2019-09-20 13:00:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:02,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-09-20 13:00:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,564 INFO L225 Difference]: With dead ends: 429 [2019-09-20 13:00:02,564 INFO L226 Difference]: Without dead ends: 408 [2019-09-20 13:00:02,564 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:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-20 13:00:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-09-20 13:00:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-20 13:00:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-09-20 13:00:02,608 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-09-20 13:00:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,608 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-09-20 13:00:02,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-09-20 13:00:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:02,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,609 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,609 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-09-20 13:00:02,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,654 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,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:02,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:02,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:02,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:02,656 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-09-20 13:00:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:02,690 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2019-09-20 13:00:02,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:00:02,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:00:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:02,693 INFO L225 Difference]: With dead ends: 436 [2019-09-20 13:00:02,693 INFO L226 Difference]: Without dead ends: 410 [2019-09-20 13:00:02,694 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:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-20 13:00:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-09-20 13:00:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-20 13:00:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-09-20 13:00:02,718 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-09-20 13:00:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:02,718 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-09-20 13:00:02,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-09-20 13:00:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:02,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:02,721 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,721 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-09-20 13:00:02,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:02,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:02,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:02,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:02,789 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,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:02,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:00:02,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:00:02,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:00:02,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:00:02,791 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-09-20 13:00:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,485 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2019-09-20 13:00:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:03,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-20 13:00:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,490 INFO L225 Difference]: With dead ends: 565 [2019-09-20 13:00:03,490 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:00:03,491 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:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:00:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-09-20 13:00:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-20 13:00:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-09-20 13:00:03,521 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-09-20 13:00:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,521 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-09-20 13:00:03,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:00:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-09-20 13:00:03,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:00:03,523 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,523 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,523 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-09-20 13:00:03,524 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:03,560 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,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:03,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:03,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:03,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:03,562 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-09-20 13:00:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,676 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2019-09-20 13:00:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:03,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-20 13:00:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,681 INFO L225 Difference]: With dead ends: 673 [2019-09-20 13:00:03,681 INFO L226 Difference]: Without dead ends: 659 [2019-09-20 13:00:03,682 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:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-20 13:00:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-09-20 13:00:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-20 13:00:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-09-20 13:00:03,721 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-09-20 13:00:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,721 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-09-20 13:00:03,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-09-20 13:00:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:00:03,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,723 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,723 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-09-20 13:00:03,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:03,790 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,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:03,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:00:03,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:00:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:00:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:03,792 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-09-20 13:00:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:03,866 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2019-09-20 13:00:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:00:03,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-20 13:00:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:03,872 INFO L225 Difference]: With dead ends: 598 [2019-09-20 13:00:03,872 INFO L226 Difference]: Without dead ends: 574 [2019-09-20 13:00:03,877 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,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-20 13:00:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-20 13:00:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-20 13:00:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-09-20 13:00:03,917 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-09-20 13:00:03,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:03,918 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-09-20 13:00:03,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:00:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-09-20 13:00:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:03,919 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:03,919 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] [2019-09-20 13:00:03,920 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-09-20 13:00:03,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:03,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:03,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:03,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:04,207 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,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:04,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:04,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:04,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:04,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:04,210 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-09-20 13:00:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:04,974 INFO L93 Difference]: Finished difference Result 597 states and 868 transitions. [2019-09-20 13:00:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:00:04,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-09-20 13:00:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:04,981 INFO L225 Difference]: With dead ends: 597 [2019-09-20 13:00:04,981 INFO L226 Difference]: Without dead ends: 573 [2019-09-20 13:00:04,982 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-20 13:00:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-09-20 13:00:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-20 13:00:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-09-20 13:00:05,029 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-09-20 13:00:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:05,030 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-09-20 13:00:05,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-09-20 13:00:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:00:05,031 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:05,032 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] [2019-09-20 13:00:05,032 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-09-20 13:00:05,033 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:05,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:05,103 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:05,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:05,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:05,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:05,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:05,105 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-09-20 13:00:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:05,622 INFO L93 Difference]: Finished difference Result 659 states and 987 transitions. [2019-09-20 13:00:05,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:05,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-20 13:00:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:05,628 INFO L225 Difference]: With dead ends: 659 [2019-09-20 13:00:05,629 INFO L226 Difference]: Without dead ends: 624 [2019-09-20 13:00:05,630 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:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-20 13:00:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-09-20 13:00:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-20 13:00:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-09-20 13:00:05,671 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-09-20 13:00:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:05,671 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-09-20 13:00:05,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-09-20 13:00:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:00:05,672 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:05,672 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:05,673 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-09-20 13:00:05,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:05,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:05,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:05,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:05,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:05,733 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:05,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:05,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:05,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:05,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:05,734 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-09-20 13:00:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:05,799 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2019-09-20 13:00:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:05,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-20 13:00:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:05,805 INFO L225 Difference]: With dead ends: 955 [2019-09-20 13:00:05,806 INFO L226 Difference]: Without dead ends: 527 [2019-09-20 13:00:05,809 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:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-20 13:00:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-20 13:00:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-20 13:00:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-09-20 13:00:05,841 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-09-20 13:00:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:05,841 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-09-20 13:00:05,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-09-20 13:00:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:00:05,867 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:05,867 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:05,868 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-09-20 13:00:05,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:05,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:05,953 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:05,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:05,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:00:05,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:00:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:00:05,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:00:05,954 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-09-20 13:00:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:06,148 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2019-09-20 13:00:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:06,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-20 13:00:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:06,154 INFO L225 Difference]: With dead ends: 529 [2019-09-20 13:00:06,154 INFO L226 Difference]: Without dead ends: 466 [2019-09-20 13:00:06,155 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-20 13:00:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-20 13:00:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-20 13:00:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-09-20 13:00:06,192 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-09-20 13:00:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,192 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-09-20 13:00:06,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:00:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-09-20 13:00:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:00:06,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,194 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:06,194 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,194 INFO L82 PathProgramCache]: Analyzing trace with hash 521869307, now seen corresponding path program 1 times [2019-09-20 13:00:06,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,264 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:06,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:06,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:06,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:06,266 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-09-20 13:00:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:06,327 INFO L93 Difference]: Finished difference Result 924 states and 1444 transitions. [2019-09-20 13:00:06,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:06,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-09-20 13:00:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:06,331 INFO L225 Difference]: With dead ends: 924 [2019-09-20 13:00:06,332 INFO L226 Difference]: Without dead ends: 497 [2019-09-20 13:00:06,336 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:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-20 13:00:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-09-20 13:00:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-20 13:00:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-09-20 13:00:06,368 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 63 [2019-09-20 13:00:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,369 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-09-20 13:00:06,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-09-20 13:00:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:00:06,370 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,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:06,370 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-09-20 13:00:06,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,413 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:06,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:06,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:06,415 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-09-20 13:00:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:06,514 INFO L93 Difference]: Finished difference Result 735 states and 1199 transitions. [2019-09-20 13:00:06,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:06,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-20 13:00:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:06,520 INFO L225 Difference]: With dead ends: 735 [2019-09-20 13:00:06,521 INFO L226 Difference]: Without dead ends: 732 [2019-09-20 13:00:06,522 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:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-09-20 13:00:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-09-20 13:00:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-20 13:00:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-09-20 13:00:06,560 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-09-20 13:00:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:06,560 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-09-20 13:00:06,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-09-20 13:00:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:00:06,561 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:06,561 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] [2019-09-20 13:00:06,562 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1133247993, now seen corresponding path program 1 times [2019-09-20 13:00:06,562 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:06,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:06,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:06,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:06,710 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:06,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:06,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:00:06,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:06,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:06,712 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-09-20 13:00:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:07,590 INFO L93 Difference]: Finished difference Result 1228 states and 2118 transitions. [2019-09-20 13:00:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:00:07,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-20 13:00:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:07,599 INFO L225 Difference]: With dead ends: 1228 [2019-09-20 13:00:07,599 INFO L226 Difference]: Without dead ends: 786 [2019-09-20 13:00:07,604 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:00:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-20 13:00:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-09-20 13:00:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-20 13:00:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-09-20 13:00:07,700 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 65 [2019-09-20 13:00:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:07,701 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-09-20 13:00:07,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-09-20 13:00:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:00:07,703 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:07,703 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] [2019-09-20 13:00:07,704 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-09-20 13:00:07,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:07,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:07,931 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,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:07,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:07,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:07,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:07,934 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-09-20 13:00:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:08,016 INFO L93 Difference]: Finished difference Result 808 states and 1290 transitions. [2019-09-20 13:00:08,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:08,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-20 13:00:08,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:08,021 INFO L225 Difference]: With dead ends: 808 [2019-09-20 13:00:08,021 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:00:08,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:00:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:00:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-09-20 13:00:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-20 13:00:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-09-20 13:00:08,065 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-09-20 13:00:08,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:08,066 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-09-20 13:00:08,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-09-20 13:00:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:00:08,068 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:08,068 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] [2019-09-20 13:00:08,069 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-09-20 13:00:08,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:08,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:08,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:08,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:08,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:08,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:08,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:08,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:08,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:08,174 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-09-20 13:00:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:08,433 INFO L93 Difference]: Finished difference Result 602 states and 874 transitions. [2019-09-20 13:00:08,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:08,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-20 13:00:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:08,436 INFO L225 Difference]: With dead ends: 602 [2019-09-20 13:00:08,437 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:00:08,440 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:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:00:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-20 13:00:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-20 13:00:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-09-20 13:00:08,465 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-09-20 13:00:08,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:08,468 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-09-20 13:00:08,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-09-20 13:00:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:00:08,469 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:08,469 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] [2019-09-20 13:00:08,469 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:08,470 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-09-20 13:00:08,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:08,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:08,635 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:08,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:08,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:00:08,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:00:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:00:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:00:08,638 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-09-20 13:00:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:09,590 INFO L93 Difference]: Finished difference Result 632 states and 901 transitions. [2019-09-20 13:00:09,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:09,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-20 13:00:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:09,593 INFO L225 Difference]: With dead ends: 632 [2019-09-20 13:00:09,594 INFO L226 Difference]: Without dead ends: 384 [2019-09-20 13:00:09,596 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:00:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-20 13:00:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-09-20 13:00:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-20 13:00:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-09-20 13:00:09,626 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-09-20 13:00:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:09,627 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-09-20 13:00:09,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:00:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-09-20 13:00:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:00:09,628 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:09,628 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] [2019-09-20 13:00:09,628 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-09-20 13:00:09,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:09,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:09,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:09,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:09,762 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,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:09,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:09,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:09,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:09,765 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-09-20 13:00:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:10,230 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2019-09-20 13:00:10,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:10,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-20 13:00:10,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:10,234 INFO L225 Difference]: With dead ends: 671 [2019-09-20 13:00:10,234 INFO L226 Difference]: Without dead ends: 407 [2019-09-20 13:00:10,236 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-20 13:00:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-09-20 13:00:10,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-20 13:00:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-09-20 13:00:10,268 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-09-20 13:00:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:10,269 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-09-20 13:00:10,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-09-20 13:00:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:00:10,270 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:10,270 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] [2019-09-20 13:00:10,270 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-09-20 13:00:10,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:10,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:10,351 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,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:10,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:10,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:10,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:10,352 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-09-20 13:00:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:10,408 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2019-09-20 13:00:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:10,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-20 13:00:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:10,412 INFO L225 Difference]: With dead ends: 676 [2019-09-20 13:00:10,412 INFO L226 Difference]: Without dead ends: 369 [2019-09-20 13:00:10,415 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:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-20 13:00:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-20 13:00:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-20 13:00:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-09-20 13:00:10,444 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-09-20 13:00:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:10,445 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-09-20 13:00:10,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-09-20 13:00:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:00:10,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:10,446 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:10,447 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:10,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-09-20 13:00:10,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:10,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:10,521 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,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:10,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:10,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:10,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:10,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:10,525 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-09-20 13:00:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:10,906 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2019-09-20 13:00:10,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:00:10,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-20 13:00:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:10,911 INFO L225 Difference]: With dead ends: 642 [2019-09-20 13:00:10,911 INFO L226 Difference]: Without dead ends: 337 [2019-09-20 13:00:10,920 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-20 13:00:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-09-20 13:00:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-20 13:00:10,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-09-20 13:00:10,962 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-09-20 13:00:10,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:10,966 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-09-20 13:00:10,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-09-20 13:00:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-20 13:00:10,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:10,969 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, 1, 1, 1, 1] [2019-09-20 13:00:10,970 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-09-20 13:00:10,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:10,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:10,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:10,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:11,196 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,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:00:11,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:00:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:00:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:00:11,198 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-09-20 13:00:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:11,431 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2019-09-20 13:00:11,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:00:11,431 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-09-20 13:00:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:11,434 INFO L225 Difference]: With dead ends: 357 [2019-09-20 13:00:11,434 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:00:11,435 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:00:11,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-20 13:00:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-20 13:00:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-09-20 13:00:11,461 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-09-20 13:00:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:11,461 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-09-20 13:00:11,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:00:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-09-20 13:00:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:00:11,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:11,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:11,464 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-09-20 13:00:11,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:11,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:11,550 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,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:11,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:00:11,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:00:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:00:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:11,551 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-09-20 13:00:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:11,968 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2019-09-20 13:00:11,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:11,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-20 13:00:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:11,972 INFO L225 Difference]: With dead ends: 726 [2019-09-20 13:00:11,972 INFO L226 Difference]: Without dead ends: 458 [2019-09-20 13:00:11,973 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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:11,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-20 13:00:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-09-20 13:00:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:00:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-09-20 13:00:12,011 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-09-20 13:00:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:12,012 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-09-20 13:00:12,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:00:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-09-20 13:00:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:00:12,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:12,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:12,014 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-09-20 13:00:12,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:12,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:12,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:12,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:12,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:12,182 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,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:12,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:00:12,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:00:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:00:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:00:12,184 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-09-20 13:00:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:14,299 INFO L93 Difference]: Finished difference Result 816 states and 1035 transitions. [2019-09-20 13:00:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:00:14,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-20 13:00:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:14,305 INFO L225 Difference]: With dead ends: 816 [2019-09-20 13:00:14,305 INFO L226 Difference]: Without dead ends: 774 [2019-09-20 13:00:14,306 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:00:14,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-20 13:00:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-09-20 13:00:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-20 13:00:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-09-20 13:00:14,358 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-09-20 13:00:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:14,358 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-09-20 13:00:14,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:00:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-09-20 13:00:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:00:14,360 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:14,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:14,360 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-09-20 13:00:14,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:14,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:14,540 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,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:14,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:00:14,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:00:14,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:00:14,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:00:14,542 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-09-20 13:00:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,221 INFO L93 Difference]: Finished difference Result 797 states and 1012 transitions. [2019-09-20 13:00:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:00:17,222 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-20 13:00:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,227 INFO L225 Difference]: With dead ends: 797 [2019-09-20 13:00:17,227 INFO L226 Difference]: Without dead ends: 755 [2019-09-20 13:00:17,228 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:00:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-20 13:00:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-09-20 13:00:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-20 13:00:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-09-20 13:00:17,273 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-09-20 13:00:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,273 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-09-20 13:00:17,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:00:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-09-20 13:00:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:00:17,275 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,275 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, 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,275 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-09-20 13:00:17,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:17,576 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,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:17,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:00:17,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:00:17,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:00:17,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:00:17,577 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-09-20 13:00:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:17,936 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2019-09-20 13:00:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:00:17,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-20 13:00:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:17,940 INFO L225 Difference]: With dead ends: 423 [2019-09-20 13:00:17,941 INFO L226 Difference]: Without dead ends: 396 [2019-09-20 13:00:17,941 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:00:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-20 13:00:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-09-20 13:00:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-20 13:00:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-09-20 13:00:17,974 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-09-20 13:00:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:17,975 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-09-20 13:00:17,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:00:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-09-20 13:00:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:00:17,979 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:17,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 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,980 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:17,980 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-09-20 13:00:17,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:17,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:17,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:17,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,154 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,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:00:18,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:00:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:00:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:00:18,157 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-09-20 13:00:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,236 INFO L93 Difference]: Finished difference Result 781 states and 987 transitions. [2019-09-20 13:00:20,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:00:20,237 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-20 13:00:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,243 INFO L225 Difference]: With dead ends: 781 [2019-09-20 13:00:20,243 INFO L226 Difference]: Without dead ends: 719 [2019-09-20 13:00:20,246 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:00:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-20 13:00:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-09-20 13:00:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-20 13:00:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-09-20 13:00:20,326 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-09-20 13:00:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,326 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-09-20 13:00:20,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:00:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-09-20 13:00:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:00:20,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,329 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, 1, 1, 1, 1, 1, 1, 1, 1, 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,329 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-09-20 13:00:20,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat